Computing Genome Edit Distances using Domain-Independent Planning

Patrik Haslum

Computing Genome Edit Distances using Domain-Independent Planning

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › peer-review

Abstract

The use of planning for computing genome edit distances was suggested by Erdem and Tillier in 2005, but to date there has been no study of how well domain-independent planners are able to solve this problem. This paper reports on experiments with several PDDL formulations of the problem, using several state-of-the-art planners. The main observations are, first, that the problem formulation that is easiest for planners to deal with is not the obvious one, and, second, that plan quality ï¿½ in particular consistent and assured plan quality ï¿½ remains the biggest challenge.

Original language	English
Title of host publication	International Conference on Automated Planning and Scheduling 2011 proceedings
Editors	Alan Fern
Place of Publication	Germany
Publisher	AAAI Press
Pages	7
Edition	Peer Reviewed
ISBN (Print)	9781577355038
Publication status	Published - 2011
Event	International Conference on Automated Planning and Scheduling (ICAPS 2011) - Freiburg Germany Duration: 1 Jan 2012 → …

Conference

Conference	International Conference on Automated Planning and Scheduling (ICAPS 2011)
Period	1/01/12 → …
Other	June 11-16 2011

Cite this

@inproceedings{1ea69574b4924b56a13fb5044c9325d0,

title = "Computing Genome Edit Distances using Domain-Independent Planning",

abstract = "The use of planning for computing genome edit distances was suggested by Erdem and Tillier in 2005, but to date there has been no study of how well domain-independent planners are able to solve this problem. This paper reports on experiments with several PDDL formulations of the problem, using several state-of-the-art planners. The main observations are, first, that the problem formulation that is easiest for planners to deal with is not the obvious one, and, second, that plan quality {\"i}¿½ in particular consistent and assured plan quality {\"i}¿½ remains the biggest challenge.",

author = "Patrik Haslum",

year = "2011",

language = "English",

isbn = "9781577355038",

pages = "7",

editor = "\{Alan Fern\}",

booktitle = "International Conference on Automated Planning and Scheduling 2011 proceedings",

publisher = "AAAI Press",

edition = "Peer Reviewed",

note = "International Conference on Automated Planning and Scheduling (ICAPS 2011) ; Conference date: 01-01-2012",

}

TY - GEN

T1 - Computing Genome Edit Distances using Domain-Independent Planning

AU - Haslum, Patrik

PY - 2011

Y1 - 2011

N2 - The use of planning for computing genome edit distances was suggested by Erdem and Tillier in 2005, but to date there has been no study of how well domain-independent planners are able to solve this problem. This paper reports on experiments with several PDDL formulations of the problem, using several state-of-the-art planners. The main observations are, first, that the problem formulation that is easiest for planners to deal with is not the obvious one, and, second, that plan quality ï¿½ in particular consistent and assured plan quality ï¿½ remains the biggest challenge.

AB - The use of planning for computing genome edit distances was suggested by Erdem and Tillier in 2005, but to date there has been no study of how well domain-independent planners are able to solve this problem. This paper reports on experiments with several PDDL formulations of the problem, using several state-of-the-art planners. The main observations are, first, that the problem formulation that is easiest for planners to deal with is not the obvious one, and, second, that plan quality ï¿½ in particular consistent and assured plan quality ï¿½ remains the biggest challenge.

M3 - Conference Paper

SN - 9781577355038

SP - 7

BT - International Conference on Automated Planning and Scheduling 2011 proceedings

A2 - null, Alan Fern

PB - AAAI Press

CY - Germany

T2 - International Conference on Automated Planning and Scheduling (ICAPS 2011)

Y2 - 1 January 2012

ER -

Computing Genome Edit Distances using Domain-Independent Planning

Abstract

Conference

Fingerprint

Cite this