Quartet based phylogeny reconstruction with answer set programming

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2004, Pages 612-619

  Wu, Gang ^a   Lin, Guohui ^a   You, Jia Huai ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING (ASP); MAXIMUM QUARTET CONSISTENCY (MQC); QUARTET BASED PHYLOGENY; STRUCTURAL PROPERTIES;

DATA REDUCTION; DNA; GENETIC ENGINEERING; LOGIC PROGRAMMING; MATRIX ALGEBRA; PROBLEM SOLVING;

KNOWLEDGE REPRESENTATION;

EID: 16244372380     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2004.103     Document Type: Conference Paper

References (21)

1. H. Bandelt and A. Dress. Reconstructing the shape of a tree from observed dissimilarity data. Advance in Applied Mathematics, 7:309-343, 1986.
2. A. Ben-Dor, B. Chor, D. Graur, R. Ophir, and D. Pelleg. From four-taxon trees to phylogenies: the case of mammalian evolution. In Proceedings of the RECOMB, pages 9-19, 1998.
3. V. Berry, T. Jiang, P. E. Kearney, M. Li, and H. T. Wareham. Quartet cleaning: Improved algorithms and simulations. In Proceedings of the 7th Annual European Symposium on Algorithms (ESA 99), pages 313-324, 1999.
4. D. Bryant, V. Berry, P. Kearney, M. Li, T. Jiang, T. Wareham, and H. Zhang. A practical algorithm for recovering the best supported edges of an evolutionary tree. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 287-296, 2000.
5. M. C. H. Dekker. Reconstruction methods for derivation trees. Master's thesis, Vrije University, Amsterdam, 1986.
6. P. Erdos, M. Steel, L. Szekely, and T. Warnow. Inferring big trees from short sequences. In Proceedings of the International Congress on Automata, Languages, and Programming, pages 827-837, 1997.
7. P. Erdos, M. Steel, L. Szekely, and T. Warnow. A few logs suffice to build (almost) all trees (Part 1). Random Structures and Algorithms, 14:153-184, 1999.
8. J. Felsenstein. PHYLIP. accessible through http://evolution.genetics.washington.edu/phylip.html.
9. J. Felsenstein. The number of evolutionary trees. Systematic Zoology, 27:27-33, 1978.
10. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge, New York, 1997.
11. B. Hao and J. Qi. Prokaryote phylogeny without sequence alignment: from avoidance signature to composition distance. In Proceedings of the 2003 IEEE Bioinformatics Conference (CSB 2003), pages 375-385, 2003.
12. T. Jiang, P. E. Kearney, and M. Li. Orchestrating quartets: approximation and data correction. In Proceedings of the 39th FOCS, pages 416-425, 1998.
13. T. Jiang, P. E. Kearney, and M. Li. Some open problems in computational molecular biology. Journal of Algorithms, 34:194-201, 2000.
14. NCBI. NCBI Taxonomy Browser. Accessible through http://www.ncbi.nlm.nih.gov/Taxonomy.
15. D. Pelleg. Algorithms for constructing phylogenies from quartets. Master's thesis, Israel Institute of Technology, 1998.
16. S. Sattath and A. Tversky. Additive similarity trees. Psychometrika, 42:319-345, 1977.
17. P. Simons. Smodels: an implementation of the stable model semantics for logic programs, accessible through http://www.tcs.hut.fi/Software/smodels/.
18. M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal on Classification, 9:91-116, 1992.
19. K. Strimmer and A. von Haeseler. Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Molecular Biology and Evolution, 13:964-969, 1996.
20. B. M. Trust. Bergey's Manual of Systematic Bacteriology, volume 1. Springer-Verlag, New York, 2001.
21. X. Wu, X. Wan, G. Wu, D. Xu, and G.-H. Lin. Whole genome phylogeny construction via complete composition vectors, 2004. In preparation.