Fast Neighbor Joining
2009 (English)In: Theoretical Computer Science, ISSN 0304-3975, Vol. 410, no 21-23, 1993-2000 p.Article in journal (Refereed) Published
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 Theta(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.
Place, publisher, year, edition, pages
2009. Vol. 410, no 21-23, 1993-2000 p.
Neighbor joining, Phylogeny, Nearly additive, Fast neighbor joining, Pairwise string distance
IdentifiersURN: urn:nbn:se:kth:diva-6353DOI: 10.1016/j.tcs.2008.12.040ISI: 000266178200005ScopusID: 2-s2.0-64249108632OAI: oai:DiVA.org:kth-6353DiVA: diva2:11042
QC 201009142006-11-152006-11-152010-09-14Bibliographically approved