Marta Kasprzak

Orcid: 0000-0002-9863-5412

Affiliations:
  • Poznan University of Technology, Poland


According to our database1, Marta Kasprzak authored at least 38 papers between 1997 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Genome-scale de novo assembly using ALGA.
Bioinform., 2021

A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2018
Graph algorithms for DNA sequencing - origins, current models and the future.
Eur. J. Oper. Res., 2018

Classification of de Bruijn-based labeled digraphs.
Discret. Appl. Math., 2018

2017
Tabu Search for the RNA Partial Degradation Problem.
Int. J. Appl. Math. Comput. Sci., 2017

2016
High-order statistical compressor for long-term storage of DNA sequencing data.
RAIRO Oper. Res., 2016

Structural alignment of protein descriptors - a combinatorial model.
BMC Bioinform., 2016

2012
Complexity Issues in Computational Biology.
Fundam. Informaticae, 2012

Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem.
Fundam. Informaticae, 2012

2011
RNA Partial Degradation Problem: Motivation, Complexity, Algorithm.
J. Comput. Biol., 2011

The simplified partial digest problem: Approximation and a graph-theoretic model.
Eur. J. Oper. Res., 2011

Highly Efficient Parallel Approach to the Next-Generation DNA Sequencing.
Proceedings of the Parallel Processing and Applied Mathematics, 2011

2009
On the approximability of the Simplified Partial Digest Problem.
Discret. Appl. Math., 2009

Whole genome assembly from 454 sequencing output via modified DNA graph concept.
Comput. Biol. Chem., 2009

2008
Finding Hamiltonian circuits in quasi-adjoint graphs.
Discret. Appl. Math., 2008

Parallel Implementation of the Novel Approach to Genome Assembly.
Proceedings of the Ninth ACIS International Conference on Software Engineering, 2008

2007
Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem.
Discret. Optim., 2007

2006
Computational complexity of isothermic DNA sequencing by hybridization.
Discret. Appl. Math., 2006

Dealing with repetitions in sequencing by hybridization.
Comput. Biol. Chem., 2006

On the complexity of the DNA Simplified Partial Digest Problem.
Proceedings of the Theory of Computing 2006, 2006

2005
Combinatorial optimization in DNA mapping - a computational thread of the Simplified Partial Digest Problem.
RAIRO Oper. Res., 2005

Selected combinatorial problems of computational biology.
Eur. J. Oper. Res., 2005

Evolutionary Approaches to DNA Sequencing with Errors.
Ann. Oper. Res., 2005

2004
An Algorithm for an Automatic NOE Pathways Analysis of 2D NMR Spectra of RNA Duplexes.
J. Comput. Biol., 2004

DNA Sequencing - Tabu and Scatter Search Combined.
INFORMS J. Comput., 2004

Sequencing by hybridization with isothermic oligonucleotide libraries.
Discret. Appl. Math., 2004

Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries.
Comput. Biol. Chem., 2004

Parallel DNA Sequence Assembly.
Proceedings of the 5th Mexican International Conference on Computer Science (ENC 2004), 2004

2003
Complexity of DNA sequencing by hybridization.
Theor. Comput. Sci., 2003

2002
Hybrid Genetic Algorithm for DNA Sequencing with Errors.
J. Heuristics, 2002

On the recognition of de Bruijn graphs and their induced subgraphs.
Discret. Math., 2002

A heuristic managing errors for DNA sequencing.
Bioinform., 2002

DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001
Construction of DNA restriction maps based on a simplified experiment.
Bioinform., 2001

2000
Tabu search for DNA sequencing with false negatives and false positives.
Eur. J. Oper. Res., 2000

1999
DNA Sequencing With Positive and Negative Errors.
J. Comput. Biol., 1999

1997
Sequential and parallel algorithms for DNA sequencing.
Comput. Appl. Biosci., 1997


  Loading...