Haplotype Inference Constrained by Plausible Haplotype Data

DOI10.1007/978-3-642-02441-2_30zbMath1247.92017OpenAlexW1942157993WikidataQ57359811 ScholiaQ57359811MaRDI QIDQ3637124

Frances A. Rosamond, Liat Rozenberg, Danny Hermelin, Gad M. Landau, Michael R. Fellows, Tzvika Hartman

Publication date: 7 July 2009

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02441-2_30

Mathematics Subject Classification ID

Problems related to evolution (92D15) Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Complexity and performance of numerical algorithms (65Y20)

Related Items

Phylogeny- and parsimony-based haplotype inference with constraints ⋮ The parameterized complexity of the rainbow subgraph problem

Cites Work

• Haplotyping with missing data via perfect path phylogenies
• On the complexity of SNP block partitioning under the perfect phylogeny model
• A polynomial case of the parsimony haplotyping problem
• Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
• Combinatorial Pattern Matching
• Computational Methods for SNPs and Haplotype Inference
• Algorithmic Learning Theory
• Research in Computational Molecular Biology
• Fundamentals of Computation Theory