An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees

DOI10.1016/J.JDA.2004.08.013zbMath1105.68109OpenAlexW1976264393MaRDI QIDQ2569414

Olivier Gascuel, Olivier Elemento

Publication date: 27 October 2005

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.08.013

zbMATH Keywords

dynamic programmingleast-squaresexact algorithmphylogenetic treesdistance-based methodsminimum evolution principlegene familiesduplication treesevolution reconstructionstandemly repeated sequences

Mathematics Subject Classification ID

Problems related to evolution (92D15) Nonnumerical algorithms (68W05) Dynamic programming (90C39) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of inferring phylogenies from dissimilarity matrices
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• On the consistency of the minimum evolution principle of phylogenetic inference
• Methods for reconstructing the history of tandem repeats and their application to the human genome.
• Improved Approximation Algorithms for Tree Alignment

This page was built for publication: An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees