List of works - Marta Kasprzak

A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs

scientific article published in 2021

A heuristic managing errors for DNA sequencing

scientific article published in May 2002

A new algorithm for genome assembly from short reads

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

An algorithm for an automatic NOE pathways analysis of 2D NMR spectra of RNA duplexes.

scientific article published in January 2004

An integrated approach (CLuster Analysis Integration Method) to combine expression data and protein-protein interaction networks in agrigenomics: application on Arabidopsis thaliana

scientific article

Classification of de Bruijn-based labeled digraphs

scientific article published in January 2018

Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem

article by Jacek Błażewicz & Marta Kasprzak published October 2005 in RAIRO Operations Research

Complexity Issues in Computational Biology

scientific article published in 2012

Complexity of DNA sequencing by hybridization

Computational complexity of isothermic DNA sequencing by hybridization

Construction of DNA restriction maps based on a simplified experiment

scientific article published in May 2001

DNA Sequencing—Tabu and Scatter Search Combined

scientific article published in August 2004

DNA sequencing with positive and negative errors.

scientific article published in January 1999

Dealing with repetitions in sequencing by hybridization

scientific article published on 30 August 2006

Dna Sequence Assembly Involving an Acyclic Graph Model

article

Evolutionary Approaches to DNA Sequencing with Errors

Finding Hamiltonian circuits in quasi-adjoint graphs

GRASShopPER-An algorithm for de novo assembly based on GPU alignments

scientific article published in PLoS ONE

Genome-scale de novo assembly using ALGA

scientific article published on 20 January 2021

Graph algorithms for DNA sequencing – origins, current models and the future

High-order statistical compressor for long-term storage of DNA sequencing data

scientific article published on 24 March 2016

Highly Efficient Parallel Approach to the Next-Generation DNA Sequencing

Labeled Graphs in Life Sciences—Two Important Applications

scientific article published on 2 August 2021

On the approximability of the Simplified Partial Digest Problem

article published in 2009

On the recognition of de Bruijn graphs and their induced subgraphs

Parallel Implementation of the Novel Approach to Genome Assembly

RNA partial degradation problem: motivation, complexity, algorithm

scientific article published on 12 May 2011

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

scientific article published in 2012

Selected combinatorial problems of computational biology

Sequencing by hybridization with isothermic oligonucleotide libraries

article published in 2004

Simplified partial digest problem: enumerative and dynamic programming algorithms.

scientific article published in October 2007

Structural alignment of protein descriptors - a combinatorial model

scientific article

Tabu Search for the RNA Partial Degradation Problem

Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries

scientific article published in February 2004

Tabu search for DNA sequencing with false negatives and false positives

The simplified partial digest problem: Approximation and a graph-theoretic model

Whole genome assembly from 454 sequencing output via modified DNA graph concept

scientific article

List of works by Marta Kasprzak

A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs

A heuristic managing errors for DNA sequencing

A new algorithm for genome assembly from short reads

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

An algorithm for an automatic NOE pathways analysis of 2D NMR spectra of RNA duplexes.

An integrated approach (CLuster Analysis Integration Method) to combine expression data and protein-protein interaction networks in agrigenomics: application on Arabidopsis thaliana

Classification of de Bruijn-based labeled digraphs

Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem

Complexity Issues in Computational Biology

Complexity of DNA sequencing by hybridization

Computational complexity of isothermic DNA sequencing by hybridization

Construction of DNA restriction maps based on a simplified experiment

DNA Sequencing—Tabu and Scatter Search Combined

DNA sequencing with positive and negative errors.

Dealing with repetitions in sequencing by hybridization

Dna Sequence Assembly Involving an Acyclic Graph Model

Evolutionary Approaches to DNA Sequencing with Errors

Finding Hamiltonian circuits in quasi-adjoint graphs

GRASShopPER-An algorithm for de novo assembly based on GPU alignments

Genome-scale de novo assembly using ALGA

Graph algorithms for DNA sequencing – origins, current models and the future

High-order statistical compressor for long-term storage of DNA sequencing data

Highly Efficient Parallel Approach to the Next-Generation DNA Sequencing

Labeled Graphs in Life Sciences—Two Important Applications

On the approximability of the Simplified Partial Digest Problem

On the recognition of de Bruijn graphs and their induced subgraphs

Parallel Implementation of the Novel Approach to Genome Assembly

RNA partial degradation problem: motivation, complexity, algorithm

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

Selected combinatorial problems of computational biology

Sequencing by hybridization with isothermic oligonucleotide libraries

Simplified partial digest problem: enumerative and dynamic programming algorithms.

Structural alignment of protein descriptors - a combinatorial model

Tabu Search for the RNA Partial Degradation Problem

Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries

Tabu search for DNA sequencing with false negatives and false positives

The simplified partial digest problem: Approximation and a graph-theoretic model

Whole genome assembly from 454 sequencing output via modified DNA graph concept