Genome rearrangement and planning

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2005, Pages 1139-1144

  Erdem, Esra ^a   Tillier, Elisabeth ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b PRINCESS MARGARET HOSPITAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CELLS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; PROBLEM SOLVING;

GENOME REARRANGEMENT; MITOCHONDRIAL GENOMES; PHYLOGENIES;

GENES;

EID: 29344454136     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Bacchus, F., and Kabanza, F. 2000. Using temporal logic to express search control knowledge for planning. Artificial Intelligence 116(1-2):123-191.
2. Bafna, V, and Pevzner, P. 1998. Sorting by transpositions. SIAM Journal of Discrete Mathematics 11:224-240.
3. Baral, C.; Kreinovich, V.; and Trejo, R. 2001. Computational complexity of planning with temporal goals. In Proc. of IJCAI, 509-514.
4. Blanchette, M.; Kunisawa, T.; and Sankoff, D. 1996. Parametric genome rearrangement. Gene-Combis 172:11-17.
5. Blanchette, M.; Kunisawa, T.; and Sankoff, D. 1999. Gene order breakpoint evidence in animal mitochondrial phylogeny. Journal of Molecular Evolution 49:193-203.
6. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2).
7. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69(161-204).
8. Cosner, M.; Jansen, R.; Moret, B.; Raubeson, L.; Wang, L.; Warnow, T.; and Wyman, S. 2000. An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae. In Sankoff, D., and Nadeau, J., eds., Comparative Genomics. Kluwer Acad. Pub. 99-122.
9. Erol, K.; Nau, D. S.; and Subrahmanian, V. S. 1995. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence 76:75-88.
10. Felsenstein, J. 2004. PHYLIP (phytogeny inference package) version 3.6. Distributed by the author.
11. Hannenhalli, S., and Pevzner, P. 1995. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations with reversals). In Proc. of STOC, 178-189.
12. Kautz, H., and Selman, B. 1992. Planning as satisfiability. In Proc. of ECAI, 359-363.
13. Lifschitz, V. 1999. Action languages, answer sets and planning. In The Logic Programming Paradigm: a 25-Year Perspective. Springer Verlag. 357-373.
14. Metazoa Systematics Page, The University of California Museum of Paleontology (http://www.ucmp.berkeley.edu/help/index/metazoa.html).
15. Moret, B.; Wyman, S.; D.Bader; Warnow, T.; and Yan, M. 2001. A new implementation and detailed study of break-point analysis. In Proc. of PSB, 583-594.
16. Pednault, E. 1989. ADL: Exploring the middle ground between STRIPS and the situation calculus. In Proc. of KR, 324-332.
17. Sankoff, D., and Blanchette, M. 1998. Multiple genome rearrangement and breakpoint phylogeny. Journal of Computational Biology 5:555-570.