Triangulating three-colored graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1991, Pages 337-343

  Kannan, Sampath K ^a   Warnow, Tandy J ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGY; CLUSTERING ALGORITHMS;

EVOLUTIONARY HISTORY; LINEAR-TIME ALGORITHMS; NUMERICAL TAXONOMY; PARTIAL K-TREES; PERFECT PHYLOGENY;

TREES (MATHEMATICS);

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

References (13)

1. 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.
2. P. Buneman, A Characterization of Rigid Circuit Graphs, Discrete Math 9(1974), pp. 205-212.
3. W. H. E. Day, D. S. Johnson, and David Sankoff, The Computational Complexity of Inferring Rooted Phytogenies by Parsimony, Mathematical Biosciences 81, (1986) pp. 33-42.
4. W. H. E. Day, D. Sankoff, Computational Complexity of Inferring Phylogenies by Compatibility, Syst. Zool., 35(2):224-229, 1986.
5. W. H. E. Day, D. Sankoff, Computational Complexity of Inferrng Phylogenies from Chromosome Inversion Data, J. Theoretical Biology, (1987), 124, 213-218.
6. G. F. Estabrook and F. R. McMorris, When are Two Qualitative Taxonomic Characters Compatible?, J. Math. Biol., 4: pp. 195-200.
7. L. R. Foulds, and R. L. Graham, The Steiner Problem in Phytogeny is NP-Complete, Advances in Applied Mathematics 3, (1982), pp. 43-49.
8. M. C Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
9. D. Gusfield, The Steiner Tree Problem in Phytogeny, Technical Report 332, Yale University, Department of Computer Science, Sept. 1984.
10. D. Gusfield, Efficient Algorithms for Inferring Evolutionary Trees, to appear in Networks.
11. S. Kannan and T. Warnow, Inferring Evolutionary History from DNA Sequences, to be presented at the Symposium on the Foundations of Computer Science, St. Louis, Missouri, Oct. 1990.
12. C. F. McMorris, T. Warnow, and T. Wimer, Triangulating Colored Graphs, submitted to Information Processing Letters.
13. A. Proskurowski, Separatingv Subgraphs in k-trees: Cables and Caterpillars, Discrete Math., 49(1984), pp. 275-285.