Marta Kasprzak

Problem Formulation (2008)

Fred Glover, Marta Kasprzak

informs ® doi 10.1287/ijoc.1030.0049

IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 1 Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms (2008)

Jacek Blazewicz, Senior Member, Edmund Burke, Marta Kasprzak, R Kovalev, Mikhail Y. Kovalyov

(SPDP), which is a mathematical model for a new simplified partial digest method of genome mapping. This method is easy for laboratory implementation and robust with respect to the experimental...

Tabu search method for DNA sequencing by hybridization with isothermic libraries (2003)

Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Wojciech T. Markiewicz, Aleksandra Swiercz

Introduction. In this work, a problem of DNA sequencing by hybridization (SBH) with isothermic libraries, is considered. The classical approach to SBH uses sets of oligonucleotides of equal lengths...

A heuristic managing errors for DNA sequencing (2002)

Blazewicz, Jacek, Formanowicz, Piotr, Guinand, Frederic, Kasprzak, Marta

Motivation: A new heuristic algorithm for solving DNA sequencing by hybridization problem with positive and negative errors. Results: A heuristic algorithm providing better solutions than algorithms...

Sequential and parallel algorithms for DNA sequencing (1997)

Blazewicz, Jacek, Kaczmarek, Janusz, Kasprzak, Marta, Markiewicz, Wojciech T., Weglarz, Jan

Motivation Reconstruction of the original DNA sequence in the sequencing by the hybridization approach (SBH) requires computational support due to a large number of possible combinations.One can...