Kasprzak Marta

Marta Kasprzak

Information about the author Marta Kasprzak will soon be added to the site.
Found 7 papers in total
The simplified partial digest problem: Approximation and a graph-theoretic model
The simplified partial digest problem: Approximation and a graph-theoretic model
2011
The goal of the simplified partial digest problem (SPDP) is motivated by the...
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
2007
We investigate the computational complexity of a combinatorial problem that arises in...
Combinatorial optimization in DNA mapping – a computational thread of the Simplified Partial Digest Problem
Combinatorial optimization in DNA mapping – a computational thread of the Simplified Partial Digest Problem
2005
In the paper, the problem of the genome mapping of DNA molecules is presented. In...
DNA sequencing – tabu and scatter search combined
DNA sequencing – tabu and scatter search combined
2004
In this paper, a tabu-search algorithm enhanced by scatter search is presented. The...
Evolutionary approaches to DNA sequencing with errors
Evolutionary approaches to DNA sequencing with errors
2005
In the paper, two evolutionary approaches to the general DNA sequencing problem,...
Selected combinatorial problems of computational biology
Selected combinatorial problems of computational biology
2005
Recently we observe a great breakthrough in biology connected with the studies on...
Hybrid genetic algorithm for DNA sequencing with errors
Hybrid genetic algorithm for DNA sequencing with errors
2002
In the paper, a new hybrid genetic algorithm solving the DNA sequencing problem with...
Papers per page: