Parameterized and Exact Computation

DOI10.1007/B100584MaRDI QIDQ5311510zbMATH OpenOpenAlexFDO

Authors Jens Gramm, Till Nierhoff, Till Tantau

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100584

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Genetics and epigenetics (92D10)

Recommendations

• Haplotyping with missing data via perfect path phylogenies
• Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
• Influence of tree topology restrictions on the complexity of haplotyping with missing data
• Extended islands of tractability for parsimony haplotyping
• Fast perfect phylogeny haplotype inference.

Cited in

(6)

• On the complexity of SNP block partitioning under the perfect phylogeny model
• Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
• Influence of tree topology restrictions on the complexity of haplotyping with missing data
• Combinatorial Pattern Matching
• Computational Science – ICCS 2005
• Haplotyping with missing data via perfect path phylogenies

This page was built for publication: Parameterized and Exact Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311510)