The complexity of physical mapping with strict chimerism
From MaRDI portal
Recommendations
- The chimeric mapping problem: Algorithmic strategies and performance evaluation on synthetic genomic data
- Physical mapping with repeated probes: the hypergraph superstring problem
- On the complexity of DNA physical mapping
- On Physical Mapping and the consecutive ones property for sparse matrices
- scientific article; zbMATH DE number 1003281
Cited in
(7)- The parameterized complexity of stabbing rectangles
- Physical mapping with repeated probes: the hypergraph superstring problem
- Radiation hybrid map construction problem parameterized
- The chimeric mapping problem: Algorithmic strategies and performance evaluation on synthetic genomic data
- On the approximability of physical map problems using single molecule methods
- scientific article; zbMATH DE number 2163026 (Why is no real title available?)
- On Physical Mapping and the consecutive ones property for sparse matrices
This page was built for publication: The complexity of physical mapping with strict chimerism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766848)