Complexity Issues in Computational Biology

Authors:
Jacek Blazewicz;Marta Kasprzak
Affiliations:
Institute of Computing Science, Poznan University of Technology, Piotrowo 2, 60-965 Poznan, Poland and Institute of Bioorganic Chemistry, Polish Academy of Sciences, Poznan, Poland, marta@cs.put.p ...;(Correspd.) Institute of Computing Science, Poznan University of Technology, Piotrowo 2, 60-965 Poznan, Poland and Institute of Bioorganic Chemistry, Polish Academy of Sciences, Poznan, Poland, ma ...
Venue:
Fundamenta Informaticae - Watching the Daisies Grow: from Biology to Biomathematics and Bioinformatics — Alan Turing Centenary Special Issue
Year:
2012

Citing 15
Cited 0

Molecular computation of solutions to combinatorial problems

Science
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
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
On the recognition of de Bruijn graphs and their induced subgraphs

Discrete Mathematics
Complexity of DNA sequencing by hybridization

Theoretical Computer Science
Sequencing by hybridization with isothermic oligonucleotide libraries

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Graphs and Hypergraphs

Graphs and Hypergraphs
Finding Hamiltonian circuits in quasi-adjoint graphs

Discrete Applied Mathematics
Brief Communication: Whole genome assembly from 454 sequencing output via modified DNA graph concept

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
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
Paired de bruijn graphs: a novel approach for incorporating mate pair information into genome assemblers

RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

Discrete Optimization
Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The progress of research in the area of computational biology, visible in last decades, brought, among others, a new insight into the complexity issues. The latter, previously studied mainly on the ground of computer science or operational research, gained by a confrontation with problems from the new area. In the paper, several complexity issues inspired by computational biology are presented.