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