Constructing evolutionary trees in the presence of polymorphic characters

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 220-229

  Bonet, Maria ^a   Phillips, Cynthia ^b   Warnow, Tandy J ^c   Yooseph, Shibu ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; LINGUISTICS; CODES (SYMBOLS); DATA REDUCTION; DATA STRUCTURES; FORMAL LANGUAGES; GRAPH THEORY;

CONSTRUCTION METHOD; EVOLUTIONARY TREE; MULTIPLE STATE; NATIONAL ACADEMY OF SCIENCE; PERFECT PHYLOGENY; PHYLOGENETICS;

COMPUTATION THEORY; ALGORITHMS;

EVOLUTIONARY TREES; PHYLOGENY; POLYMORPHIC CHARACTERS;

EID: 0029719647     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237867     Document Type: Conference Paper

References (37)

1. R. AGARWALA AND D. FERNÁNDEZ-BACA, A Polynomial-time Algorithm for the Perfect Phytogeny Problem when the Number of Character States is Fixed, SIAM J. on Computing, Vol. 23, No. 6, pp. 1216-1224.
2. R. AGARWALA AND D. FERNÁNDEZ-BACA, Fast and Simple Algorithms for Perfect Phytogeny and Triangulating Colored Graphs. To appear in the special issue on Algorithmic Aspects of Computational Biology of International Journal of Foundations of Computer Science. Available as DIMACS technical report TR94-51.
3. S. ARNBORG, D. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embeddings in a k-Tree, SIAM J. of Algebraic and Discrete Methods, Vol. 8, No. 2, April 1987, pp. 277-284.
4. H. BODLAENDER, M. FELLOWS, AND T. WARNOW, Two strikes against perfect phytogeny, In Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, Springer Verlag, Lecture Notes in Computer Science (1992), pp. 273-283.
5. H. BODLAENDER AND T. KLOKS, A simple linear time algorithm for triangulating three-colored graphs, In Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science (1992), pp. 415-423. To appear, Journal of Algorithms.
6. P. BUNEMAN, A characterization of rigid circuit graphs, Discrete Math 9(1974), pp. 205-212.
7. L. LUCA CAVALLI-SFORZA, P. MENOZZI AND A. PIAZZA, The History and Geography of Human Genes, Princeton University Press, 1994.
8. W. H. E. DAY, Computationally difficult parsimony problems in phylogenetic systematics, Journal of Theoretical Biology, 103:429-438, 1983.
9. W. H. E. DAY, D. S. JOHNSON, AND D. SANKOFF, The computational complexity of inferring phylogenies by parsimony, Mathematical biosciences, 81:33-42, 1986.
10. W. H. E. DAY AND D. SANKOFF, Computational complexity of inferring phylogenies by compatibility, Syst. Zool., Vol. 35, No. 2(1986), pp. 224-229.
11. A. DRESS AND M. STEEL, Convex tree realizations of partitions, Appl. Math. Letters, Vol. 5, No. 3(1992), pp. 3-6.
12. G. F. ESTABROOK, Cladistic methodology: a discussion of the theoretical basis for the induction of evolutionary history, Annu. Rev. Ecol. Syst., 3(1972), pp. 427-456.
13. G. F. ESTABROOK, C. S. JOHNSON JR., AND F. R. MCMORRIS, An idealized concept of the true cladistic character, Mathematical Biosciences, 23(1975), pp. 263-272.
14. J. FELSENSTEIN, Alternative methods of phylogenetic inference and their interrelationships, Systematic Zoology, 28:49-62, 1979.
15. W. FLTCH, Towards defining the course of evolution: minimum change for a specified tree topology, Syst. Zool., 20:406-416 (1971).
16. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, 1980 Academic Press Inc.
17. D. GUSFIELD, Efficient algorithms for inferring evolutionary trees, Networks, 21(1991), pp. 19-28.
18. R. IDURY AND A. SCHAFFER, Triangulating threecolored graphs in linear time and linear space, to appear, SIAM J. Discrete Mathematics.
19. R. KARP, Reducibility among combinatorial problems, In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, NY, 1972.
20. S. KANNAN AND T. WARNOW, Inferring evolutionary history from DNA sequences, SIAM J. on Computing, Volume 23, No. 3, (1994) pp. 713-737. A preliminary version of this paper appeared in the Proceedings of the Symposium on the Foundations of Computer Science, St. Louis, Missouri, 1990.
21. S. KANNAN AND T. WARNOW, Triangulating threecolored graphs, SIAM J. on Disc. Math., 5(1992), pp. 249-258; a prehminary version of this appeared in Proc. 2nd Annual ACM/5IAM Symposium on Discrete Algorithms.
22. S. KANNAN AND T. WARNOW, A fast algorithm for finding and enumerating perfect phylogenies, Proc. 6th Annual ACM/SIAM Symposium on Discrete Algorithms, 1995, San Francisco.
23. W. J. LE QUESNE, A method of selection of characters in numerical taxonomy, Syst. Zool., 18(1969), pp. 201-205.
24. W. J. LE QUESNE, Further studies based on the uniquely derived character concept, Syst. Zool., 21(1972), pp. 281-288.
25. F. R. MCMORRIS, T. WARNOW, AND T. WIMER, Triangulating vertex colored graphs, SIAM J. on Discrete Mathematics, Vol. 7. No. 2, (1994), pp. 296-306.
26. M. NEI, Molecular Evolutionary Genetics, Columbia University Press, New York. 1987.
27. A. PROSKUROWSKI, Separating subgraphs in k-trees: cables and caterpillars, Discrete Math., 49(1984), pp. 275-285.
28. D. RLNGE, personal communication, 1995.
29. D. J. ROSE, On simple characterization of k-trees, Discrete Math., 7(1974), pp. 317-322.
30. D. J. ROSE, R. E. TARJAN, AND G. S. LUEKER, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., Vol. 5, No. 2, June 1976.
31. A. K. ROYCHOUDHURY AND M. NEI, Human Polymorphic Genes: World Distribution, 1988, Oxford University Press.
32. D. SANKOFF AND R. J. CEDERGREN, 1983. Simultaneous comparison of three or more sequences related by a tree, pp. 253-263 in "Time Warps, String Edits, and Macromolecules: the theory and practice of sequence comparison" edited by D. Sankoff and J. B. Kruskal, Addison-Wesley, Reading MA.
33. D. SANKOFF AND P. ROUSSEAU, 1975, Locating the vertices of a Steiner tree in arbitrary space, Mathematical Programming, 9:240-246.
34. M. A. STEEL, The complexity of reconstructing trees from qualitative characters and subtrees, Journal of Classification, 9(1992), pp. 91-116.
35. T. WARNOW, Constructing phylogenetic trees efficiently using compatibility criteria, New Zealand Journal of Botany, 1993, Vol. 31:239-248.
36. T. WARNOW, D. RINGE AND A. TAYLOR, A character based method for reconstructing evolutionary history for natural languages, Tech Report, Institute for Research in Cognitive Science, 1995
37. and Proceedings 1996 ACM/SIAM Symposium on Discrete Algorithms.