| Publication | Date of Publication | Type |
|---|
Random input helps searching predecessors
| 2024-10-31 | Paper |
Efficient reconciliation of genomic datasets of high similarity
| 2024-08-13 | Paper |
Genome-Scale Algorithm Design
| 2023-08-29 | Paper |
Space-Efficient Representation of Genomic k-Mer Count Tables
| 2023-07-24 | Paper |
scientific article; zbMATH DE number 7695994 (Why is no real title available?)
| 2023-06-14 | Paper |
scientific article; zbMATH DE number 7651095 (Why is no real title available?)
| 2023-02-07 | Paper |
Smaller Fully-Functional Bidirectional BWT Indexes
1511.68097 | 2022-12-22 | Paper |
scientific article; zbMATH DE number 7559178 (Why is no real title available?)
| 2022-07-18 | Paper |
Computing the Antiperiod(s) of a String
| 2022-07-18 | Paper |
Range majorities and minorities in arrays
Algorithmica | 2021-06-11 | Paper |
Linear-time string indexing and analysis in small space
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Fast label extraction in the CDAWG
String Processing and Information Retrieval | 2021-02-16 | Paper |
Block trees
Journal of Computer and System Sciences | 2021-02-02 | Paper |
Fast matching statistics in small space
| 2020-12-16 | Paper |
Representing the suffix tree with the CDAWG
| 2020-05-25 | Paper |
Theory and practice of monotone minimal perfect hashing
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Bidirectional Variable-Order de Bruijn Graphs
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Compressed static functions with applications
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
scientific article; zbMATH DE number 7051248 (Why is no real title available?)
| 2019-05-06 | Paper |
Alphabet-independent compressed text indexing
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Optimal lower and upper bounds for representing sequences
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Fully dynamic de Bruijn graphs
| 2018-10-17 | Paper |
Indexing and querying character sets in one- and two-dimensional words
Journal of Mathematical Sciences (New York) | 2018-10-11 | Paper |
Range predecessor and Lempel-Ziv parsing
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A framework for space-efficient string kernels
Algorithmica | 2017-11-09 | Paper |
Flexible indexing of repetitive collections
| 2017-08-04 | Paper |
Indexing and querying color sets of images
Theoretical Computer Science | 2016-09-01 | Paper |
Bidirectional variable-order de Bruijn graphs
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Compressed string dictionary search with edit distance one
Algorithmica | 2016-04-06 | Paper |
Optimal Las Vegas reduction from one-way set reconciliation to error correction
Theoretical Computer Science | 2016-02-26 | Paper |
Access, rank, and select in grammar-compressed strings
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Improved space-time tradeoffs for approximate full-text indexing with one edit error
Algorithmica | 2015-09-02 | Paper |
Composite repetition-aware data structures
Combinatorial Pattern Matching | 2015-08-20 | Paper |
A framework for space-efficient string kernels
Lecture Notes in Computer Science | 2015-08-20 | Paper |
Linear time construction of compressed text indices in compact space
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Simple, compact and robust approximate string dictionary
Journal of Discrete Algorithms | 2014-09-05 | Paper |
Expected linear time sorting for word size \(\Omega (\log ^{2} n \log\log n)\)
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Various improvements to text fingerprinting
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Theory and practice of monotone minimal perfect hashing
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Single and multiple consecutive permutation motif search
Algorithms and Computation | 2014-01-14 | Paper |
Versatile succinct representations of the bidirectional Burrows-Wheeler transform
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Better space bounds for parameterized range majority and minority
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Improved compressed indexes for full-text document retrieval
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Approximate regular expression matching with multi-strings
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Average optimal string matching in packed strings
Lecture Notes in Computer Science | 2013-06-07 | Paper |
New lower and upper bounds for representing sequences
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Compressed string dictionary look-up with edit distance one
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Alphabet-independent compressed text indexing
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Worst case efficient single and multiple string matching in the RAM model
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Fast prefix search in little space, with applications
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Succinct Dictionary Matching with No Slowdown
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Hash, Displace, and Compress
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Faster and Space-Optimal Edit Distance “1” Dictionary
Combinatorial Pattern Matching | 2009-07-07 | Paper |
