Consistency of the Neighbor-Net Algorithm
2007

Neighbor-Net Algorithm Consistency

publication Evidence: high

Author Information

Author(s): David Bryant, Vincent Moulton, Andreas Spillner

Primary Institution: University of Auckland

Hypothesis

Does the Neighbor-Net algorithm provide a statistically consistent method for phylogenetic analysis?

Conclusion

The Neighbor-Net algorithm is statistically consistent on circular distances, meaning it accurately represents the input distance data without introducing additional conflict.

Supporting Evidence

  • Neighbor-Net is widely used in phylogenetic analysis across various fields.
  • The algorithm produces a phylogenetic network that accurately reflects the input data.
  • Formal proofs demonstrate the algorithm's consistency under specific conditions.

Takeaway

The Neighbor-Net algorithm helps scientists understand how different species are related by creating a visual map of their evolutionary history, and it does this accurately even when the data is complicated.

Methodology

The study provides a formal proof of the statistical consistency of the Neighbor-Net algorithm when applied to circular distance functions.

Digital Object Identifier (DOI)

10.1186/1748-7188-2-8

Want to read the original?

Access the complete publication on the publisher's website

View Original Publication