TY - GEN
T1 - Rapid neighbour-joining
AU - Simonsen, Martin
AU - Mailund, Thomas
AU - Pedersen, Christian N.S.
PY - 2008/11/28
Y1 - 2008/11/28
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=56649097248&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-87361-7_10
DO - 10.1007/978-3-540-87361-7_10
M3 - Article in proceedings
AN - SCOPUS:56649097248
SN - 3540873600
SN - 9783540873600
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 113
EP - 122
BT - Algorithms in Bioinformatics - 8th International Workshop, WABI 2008, Proceedings
T2 - 8th International Workshop on Algorithms in Bioinformatics, WABI 2008
Y2 - 15 September 2008 through 19 September 2008
ER -