Haplotype Inference Constrained by Plausible Haplotype Data
From MaRDI portal
Recommendations
- Phylogeny- and parsimony-based haplotype inference with constraints
- Phylogeny- and parsimony-based haplotype inference with constraints
- Fast perfect phylogeny haplotype inference.
- Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics
- Extended islands of tractability for parsimony haplotyping
Cites work
- A polynomial case of the parsimony haplotyping problem
- Algorithmic Learning Theory
- Combinatorial Pattern Matching
- Computational Methods for SNPs and Haplotype Inference
- Fast perfect phylogeny haplotype inference.
- Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
- Haplotyping with missing data via perfect path phylogenies
- On the complexity of SNP block partitioning under the perfect phylogeny model
- Research in Computational Molecular Biology
Cited in
(5)- The parameterized complexity of the rainbow subgraph problem
- Phylogeny- and parsimony-based haplotype inference with constraints
- Phylogeny- and parsimony-based haplotype inference with constraints
- Extended islands of tractability for parsimony haplotyping
- Accurate construction of long range haplotype in unrelated individuals
This page was built for publication: Haplotype Inference Constrained by Plausible Haplotype Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637124)
