| 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 | 2024-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147517 | 2024-01-15 | Paper |
| On the Complexity of String Matching for Graphs | 2023-10-23 | Paper |
| Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails | 2023-09-21 | Paper |
| Genome-Scale Algorithm Design | 2023-08-29 | Paper |
| Algorithms and complexity on indexing founder graphs | 2023-06-05 | Paper |
| Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended | 2023-03-09 | Paper |
| Linear time construction of indexable founder block graphs | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874455 | 2023-02-07 | Paper |
| Tailoring r-index for Document Listing Towards Metagenomics Applications | 2022-12-22 | Paper |
| Linear time construction of indexable elastic founder graphs | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091210 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090343 | 2022-07-18 | Paper |
| Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails | 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 | 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 | 2019-11-25 | Paper |
| Bidirectional Variable-Order de Bruijn Graphs | 2019-06-24 | Paper |
| Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance | 2019-04-26 | Paper |
| Dynamic entropy-compressed sequences and full-text indexes | 2018-11-05 | Paper |
| Fully dynamic de Bruijn graphs | 2018-10-17 | Paper |
| Interval scheduling maximizing minimum coverage | 2017-05-12 | Paper |
| Gap Filling as Exact Path Length Problem | 2016-06-22 | Paper |
| Bidirectional Variable-Order de Bruijn Graphs | 2016-05-03 | Paper |
| Compressed representations of sequences and full-text indexes | 2015-09-02 | Paper |
| Multi-pattern matching with bidirectional indexes | 2014-08-13 | Paper |
| Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform | 2013-09-17 | Paper |
| Multi-pattern Matching with Bidirectional Indexes | 2012-09-25 | Paper |
| Forbidden Patterns | 2012-06-29 | Paper |
| Indexed Multi-pattern Matching | 2012-06-29 | Paper |
| Approximate all-pairs suffix/prefix overlaps | 2012-05-24 | Paper |
| The cycle switching graph of the Steiner triple systems of order 19 is connected | 2012-01-24 | Paper |
| Missing pattern discovery | 2011-07-29 | Paper |
| Approximate All-Pairs Suffix/Prefix Overlaps | 2010-07-26 | Paper |
| Unified View of Backward Backtracking in Short Read Mapping | 2010-05-04 | Paper |
| On Minimizing Pattern Splitting in Multi-track String Matching | 2010-04-06 | Paper |
| Faster entropy-bounded compressed suffix trees | 2009-11-18 | Paper |
| Efficient construction of maximal and minimal representations of motifs of a string | 2009-08-07 | Paper |
| Storage and Retrieval of Individual Genomes | 2009-06-03 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections | 2009-01-27 | Paper |
| Position-Restricted Substring Searching | 2008-09-18 | Paper |
| Space-Efficient Algorithms for Document Retrieval | 2008-06-17 | Paper |
| An(other) Entropy-Bounded Compressed Suffix Tree | 2008-06-17 | Paper |
| Rank and select revisited and extended | 2007-12-19 | Paper |
| Dynamic Entropy-Compressed Sequences and Full-Text Indexes | 2007-09-14 | Paper |
| Rotation and lighting invariant template matching | 2007-07-16 | Paper |
| FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME | 2007-02-08 | Paper |
| A SIMPLE ALPHABET-INDEPENDENT FM-INDEX | 2007-02-08 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708460 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5705142 | 2005-11-08 | Paper |
| On minimizing pattern splitting in multi-track string matching | 2005-10-27 | Paper |
| Transposition invariant string matching | 2005-09-28 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737694 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432981 | 2003-10-29 | Paper |
| Approximate matching of run-length compressed strings | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418649 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413809 | 2003-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801191 | 2003-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547735 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723961 | 2001-07-08 | Paper |
