Complexity of DNA sequencing by hybridization

Authors:
Jacek Błazewicz;Marta Kasprzak
Affiliations:
Institute of Computing Science, Poznań University of Technology, ul, Piotrowo 3A, 60-965 Poznań, Poland and Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12 ...;Institute of Computing Science, Poznań University of Technology, ul, Piotrowo 3A, 60-965 Poznań, Poland and Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12 ...
Venue:
Theoretical Computer Science
Year:
2003

Citing 4
Cited 23

On some properties of DNA graphs

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the recognition of de Bruijn graphs and their induced subgraphs

Discrete Mathematics
On the Difference Between One and Many (Preliminary Version)

Proceedings of the Fourth Colloquium on Automata, Languages and Programming

Hybrid Genetic Algorithm for DNA Sequencing with Errors

Journal of Heuristics
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Sequencing by hybridization with isothermic oligonucleotide libraries

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Computational complexity of isothermic DNA sequencing by hybridization

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
On the complexity of the DNA simplified partial digest problem

CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
DNA Sequencing by Hybridization via Genetic Search

Operations Research
Sequencing by hybridization: an enhanced crossover operator for a hybrid genetic algorithm

Journal of Heuristics
A metaheuristic approach for the sequencing by hybridization problem with positive and negative errors

Engineering Applications of Artificial Intelligence
An ant colony optimization algorithm for DNA sequencing by hybridization

Computers and Operations Research
Finding Hamiltonian circuits in quasi-adjoint graphs

Discrete Applied Mathematics
Algorithm: Dealing with repetitions in sequencing by hybridization

Computational Biology and Chemistry
Computational complexity of isothermic DNA sequencing by hybridization

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Applications of artificial intelligence in bioinformatics: A review

Expert Systems with Applications: An International Journal
A math-heuristic algorithm for the DNA sequencing problem

LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Accurate Reconstruction for DNA Sequencing by Hybridization Based on a Constructive Heuristic

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries

Computational Biology and Chemistry
An integer programming approach to DNA sequence assembly

Computational Biology and Chemistry
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

Discrete Optimization
Complexity Issues in Computational Biology

Fundamenta Informaticae - Watching the Daisies Grow: from Biology to Biomathematics and Bioinformatics — Alan Turing Centenary Special Issue
On the complexity of the DNA simplified partial digest problem

CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
A hybrid algorithm for the DNA sequencing problem

Discrete Applied Mathematics
Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available

Computers and Operations Research

Quantified Score

Hi-index	5.23

Visualization

Abstract

In the paper, the question of the complexity of the combinatorial part of the DNA sequencing by hybridization, is analyzed. Subproblems of the general problem, depending on the type of error (positive, negative), are distinguished. Since decision versions of the subproblems assuming only one type of error are trivial, complexities of the search counterparts are studied. Both search subproblems are proved to be strongly NP-hard, as well as their uniquely promised versions.