Haplotyping with missing data via perfect path phylogenies

DOI10.1016/j.dam.2005.09.020zbMath1114.68080OpenAlexW2148556582MaRDI QIDQ876476

Jens Gramm, Roded Sharan, Till Tantau, Till Nierhoff

Publication date: 18 April 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.020

zbMATH Keywords

haplotypesincomplete datamissing datafixed-parameter algorithmsphylogeneticshaplotypinggenotypespath phylogeniesperfect phylogenies

Mathematics Subject Classification ID

Searching and sorting (68P10) Problems related to evolution (92D15) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08) Software, source code, etc. for problems pertaining to biology (92-04)

Related Items (7)

A linear-time parameterized algorithm for computing the width of a DAG ⋮ Phylogeny- and parsimony-based haplotype inference with constraints ⋮ Influence of tree topology restrictions on the complexity of haplotyping with missing data ⋮ Character-based phylogeny construction and its application to tumor evolution ⋮ Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems ⋮ Haplotype Inference Constrained by Plausible Haplotype Data ⋮ On the complexity of SNP block partitioning under the perfect phylogeny model

Cites Work

• Unnamed Item
• On the complexity of SNP block partitioning under the perfect phylogeny model
• Recognition algorithms for orders of small width and graphs of small Dilworth number
• Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers
• Parameterized and Exact Computation
• Combinatorial Pattern Matching

This page was built for publication: Haplotyping with missing data via perfect path phylogenies