Computing refined Buneman trees in cubic time

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

Volumn 2812, Issue , 2003, Pages 259-270

  Brodal, Gerth Stølting ^a   Fagerberg, Rolf ^a   Östlin, Anna ^b   Pedersen, Christian N S ^c   Rao, S Srinivasa ^d  

^a AALBORG UNIVERSITY   (Denmark)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

^c AARHUS UNIVERSITY   (Denmark)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; BIOINFORMATICS; COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; JOINING;

DISTANCE MEASURE; DISTANCE-BASED METHODS; EVOLUTIONARY TREE; MISSING EVIDENCES; NEIGHBOR JOINING; PAIRWISE DISTANCES; SPACE CONSUMPTION; TREE RECONSTRUCTION;

TREES (MATHEMATICS);

EID: 30744468369     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39763-2_20     Document Type: Article

References (15)

1. H.-J. Bandelt and A. W. Dress. Reconstructing the shape of a tree from observed dissimilarity data. Advances in Applied Mathematics, 7:309-343, 1986.
2. J.-P. Barthélémy and A. Guénoche. Trees and Proximity Representations. John Wiley & Sons, 1991.
3. V. Berry and D. Bryant. Faster reliable phylogenetic analysis. In Proc. 3rd International Conference on Computational Molecular Biology (RECOMB), pages 69-69, 1999.
4. V. Berry and O. Gascuel. Inferring evolutionary trees with strong combinatorial evidence. Theoretical Computer Science, 240:271-298, 2000.
5. D. Bryant and V. Berry. A structured family of clustering and tree construction methods. Advances in Applied Mathematics, 27(4):705-732, 2001.
6. D. Bryant and V. Moulton. A polynomial time algorithm for constructing the refined buneman tree. Applied Mathematics Letters, 12:51-56, 1999.
7. P. Buneman. The recovery of trees from measures of dissimilarity. In F. Hodson, D. Kendall, and P. Tautu, editors, Mathematics in Archaeological and Historical Sciences, pages 387-395. Edinburgh University Press, 1971.
8. J. C. Gower and J. G. S. Ross. Minimum spanning trees and single-linkage cluster analysis. Applied Statistics, 18:54-64, 1969.
9. D. Gusfield. Efficient algorithms for inferring evolutionary trees. Networks, 21:19-28, 1991.
10. D. Huson. Splitstree: a program for analyzing and visualizing evolutionary data. Bioinformatics, 14(1):68-73, 1998. (http://www-ab.informatik.uni-tuebingen.de/software/splits/welcome_en.html).
11. B. Leclerc. Description combinatoire des altramétriqueès. Math. Sci. Hum., 73:5-37, 1981.
12. V. Moulton and M. Steel. Retractions of finite distance functions onto tree metrics. Discrete Applied Mathematics, 91:215-233, 1999.
13. M. Nei and S. Kumar. Molecular Evolution and Phylogenetics. Oxford University Press, 2000.
14. N. Saitou and M. Nei. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology Evolution, 4:406-425, 1987.
15. A. Schönhage, M. S. Paterson, and N. Pippenger. Finding the median. Journal of Computer and System Sciences, 13:184-199, 1976.