Davidson, Ruth and Martín del Campo, Abraham (2020) Combinatorial and Computational Investigations of Neighbor-Joining Bias. Frontiers in Genetics, 11. ISSN 1664-8021
pubmed-zip/versions/1/package-entries/fgene-11-584785/fgene-11-584785.pdf - Published Version
Download (1MB)
Abstract
The Neighbor-Joining algorithm is a popular distance-based phylogenetic method that computes a tree metric from a dissimilarity map arising from biological data. Realizing dissimilarity maps as points in Euclidean space, the algorithm partitions the input space into polyhedral regions indexed by the combinatorial type of the trees returned. A full combinatorial description of these regions has not been found yet; different sequences of Neighbor-Joining agglomeration events can produce the same combinatorial tree, therefore associating multiple geometric regions to the same algorithmic output. We resolve this confusion by defining agglomeration orders on trees, leading to a bijection between distinct regions of the output space and weighted Motzkin paths. As a result, we give a formula for the number of polyhedral regions depending only on the number of taxa. We conclude with a computational comparison between these polyhedral regions, to unveil biases introduced in any implementation of the algorithm.
Item Type: | Article |
---|---|
Subjects: | STM Digital Press > Medical Science |
Depositing User: | Unnamed user with email support@stmdigipress.com |
Date Deposited: | 23 Jan 2023 09:18 |
Last Modified: | 22 May 2024 09:32 |
URI: | http://publications.articalerewriter.com/id/eprint/173 |