Abstract
Reconstructing the evolutionary history of a set of species is a fundamental problem in biology and methods for solving this problem are gaged based on two characteristics: accuracy and efficiency. Neighbor Joining (NJ) is a so-called distance-based method that, thanks to its good accuracy and speed, has been embraced by the phylogeny community. It takes the distances between n taxa and produces in Θ(n 3) time a phylogenetic tree, i.e., a tree which aims to describe the evolutionary history of the taxa. In addition to performing well in practice, the NJ algorithm has optimal reconstruction radius.
The contribution of this paper is twofold: (1) we present an algorithm called Fast Neighbor Joining (FNJ) with optimal reconstruction radius and optimal run time complexity O(n 2) and (2) we present a greatly simplified proof for the correctness of NJ. Initial experiments show that FNJ in practice has almost the same accuracy as NJ, indicating that the property of optimal reconstruction radius has great importance to their good performance. Moreover, we show how improved running time can be achieved for computing the so-called correction formulas.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwala, R., Bafna, V., Farach, M., Paterson, M., Thorup, M.: On the approximability of numerical taxonomy (fitting distances by tree metrics). SICOMP 28(3), 1073–1085 (1999)
Atteson, K.: The performance of neighbor-joining methods of phylogenetic reconstruction. Algorithmica 25 (1999)
Brodal, G.S., Fagerberg, R., Mailund, T., Pedersen, C.N., Phillips, D.: Speeding up neighbour-joining tree construction. Technical Report ALCOMFT-TR-03-102 (2003)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: STOC 1987, pp. 1–6 (1987)
Csűrös, M.: Fast recovery of evolutionary trees with thousands of nodes. In: RECOMB 2001, pp. 104–113 (2001)
Desper, R., Gascuel, O.: Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle. Journal of Computational Biology 19(5), 687–705 (2002)
Erdös, P.L., Steel, M.A., Szekely, L.A., Warnow, T.J.: A few logs suffice to build (almost) all trees (I). RSA: Random Structures & Algorithms 14, 153–184 (1999)
Gascuel, O.: Concerning the NJ algorithm and its unweighted version, UNJ, pp. 149–170. American Mathematical Society (1997)
Huson, D.H., Nettles, S., Warnow, T.: Disk-covering, a fast-converging method for phylogenetic tree reconstruction. Journal of Computational Biology 6(3/4), 369–386 (1999)
Jukes, T.H., Cantor, C.R.: Evolution of protein molecules. Mammalian Protein Metabolism, 21–132 (1969)
Kimura, M.: A simple model for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. Journal of Molecular Evolution 16, 111–120 (1980)
Lagergren, J.: Combining polynomial running time and fast convergence for the disk-covering method. JCSS: Journal of Computer and System Sciences 65 (2002)
Nakhleh, L., Moret, B.M.E., St John, K., Sun, J., Roshan, U., Warnow, T.: The accuracy of fast phylogenetic methods for large datasets. In: PSB 2002, pp. 211–222 (2002)
Rambaut, A., Grassly, N.C.: Seq-gen: An application for the monte carlo simulation of dna sequence evolution along phylogenetic trees. Comp. Appl. Biosci. 13, 235–238 (1997)
Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4, 406–425 (1987)
Sanderson, M.: r8s software package, http://ginger.ucdavis.edu/r8s/
Pedersen, C.N., Mailund, T.: Quickjoin–fast neighbour-joining tree reconstruction. Bioinformatics (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elias, I., Lagergren, J. (2005). Fast Neighbor Joining. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_102
Download citation
DOI: https://doi.org/10.1007/11523468_102
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)