Article

Free access

Constructing evolutionary trees in the presence of polymorphic characters

Authors:

Maria Bonet,

Cynthia Phillips,

Tandy J. Warnow,

Shibu YoosephAuthors Info & Claims

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

Pages 220 - 229

https://doi.org/10.1145/237814.237867

Published: 01 July 1996 Publication History

PDF eReader

References

[1]

R. AGARWALA AND D. FERN/{NDEZ-BACA, A Polynomial-time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed, SIAM J. on Computing, Vol. 23, No. 6, pp. 1216-1224.

Digital Library

Google Scholar

[2]

R. AGARWALA AND D. FEI~N~.NDEZ-BACA, Fast and Simple Algorithms for Perfect Phylogeny 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.

Google Scholar

[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.

Digital Library

Google Scholar

[4]

H. BODLAENDER, M. FELLOWS, AND T. WARNOW, Two strikes against perfect phylogeny, In Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, Springer Verlag, Lecture Notes in Computer Science (1992), pp. 273-283.

Crossref

Google Scholar

[5]

H. BODLAENDER AND T. KLOKS, A simple linear time algorithm/or triangulating three-colored graphs, In Proceedings of the 9th Annum Symposium on Theoretical Aspects of Computer Science (1992), pp. 415-423. To appear, Journal of Algorithms.

Digital Library

Google Scholar

[6]

P. BUNEMAN, A characterization of rigid circuit graphs, Discrete Math 9 (1974), pp. 205-212.

Digital Library

Google Scholar

[7]

L. LUCA CAVALLI-SFORZA, P. MENOZZI AND A. PI- AZZA, The History and Geography o/Human Genes, Princeton University Press, 1994.

Google Scholar

[8]

W. H. E. DAY, Computationally difficult parsimony problems in phylogenetic systematics, Journal of Theoretical Biology, 103: 429-438, 1983.

Crossref

Google Scholar

[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.

Google Scholar

[10]

W. tI. E. DAY AND D. SANKOFF, Computational complexity of inferring phylogenies by compatibility, Syst. Zool., Vol. 35, No. 2 (1986), pp. 224-229.

Crossref

Google Scholar

[11]

A. DRESS AND M. STEEL, Convex tree realizations of partitions, Appl. Math. Letters, Vol. 5, No. 3 (1992), pp. 3-6.

Crossref

Google Scholar

[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.

Crossref

Google Scholar

[13]

G. F. ESTABROOK, C. S. JOHNSON JR., AND F. R. MCMORRIS, An idealized concept o/ the true cladis. tic character, Mathematical Biosciences, 23 (1975), pp. 263-272.

Crossref

Google Scholar

[14]

J. FELSENSTEIN, Alternative methods o/phylogenetic inference and their interrelationships, Systematic Zoology, 28: 49-62, 1979.

Crossref

Google Scholar

[15]

W. FITCH, Towards defining the course of evolution: minimum change for a specified tree topology, Syst. Zool., 20:406-416 (1971).

Crossref

Google Scholar

[16]

M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, 1980 Academic Press Inc.

Google Scholar

[17]

D. GvsrmLv, Efficient algorithms for inferring evolutionary trees, Networks, 21 (1991), pp. 19-28.

Crossref

Google Scholar

[18]

R. IDURY AND A. SCHAFrER, Triangulating threecolored graphs in linear time and linear space, to appear, SIAM J. Discrete Mathematics.

Digital Library

Google Scholar

[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.

Crossref

Google Scholar

[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.

Digital Library

Google Scholar

[21]

S. KANNAN AND T. WARNOW, Triangulating threecolored graphs, SIAM J. on Disc. Math., 5 (1992), pp. 249-258; a preliminary version of this appeared in Froc. 2rid Annual ACM/SIAM Symposium on Discrete Algorithms.

Digital Library

Google Scholar

[22]

S. KANNAN AND T. WARNOW, A fast algorithm for finding and enumerating perfect phylogenies, Proc. 6th Annum ACM/SIAM Symposium on Discrete Algorithms, 1995, San Francisco.

Digital Library

Google Scholar

[23]

W. J. LE QUESNE, A method o/selection of characters in numerical taxonomy, Syst. Zool., 18 (1969), pp. 201- 205.

Crossref

Google Scholar

[24]

W. J. LE QUESNE, Further studies based on the uniquely derived character concept, Syst. Zool., 21 (1972), pp. 281-288.

Crossref

Google Scholar

[25]

F. R. McMoRRm, T. WARNOW, AND T. WmER, Triangulating vertex colored graphs, SIAM .I. on Discrete Mathematics, Vol. 7. No. 2, (1994), pp. 2'96-306.

Digital Library

Google Scholar

[26]

M. N EI, Molecular Evolutionary Genetics, Columbia University Press, New York. 1987.

Google Scholar

[27]

A. PROSKUROWSKI, Separating subgraphs in k-trees: cables and caterpillars, Discrete Math., 49 (1984), pp. 275-285.

Digital Library

Google Scholar

[28]

D. RINar., personal communication, 1995.

Google Scholar

[29]

D.J. Ross, On simple characterization o/k-trees, Discrete Math., 7 (1974), pp. 317-322.

Digital Library

Google Scholar

[30]

D.J. Ross, R.E. TARJAN, AND G.S. LUEKER, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., Vol. 5, No. 2, June 1976.

Google Scholar

[31]

A.K. ROYCUOUDnUR7 AND M. NEI, Human Polymorphic Genes: World Distribution, 1988, Oxford University Press.

Google Scholar

[32]

D. SANKOFr 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.

Google Scholar

[33]

D. SANKOFF AND P. ROUSSEAU, 1975, Locating the vertices of a Steiner tree in arbitrary space, Mathematical Programming, 9:240-246.

Google Scholar

[34]

M. A. STEEL, The complexity of reconstructing trees from qualitative characters and subtrees, Journal of Classification, 9 (1992), pp. 91-116.

Crossref

Google Scholar

[35]

T. WARNOW, Constructing phylogenetic trees efficiently using compatibility criteria, New Zealand Journal of Botany, 1993, Vol. 31: 239-248.

Crossref

Google Scholar

[36]

T. WARNOW, D. RINGS AND A. TAYLOR, A character based method/or reconstructing evolutionary history/or natural languages, Tech Report, Institute for Research in Cognitive Science, 1995, and Proceedings 1996 A CM/SIAM Symposium on Discrete Algorithms.

Digital Library

Google Scholar

Cited By

View all

Fomin FVillanger Y(2012)Subexponential parameterized algorithm for minimum fill-inProceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms10.5555/2095116.2095254(1737-1746)Online publication date: 17-Jan-2012
https://dl.acm.org/doi/10.5555/2095116.2095254
Cryan MGoldberg LPhillips C(2005)Approximation algorithms for the fixed-topology phylogenetic number problemCombinatorial Pattern Matching10.1007/3-540-63220-4_56(130-149)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-63220-4_56
Bonet MSteel MWarnow TYooseph S(1998)Better methods for solving parsimony and compatibilityProceedings of the second annual international conference on Computational molecular biology10.1145/279069.279081(40-49)Online publication date: 1-Mar-1998
https://dl.acm.org/doi/10.1145/279069.279081

Index Terms

Constructing evolutionary trees in the presence of polymorphic characters
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes

Recommendations

Constructing Evolutionary Trees in the Presence of Polymorphic Characters

Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states per character per species) is well documented in both biology and historical ...
Parallel Branch-and-Bound Algorithm for Constructing Evolutionary Trees from Distance Matrix
HPCASIA '05: Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region

An ultrametric tree is an evolutionary tree in which the distances from the root to all leaves in the tree are equal. The Minimum Ultrametric Tree construction problem is the problem of constructing an ultrametric tree from distance matrices with ...
On the Approximation of Computing Evolutionary Trees
Proceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 3595

Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the largest number of leaves. MAST and its variant called MCT are of particular ...

Comments

Information & Contributors

Information

Published In

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

July 1996

661 pages

ISBN:0897917855

DOI:10.1145/237814

Chairman:
Gary L. Miller

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC96

Sponsor:

SIGACT

STOC96: ACM Symposium on Theory of Computing

May 22 - 24, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

STOC '96 Paper Acceptance Rate 74 of 201 submissions, 37%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
393
Total Downloads

Downloads (Last 12 months)40
Downloads (Last 6 weeks)6

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fomin FVillanger Y(2012)Subexponential parameterized algorithm for minimum fill-inProceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms10.5555/2095116.2095254(1737-1746)Online publication date: 17-Jan-2012
https://dl.acm.org/doi/10.5555/2095116.2095254
Cryan MGoldberg LPhillips C(2005)Approximation algorithms for the fixed-topology phylogenetic number problemCombinatorial Pattern Matching10.1007/3-540-63220-4_56(130-149)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-63220-4_56
Bonet MSteel MWarnow TYooseph S(1998)Better methods for solving parsimony and compatibilityProceedings of the second annual international conference on Computational molecular biology10.1145/279069.279081(40-49)Online publication date: 1-Mar-1998
https://dl.acm.org/doi/10.1145/279069.279081

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations