RBT - A tool for building refined Buneman trees

Bioinformatics

Volumn 21, Issue 8, 2005, Pages 1711-1712

  Besenbacher, Søren ^a   Mailund, Thomas ^a   Westh Nielson, Lasse ^a   Pedersen, Christian N S ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; DEVICE; NEIGHBOR JOINING METHOD; PHYLOGENETIC TREE; PHYLOGENETIC TREE CONSTRUCTION METHOD; PRIORITY JOURNAL; TAXON;

EID: 17444362300     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bti195     Document Type: Article

References (9)

1. Berry,V. and Bryant,D. (1999) Faster reliable phylogenetic analysis. In Proceedings of the RECOMB 1999, Lyon, France, pp. 59-68.
2. Brodal,G.S., Fagerberg,R., Östlin,A., Pedersen,C.N.S. and Rao,S.S. (2003) Computing refined buneman trees in cubic time. In Proceedings of the WABI 2003, Budapest, Hungary LNCS 2812, pp. 259-270.
3. Bryant,D. and Moulton,V. (1999) A polynomial algorithm for constructing the refined Buneman tree. Appl. Math. Lett., 12, 51-56.
4. Buneman,P. (1971) The recovery of trees from measures of dissimilarity. In: Kendall,D. and Tautu,P. (eds) Mathematics in Archaeological and Historical Sciences, Edinburg University Press, Edinburg, pp. 387-395.
5. Moulton,V. and Steel,M. (1999) Retractions of finite distance functions onto tree metrics. Discrete Appl. Math., 91, 215-233.
6. Nei,N. and Kumar,S. (2000) Molecular Evolution and Phylogenetics. Oxford University Press, Oxford.
7. Saitou,N. and Nei,M. (1987) The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol., 4, 406-425.
8. St John,K., Warnow,T., Moret,B. and Vawter,L. (2003) Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. J. Algorithms, 48, 173-193.
9. Studier,J.A. and Keppler,K.J. (1988) A note on the neighbor-joining method of Saitou and Nei. Mol. Biol. Evol., 5 729-731.