A linear-time algorithm for the perfect phylogeny haplotype problem
From MaRDI portal
Publication:2642317
DOI10.1007/s00453-007-0094-3zbMath1121.92050OpenAlexW2005193052MaRDI QIDQ2642317
Publication date: 20 August 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-0094-3
Problems related to evolution (92D15) Nonnumerical algorithms (68W05) Computing methodologies and applications (68U99)
Related Items (8)
A linear-time parameterized algorithm for computing the width of a DAG ⋮ Mathematical Models and Solutions for the Analysis of Human Genotypes ⋮ Phylogeny- and parsimony-based haplotype inference with constraints ⋮ Influence of tree topology restrictions on the complexity of haplotyping with missing data ⋮ PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion ⋮ Character-based phylogeny construction and its application to tumor evolution ⋮ The binary perfect phylogeny with persistent characters ⋮ A colored graph approach to perfect phylogeny with persistent characters
This page was built for publication: A linear-time algorithm for the perfect phylogeny haplotype problem
