Abstract
The neighbour-joining method reconstructs phylogenies by iteratively joining pairs of nodes until a single node remains. The criterion for which pair of nodes to merge is based on both the distance between the pair and the average distance to the rest of the nodes. In this paper, we present a new search strategy for the optimisation criteria used for selecting the next pair to merge and we show empirically that the new search strategy is superior to other state-of-the-art neighbour-joining implementations.
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
Elias, I., Lagergren, J.: Fast neighbour joining. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1263–1274. Springer, Heidelberg (2005)
Elias, I., Lagergren, J.: Fast computation of distance estimators. BMC Bioinformatics 8, 89 (2007)
Evans, J., Sheneman, L., Foster, J.A.: Relaxed neighbor joining: A fast distance-based phylogenetic tree construction method. Journal of Molecular Evolution 62(6), 785–792 (2006)
Finn, R.D., Mistry, J., Schuster-Böckler, B., Griffiths-Jones, S., Hollich, V., Lassmann, T., Moxon, S., Marshall, M., Khanna, A., Durbin, R., Eddy, S.R., Sonnhammer, E.L.L., Bateman, A.: Pfam: Clans, web tools and services. Nucleic Acids Research, Database Issue 34, D247–D251 (2006)
Howe, K., Bateman, A., Durbin, R.: QuickTree: Building huge neighbour-joining trees of protein sequences. Bioinformatics 18(11), 1546–1547 (2002)
Mailund, T., Brodal, G.S., Fagerberg, R., Pedersen, C.N.S., Philips, D.: Recrafting the neighbor-joining method. BMC Bioinformatics 7(29) (2006)
Mailund, T., Pedersen, C.N.S.: QuickJoin – fast neighbour-joining tree reconstruction. Bioinformatics 20, 3261–3262 (2004)
Saitou, N., Nei, M.: The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4, 406–425 (1987)
Sanderson, M.L.: Inferring absolute rates of molecular evolution and divergence times in the absence of molecular clock. Bioinformatics 19, 301–302 (2003)
Sheneman, L., Evans, J., Foster, J.A.: Clearcut: A fast implementation of relaxed neighbor-joining. Bioinformatics 22(22), 2823–2824 (2006)
Studier, J.A., Kepler, K.J.: A note on the neighbour-joining method of Saitou and Nei. Molecular Biology and Evolution 5, 729–731 (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simonsen, M., Mailund, T., Pedersen, C.N.S. (2008). Rapid Neighbour-Joining. In: Crandall, K.A., Lagergren, J. (eds) Algorithms in Bioinformatics. WABI 2008. Lecture Notes in Computer Science(), vol 5251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87361-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-87361-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87360-0
Online ISBN: 978-3-540-87361-7
eBook Packages: Computer ScienceComputer Science (R0)