Complexity of DNA sequencing by hybridization.

DOI10.1016/S0304-3975(02)00063-4MaRDI QIDQ1401172zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jacek Blazewicz, Marta Kasprzak

Publication date 17 August 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(02)00063-4

zbMATH Keywords

DNA sequencingComputational complexityComputational biology

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computational complexity of isothermic DNA sequencing by hybridization
• scientific article; zbMATH DE number 2239908
• scientific article; zbMATH DE number 1953078
• Hybrid genetic algorithm for DNA sequencing with errors
• A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

Cites work

• scientific article; zbMATH DE number 3568040 (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 1175965 (Why is no real title available?)
• On finding minimal length superstrings
• On some properties of DNA graphs
• On the recognition of de Bruijn graphs and their induced subgraphs
• Tabu search for DNA sequencing with false negatives and false positives
• The NP-completeness column: An ongoing guide

Cited in

(26)

• scientific article; zbMATH DE number 2239908 (Why is no real title available?)
• An integer programming approach to DNA sequence assembly
• Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
• Finding Hamiltonian circuits in quasi-adjoint graphs
• A greedy algorithm for the DNA sequencing by hybridization with positive and negative errors and information about repetitions
• A hyper-heuristic approach to sequencing by hybridization of DNA sequences
• Advancing Shannon entropy for measuring diversity in systems
• Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats
• Computational complexity of isothermic DNA sequencing by hybridization
• Evolutionary approaches to DNA sequencing with errors
• A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
• A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem
• A hybrid algorithm for the DNA sequencing problem
• Graph algorithms for DNA sequencing -- origins, current models and the future
• scientific article; zbMATH DE number 1953078 (Why is no real title available?)
• scientific article; zbMATH DE number 2185634 (Why is no real title available?)
• Applications of graph theory in DNA sequencing by hybridization
• Selected combinatorial problems of computational biology
• Sequencing from compomers: The puzzle
• Unified encoding for hyper-heuristics with application to bioinformatics
• An ant colony optimization algorithm for DNA sequencing by hybridization
• Sequencing by hybridization with isothermic oligonucleotide libraries
• Dealing with repetitions in sequencing by hybridization
• Computational Science - ICCS 2004
• Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available
• Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries

This page was built for publication: Complexity of DNA sequencing by hybridization.

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