Rapid neighbour-joining

Martin Simonsen; Thomas Mailund; Christian N.S. Pedersen

doi:10.1007/978-3-540-87361-7_10

Rapid neighbour-joining

Martin Simonsen^*, Thomas Mailund, Christian N.S. Pedersen

^*Corresponding author for this work

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

112 Citations (Scopus)

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.

Original language	English
Title of host publication	Algorithms in Bioinformatics - 8th International Workshop, WABI 2008, Proceedings
Number of pages	10
Publication date	28 Nov 2008
Pages	113-122
ISBN (Print)	3540873600, 9783540873600
DOIs	https://doi.org/10.1007/978-3-540-87361-7_10
Publication status	Published - 28 Nov 2008
Event	8th International Workshop on Algorithms in Bioinformatics, WABI 2008 - Karlsruhe, Germany Duration: 15 Sept 2008 → 19 Sept 2008

Conference

Conference	8th International Workshop on Algorithms in Bioinformatics, WABI 2008
Country/Territory	Germany
City	Karlsruhe
Period	15/09/2008 → 19/09/2008

Series	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5251 LNBI
ISSN	0302-9743

Access to Document

10.1007/978-3-540-87361-7_10

Cite this

@inproceedings{29f03321e84d414fb1c0ead0e771e0b6,

title = "Rapid neighbour-joining",

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.",

author = "Martin Simonsen and Thomas Mailund and Pedersen, {Christian N.S.}",

year = "2008",

month = nov,

day = "28",

doi = "10.1007/978-3-540-87361-7_10",

language = "English",

isbn = "3540873600",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "113--122",

booktitle = "Algorithms in Bioinformatics - 8th International Workshop, WABI 2008, Proceedings",

note = "8th International Workshop on Algorithms in Bioinformatics, WABI 2008 ; Conference date: 15-09-2008 Through 19-09-2008",

}

Simonsen, M, Mailund, T & Pedersen, CNS 2008, Rapid neighbour-joining. in Algorithms in Bioinformatics - 8th International Workshop, WABI 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5251 LNBI, pp. 113-122, 8th International Workshop on Algorithms in Bioinformatics, WABI 2008, Karlsruhe, Germany, 15/09/2008. https://doi.org/10.1007/978-3-540-87361-7_10

Rapid neighbour-joining. / Simonsen, Martin; Mailund, Thomas; Pedersen, Christian N.S.
Algorithms in Bioinformatics - 8th International Workshop, WABI 2008, Proceedings. 2008. p. 113-122 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 5251 LNBI).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

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 -

Rapid neighbour-joining

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this