An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree

DOI10.1016/S0020-0190(97)00109-9zbMath1337.92155OpenAlexW2023428264MaRDI QIDQ290256

F. Blanchet-Sadri, M. Dambrine

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00109-9

zbMATH Keywords

algorithmscomputational biologyevolutionary tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

An efficient algorithm for the length-constrained heaviest path problem on a tree ⋮ Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees

Cites Work

• Unnamed Item
• The computational complexity of inferring rooted phylogenies by parsimony
• Computational complexity of inferring phylogenies from dissimilarity matrices
• The complexity of ultrametric partitions on graphs
• A fast algorithm for constructing trees from distance matrices
• A robust model for finding optimal evolutionary tree

This page was built for publication: An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree