Computational complexity of isothermic DNA sequencing by hybridization

DOI10.1016/J.DAM.2005.05.028MaRDI QIDQ2489897zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Marta Kasprzak, Jacek Blazewicz

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

zbMATH Keywords

Computational complexityDNA sequencingEulerian path

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20)

Recommendations

• An algorithm for isothermic DNA sequencing
• Complexity of DNA sequencing by hybridization.
• Sequencing by hybridization with isothermic oligonucleotide libraries
• Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries
• scientific article; zbMATH DE number 2239908

Cites work

• An algorithm for isothermic DNA sequencing
• Complexity of DNA sequencing by hybridization.
• Euler circuits and DNA sequencing by hybridization
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1301593 (Why is no real title available?)
• scientific article; zbMATH DE number 699389 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 1557065 (Why is no real title available?)
• On finding minimal length superstrings
• On some properties of DNA graphs
• Sequencing by hybridization with isothermic oligonucleotide libraries
• The NP-completeness column: An ongoing guide

Cited in

(12)

• Complexity of DNA sequencing by hybridization.
• Graph algorithms for DNA sequencing -- origins, current models and the future
• Classification of de Bruijn-based labeled digraphs
• Resolving power of isothermic DNA sequencing chips
• Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries
• Multistage isothermic sequencing by hybridization
• An algorithm for isothermic DNA sequencing
• scientific article; zbMATH DE number 1953078 (Why is no real title available?)
• scientific article; zbMATH DE number 2013796 (Why is no real title available?)
• Beyond quasi-adjoint graphs: on polynomial-time solvable cases of the Hamiltonian cycle and path problems
• Sequencing by hybridization with isothermic oligonucleotide libraries
• Finding Hamiltonian circuits in quasi-adjoint graphs

This page was built for publication: Computational complexity of isothermic DNA sequencing by hybridization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489897)