Computational complexity of isothermic DNA sequencing by hybridization
From MaRDI portal
Publication:2489897
DOI10.1016/j.dam.2005.05.028zbMath1092.68044OpenAlexW2118275860WikidataQ57387760 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
Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Graph algorithms for DNA sequencing -- origins, current models and the future ⋮ Classification of de Bruijn-based labeled digraphs ⋮ Finding Hamiltonian circuits in quasi-adjoint graphs
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computational complexity of isothermic DNA sequencing by hybridization