| Publication | Date of Publication | Type |
|---|
| Finding maximal exact matches in graphs | 2024-12-09 | Paper |
| From bit-parallelism to quantum string matching for labelled graphs | 2024-10-21 | Paper |
| Chaining of maximal exact matches in graphs | 2024-05-29 | Paper |
| Indexable elastic founder graphs of minimum height | 2024-05-06 | Paper |
| Linear time maximum segmentation problems in column stream model | 2024-04-19 | Paper |
Elastic founder graphs improved and enhanced
Theoretical Computer Science | 2024-02-23 | Paper |
| scientific article; zbMATH DE number 7788593 (Why is no real title available?) | 2024-01-15 | Paper |
On the Complexity of String Matching for Graphs
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
Theoretical Computer Science | 2023-09-21 | Paper |
| Genome-Scale Algorithm Design | 2023-08-29 | Paper |
Algorithms and complexity on indexing founder graphs
Algorithmica | 2023-06-05 | Paper |
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
Lecture Notes in Computer Science | 2023-03-09 | Paper |
| Linear time construction of indexable founder block graphs | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651116 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Tailoring r-index for Document Listing Towards Metagenomics Applications
1511.68099 | 2022-12-22 | Paper |
Linear time construction of indexable elastic founder graphs
(available as arXiv preprint) | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7561548 (Why is no real title available?) | 2022-07-21 | Paper |
Minimum segmentation for pan-genomic founder reconstruction in linear time
(available as arXiv preprint) | 2022-07-18 | Paper |
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
(available as arXiv preprint) | 2022-03-24 | Paper |
| mGEMS Escherichia coli reference dataset | 2021-05-05 | Dataset |
| mGEMS Escherichia coli in vitro experiment hybrid assemblies | 2021-05-05 | Dataset |
| mGEMS Escherichia coli nanopore reads for in vitro experiment hybrid assemblies | 2021-05-05 | Dataset |
Linear-time string indexing and analysis in small space
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Linear-time string indexing and analysis in small space
ACM Transactions on Algorithms | 2021-05-03 | Paper |
| mGEMS Enterococcus faecalis reference dataset | 2020-03-23 | Dataset |
| mGEMS Staphylococcus aureus reference dataset | 2020-03-23 | Dataset |
| mGEMS synthetic mixed samples (Supplementary Table) | 2020-03-23 | Dataset |
Sparse dynamic programming on DAGs with small width
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Bidirectional Variable-Order de Bruijn Graphs
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance
Information Processing Letters | 2019-04-26 | Paper |
Dynamic entropy-compressed sequences and full-text indexes
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Fully dynamic de Bruijn graphs
(available as arXiv preprint) | 2018-10-17 | Paper |
Interval scheduling maximizing minimum coverage
Discrete Applied Mathematics | 2017-05-12 | Paper |
Interval scheduling maximizing minimum coverage
Discrete Applied Mathematics | 2017-05-12 | Paper |
Gap filling as exact path length problem
Lecture Notes in Computer Science | 2016-06-22 | Paper |
Bidirectional variable-order de Bruijn graphs
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Multi-pattern matching with bidirectional indexes
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Versatile succinct representations of the bidirectional Burrows-Wheeler transform
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Multi-pattern matching with bidirectional indexes
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Forbidden patterns
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Indexed multi-pattern matching
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Approximate all-pairs suffix/prefix overlaps
Information and Computation | 2012-05-24 | Paper |
The cycle switching graph of the Steiner triple systems of order 19 is connected
Graphs and Combinatorics | 2012-01-24 | Paper |
Missing pattern discovery
Journal of Discrete Algorithms | 2011-07-29 | Paper |
Approximate All-Pairs Suffix/Prefix Overlaps
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Unified View of Backward Backtracking in Short Read Mapping
Algorithms and Applications | 2010-05-04 | Paper |
On Minimizing Pattern Splitting in Multi-track String Matching
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Faster entropy-bounded compressed suffix trees
Theoretical Computer Science | 2009-11-18 | Paper |
Efficient construction of maximal and minimal representations of motifs of a string
Theoretical Computer Science | 2009-08-07 | Paper |
Storage and Retrieval of Individual Genomes
Lecture Notes in Computer Science | 2009-06-03 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
String Processing and Information Retrieval | 2009-01-27 | Paper |
Position-Restricted Substring Searching
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Space-Efficient Algorithms for Document Retrieval
Combinatorial Pattern Matching | 2008-06-17 | Paper |
An(other) Entropy-Bounded Compressed Suffix Tree
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Rank and select revisited and extended
Theoretical Computer Science | 2007-12-19 | Paper |
Dynamic Entropy-Compressed Sequences and Full-Text Indexes
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Rotation and lighting invariant template matching
Information and Computation | 2007-07-16 | Paper |
FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
A SIMPLE ALPHABET-INDEPENDENT FM-INDEX
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
| scientific article; zbMATH DE number 2230164 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2226805 (Why is no real title available?) | 2005-11-08 | Paper |
On minimizing pattern splitting in multi-track string matching
Journal of Discrete Algorithms | 2005-10-27 | Paper |
Transposition invariant string matching
Journal of Algorithms | 2005-09-28 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
| scientific article; zbMATH DE number 2087048 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1998345 (Why is no real title available?) | 2003-10-29 | Paper |
Approximate matching of run-length compressed strings
Algorithmica | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1962813 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1951569 (Why is no real title available?) | 2003-07-21 | Paper |
| scientific article; zbMATH DE number 1893570 (Why is no real title available?) | 2003-04-07 | Paper |
| scientific article; zbMATH DE number 1786446 (Why is no real title available?) | 2002-08-21 | Paper |
| scientific article; zbMATH DE number 1615289 (Why is no real title available?) | 2001-07-08 | Paper |
