A fast neighbor joining method.
With the rapid development of sequencing technologies, an increasing number of sequences are available for evolutionary tree reconstruction. Although neighbor joining is regarded as the most popular and fastest evolutionary tree reconstruction method [its time complexity is O(n(3)), where n is the number of sequences], it is not sufficiently fast to infer evolutionary trees containing more than a few hundred sequences. To increase the speed of neighbor joining, we herein propose FastNJ, a fast implementation of neighbor joining, which was motivated by RNJ and FastJoin, two improved versions of conventional neighbor joining. The main difference between FastNJ and conventional neighbor joining is that, in the former, many pairs of nodes selected by the rule used in RNJ are joined in each iteration. In theory, the time complexity of FastNJ can reach O(n(2)) in the best cases. Experimental results show that FastNJ yields a significant increase in speed compared to RNJ and conventional neighbor joining with a minimal loss of accuracy.
School of Computer Science and Technology, Civil Aviation University of China, Tianjin, China jfli@cauc.edu.cn.
J F
JF
Li
D000465:Algorithms; D019143:Evolution, Molecular; D008957:Models, Genetic; D010802:Phylogeny; D017422:Sequence Analysis, DNA; D012984:Software