Extended islands of tractability for parsimony haplotyping

DOI10.1007/978-3-642-13509-5_20zbMATH Open1286.92036OpenAlexW1519285721MaRDI QIDQ3575249FDOQ3575249

Authors: Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu 

Publication date: 26 July 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13509-5_20

Recommendations

• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
• A polynomial case of the parsimony haplotyping problem
• Phylogeny- and parsimony-based haplotype inference with constraints
• Phylogeny- and parsimony-based haplotype inference with constraints
• Haplotype Inference Constrained by Plausible Haplotype Data

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to biology (92-08)

Cited In (8)

• The parameterized complexity of the rainbow subgraph problem
• A polynomial case of the parsimony haplotyping problem
• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
• Mod/Resc parsimony inference: theory and application
• Phylogeny- and parsimony-based haplotype inference with constraints
• Mod/Resc parsimony inference
• Haplotype Inference Constrained by Plausible Haplotype Data
• Parameterized and Exact Computation

This page was built for publication: Extended islands of tractability for parsimony haplotyping

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