Influence of tree topology restrictions on the complexity of haplotyping with missing data
From MaRDI portal
(Redirected from Publication:428852)
Recommendations
- Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
- Parameterized and Exact Computation
- Haplotyping with missing data via perfect path phylogenies
- Phylogeny- and parsimony-based haplotype inference with constraints
- Phylogeny- and parsimony-based haplotype inference with constraints
Cites work
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- A linear-time algorithm for the perfect phylogeny haplotype problem
- Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
- Haplotyping with missing data via perfect path phylogenies
- Incomplete Directed Perfect Phylogeny
- Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
- On the complexity of SNP block partitioning under the perfect phylogeny model
- The complexity of reconstructing trees from qualitative characters and subtrees
- The complexity of satisfiability problems
Cited in
(5)
This page was built for publication: Influence of tree topology restrictions on the complexity of haplotyping with missing data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428852)