Computational complexity of isothermic DNA sequencing by hybridization

DOI10.1016/J.DAM.2005.05.028zbMATH Open1092.68044DBLPjournals/dam/BlazewiczK06OpenAlexW2118275860WikidataQ57387760 ScholiaQ57387760MaRDI QIDQ2489897FDOQ2489897

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

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

zbMATH Keywords

DNA sequencingEulerian pathComputational complexity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On some properties of DNA graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity of DNA sequencing by hybridization.
• On finding minimal length superstrings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Euler circuits and DNA sequencing by hybridization
• Sequencing by hybridization with isothermic oligonucleotide libraries
• The NP-completeness column: An ongoing guide
• Title not available (Why is that?)
• An algorithm for isothermic DNA sequencing

Cited In (11)

• Finding Hamiltonian circuits in quasi-adjoint graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequencing by hybridization with isothermic oligonucleotide libraries
• Resolving power of isothermic DNA sequencing chips
• Graph algorithms for DNA sequencing -- origins, current models and the future
• An algorithm for isothermic DNA sequencing
• Complexity of DNA sequencing by hybridization.
• Multistage isothermic sequencing by hybridization
• Classification of de Bruijn-based labeled digraphs
• Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries

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)