Computational complexity of isothermic DNA sequencing by hybridization
From MaRDI portal
Publication:2489897
DOI10.1016/j.dam.2005.05.028zbMath1092.68044WikidataQ57387760 ScholiaQ57387760MaRDI QIDQ2489897
Marta Kasprzak, Jacek Błażewicz
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.028
68Q25: Analysis of algorithms and problem complexity
92D20: Protein sequences, DNA sequences
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Finding Hamiltonian circuits in quasi-adjoint graphs, Graph algorithms for DNA sequencing -- origins, current models and the future, Classification of de Bruijn-based labeled digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequencing by hybridization with isothermic oligonucleotide libraries
- On finding minimal length superstrings
- Complexity of DNA sequencing by hybridization.
- Euler circuits and DNA sequencing by hybridization
- On some properties of DNA graphs
- An algorithm for isothermic DNA sequencing
- The NP-completeness column: An ongoing guide