Recrafting the neighbor-joining method
<p>Abstract</p> <p>Background</p> <p>The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical Θ(<it>n</it><sup>3</sup>) algorithm upon which...
Main Authors: | Pedersen Christian NS, Fagerberg Rolf, Brodal Gerth S, Mailund Thomas, Phillips Derek |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2006-01-01
|
Series: | BMC Bioinformatics |
Online Access: | http://www.biomedcentral.com/1471-2105/7/29 |
Similar Items
-
Recrafting in/formality, leveraging public market trade in Baguio, Philippines
by: B. Lynne Milgram
Published: (2017-12-01) -
Algorithms for Computing the Triplet and Quartet Distances for Binary and General Trees
by: Thomas Mailund, et al.
Published: (2013-09-01) -
Live neighbor-joining
by: Guilherme P. Telles, et al.
Published: (2018-05-01) -
On the optimality of the neighbor-joining algorithm
by: Pachter Lior, et al.
Published: (2008-04-01) -
Divide-and-conquer neighbor-joining algorithm: O(N³) neighbor-joining on additive distance matrices.
Published: (2008)