Fast neighbor joining

Theoretical Computer Science

Volumn 410, Issue 21-23, 2009, Pages 1993-2000

  Elias, Isaac ^a   Lagergren, Jens ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Fast neighbor joining; Nearly additive; Neighbor joining; Pairwise string distance; Phylogeny

Indexed keywords

FAST NEIGHBOR JOINING; NEARLY ADDITIVE; NEIGHBOR JOINING; PAIRWISE STRING DISTANCE; PHYLOGENY;

BIOLOGY; OPTIMIZATION; RESTORATION;

JOINING;

EID: 64249108632     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.12.040     Document Type: Article

References (20)

1. Agarwala R., Bafna V., Farach M., Paterson M., and Thorup M. On the approximability of numerical taxonomy (fitting distances by tree metrics). SICOMP 28 3 (1999) 1073-1085
2. Atteson K. The performance of neighbor-joining methods of phylogenetic reconstruction. Algorithmica 25 (1999)
3. G.S. Brodal, R. Fagerberg, T. Mailund, C.N. Pedersen, D. Phillips, Speeding up neighbour-joining tree construction, Technical Report ALCOMFT-TR-03-102, 2003
4. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, in: STOC'87, 1987, pp. 1-6
5. M. Csu{double acute}rös, Fast recovery of evolutionary trees with thousands of nodes, in: RECOMB-01, pp. 104-113, 2001
6. Desper R., and Gascuel O. Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle. Journal of Computational Biology 19 5 (2002) 687-705
7. Elias I., and Lagergren J. Fast computation of distance estimators. BMC Bioinformatics 8 (2007) 89
8. Elias I., and Lagergren J. Fast neighbor joining. Proc. of the 32nd International Colloquium on Automata, Languages and Programming. ICALP'05. Lecture Notes in Computer Science vol. 3580 (July 2005), Springer-Verlag 1263-1274
9. Erdös P.L., Steel M.A., Szekely L.A., and Warnow T.J. A few logs suffice to build (almost) all trees (I). Random Structures & Algorithms 14 (1999) 153-184
10. Gascuel O. Concerning the NJ algorithm and its unweighted version. UNJ (1997), American Mathematical Society 149-170
11. Huson D.H., Nettles S., and Warnow T. Disk-covering, a fast-converging method for phylogenetic tree reconstruction. Journal of Computational Biology 6 3/4 (1999) 369-386
12. Jukes T.H., and Cantor C.R. Evolution of protein molecules. Mammalian Protein Metabolism (1969) 21-132
13. Kimura M. A simple model for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. Journal of Molecular Evolution 16 (1980) 111-120
14. Lagergren J. Combining polynomial running time and fast convergence for the disk-covering method. Journal of Computer and System Sciences 65 (2002)
15. R. Mihaescu, D. Levy, L. Pachter, Why neighbor-joining works, Journal Algorithmica (2006), doi: 10.1007/s00453-007-9116-4. Published online http://www.springerlink.com/content/w3206717365g8m01/
16. Nakhleh L., Moret B.M.E., St John K., Sun J., Roshan U., and Warnow T. The accuracy of fast phylogenetic methods for large datasets. PSB-02 (2002) 211-222
17. Rambaut A., and Grassly N.C. Seq-gen: An application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees. Computer Applications in Biosciences 13 (1997) 235-238
18. Saitou N., and Nei M. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4 (1987) 406-425
19. M. Sanderson, r8s software package. http://ginger.ucdavis.edu/r8s/
20. Pedersen CN., and Mailund T. Quickjoin-fast neighbour-joining tree reconstruction. Bioinformatics (2004)