Inferring evolutionary trees with strong combinatorial evidence

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1276, Issue , 1997, Pages 111-123

  Berry, Vincent ^a   Gascuel, Olivier ^b  

^a LIRMM   (France)

^b GERAD   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; POLYNOMIAL APPROXIMATION;

CONSISTENCY PROBLEMS; CONVERGENCE RATES; EVOLUTIONARY TREE; N SPECIES; NP-HARD; POLYNOMIAL-TIME; QUARTET RECONSTRUCTION; REALISTIC CONDITIONS;

FORESTRY;

EID: 84947802748     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0045078     Document Type: Conference Paper

References (19)

1. R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson, and M. Thorup. On the approximability of numerical taxonomy: Fitting distances by tree metrics. In Proc. of the 7th ACM-SIAM SODA, 1996.
2. N. Alon and J.H. Spencer. The Probabilistic Method. John Wiley and Sons, 1992.
3. H-J. Bandelt and A. Dress. Reconstructing the shape of a tree from observed dissimilarity data. Adv. in appl. math., 7:309-343, 1986.
4. H.-J. Bandelt and A. Dress. A canonical decomposition theory for metrics on a finite set. Advances Math, 92:47-105, 1992.
5. V. Berry and O. Gascuel. On the interpretation of bootstrap trees: appropriate threshold of clade selection and induced gain. Mol. Biol. Evol., 13(7), 1996.
6. P. Buneman. Mathematics in Archeological and Itistorical Sciences, chapter The recovery of trees from measures of dissimilarity, pages 387-395. Edhinburgh University Press, 1971.
7. J. A. Cavender. Taxonomy with confidence. Math. Biosci., 40:271-280, 1978.
8. P.L. Erdös, M.A. Steel, L.A. Székely, and T.J. Warnow. Constructing big trees from short sequences. In ICALP, 1997.
9. M. Farach and S. Kannan. Efficient algorithms for inverting evolution. In Proceedings of the 7th ACM SODA, 1996.
10. J. Felsenstein. Phylogenies from molecular sequences: inference and reliability. Annu. Rev. Genet., 22:521-565, 1988.
11. W. M. Fitch. A non-sequential method for constructing trees and hierarchical classifications. J. Mol. Evol., 18:30-37, 1981.
12. O. Gascuel and D. Levy. A reduction for approximating a (non-metric) dissimilarity by a tree distance. J. of Classification, 1996.
13. D. Gusfield. Efficient algorithms for inferring evolutionnary trees. Networks, 2t:19- 28, 1991.
14. G. Lecointre, H. Philippe, H.L.V. Lê, and H. Le Guyader. Species sampling has a major impact on phylogenetic inference. Mol. Phylogenet. Evol., 2:205-224, 1993.
15. M. Nei. Relative efficiencies of different tree-making methods for molecular data. In M.M. Miyamoto and J. Cracraft, editors, Phylogenetic analysis of DNA sequences. Oxford Univ. Press, 1991.
16. D. Penny, M.D. Hendy, and M.A. Steel. Testing the theory of descent. In M. M. Miyamoto and J. Cracraft, editors, Phylogenetic analysis of DNA sequences, pages 155-183. 1991.
17. N. Saitou and M. Nei. The neighbor-joining method: A new method for reconstruction phylogenetic trees. MoL Biol. Evol., 4(4):406-425, 1987.
18. S. Sattah and A. Tversky. Additive similarity trees. Psychom., 42:319-345, 1977.
19. M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. J. of Classification, 9:91-116, 1992.