| Publication | Date of Publication | Type |
|---|
| Lyndon arrays in sublinear time | 2025-01-06 | Paper |
| Acceleration of FM-index queries through prefix-free parsing | 2024-12-09 | Paper |
| Optimal LZ-end parsing is hard | 2024-10-21 | Paper |
| Faster space-efficient STR-IC-LCS computation | 2024-06-04 | Paper |
| Linear-time computation of generalized minimal absent words for multiple strings | 2024-05-29 | Paper |
| Compact data structures for shortest unique substring queries | 2024-04-19 | Paper |
| On longest common property preserved substring queries | 2024-04-19 | Paper |
| Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets | 2024-04-19 | Paper |
| Constructing and indexing the bijective and extended Burrows-Wheeler transform | 2024-03-27 | Paper |
| Computing longest Lyndon subsequences and longest common Lyndon subsequences | 2024-03-25 | Paper |
| Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets | 2023-09-07 | Paper |
| Space-efficient STR-IC-LCS computation | 2023-08-14 | Paper |
| Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions | 2023-08-04 | Paper |
| Block palindromes: a new generalization of palindromes | 2023-07-28 | Paper |
| Recovering, counting and enumerating strings from forward and backward suffix arrays | 2023-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098771 | 2023-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098777 | 2023-06-14 | Paper |
| Longest bordered and periodic subsequences | 2023-06-05 | Paper |
| The parameterized suffix tray | 2023-03-22 | Paper |
| Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences | 2023-02-07 | Paper |
| DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures | 2023-02-07 | Paper |
| An improved data structure for left-right maximal generic words problem | 2023-02-03 | Paper |
| Lyndon Words, the Three Squares Lemma, and Primitive Squares | 2022-12-22 | Paper |
| Longest Square Subsequence Problem Revisited | 2022-12-22 | Paper |
| Towards Efficient Interactive Computation of Dynamic Time Warping Distance | 2022-12-22 | Paper |
| On Repetitiveness Measures of Thue-Morse Words | 2022-12-22 | Paper |
| Order-preserving pattern matching indeterminate strings | 2022-12-08 | Paper |
| Parameterized DAWGs: efficient constructions and bidirectional pattern searches | 2022-09-27 | Paper |
| Computing longest (common) Lyndon subsequences | 2022-08-30 | Paper |
| Combinatorics of minimal absent words for a sliding window | 2022-08-10 | Paper |
| Finding all maximal perfect haplotype blocks in linear time | 2022-07-27 | Paper |
| Computing runs on a trie | 2022-07-18 | Paper |
| Faster queries for longest substring palindrome after block edit | 2022-07-18 | Paper |
| Indexing the bijective BWT | 2022-07-18 | Paper |
| On the size of overlapping Lempel-Ziv and Lyndon factorizations | 2022-07-18 | Paper |
| Longest common rollercoasters | 2022-06-15 | Paper |
| Grammar index by induced suffix sorting | 2022-06-15 | Paper |
| A separation of \(\gamma\) and \(b\) via Thue-Morse words | 2022-06-15 | Paper |
| c-trie++: a dynamic trie tailored for fast prefix searches | 2022-06-08 | Paper |
| Factorizing strings into repetitions | 2022-05-09 | Paper |
| Computing minimal unique substrings for a sliding window | 2022-03-22 | Paper |
| Palindromic trees for a sliding window and its applications | 2021-10-19 | Paper |
| Efficiently computing runs on a trie | 2021-09-27 | Paper |
| Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings | 2021-06-11 | Paper |
| Combinatorics of minimal absent words for a sliding window | 2021-05-18 | Paper |
| A Separation of $\gamma$ and $b$ via Thue--Morse Words | 2021-04-19 | Paper |
| Longest previous overlapping factor array | 2021-03-11 | Paper |
| The Smallest Grammar Problem Revisited | 2021-02-22 | Paper |
| Order Preserving Pattern Matching on Trees and DAGs | 2021-02-16 | Paper |
| Computing longest palindromic substring after single-character or block-wise edits | 2021-02-15 | Paper |
| Lyndon factorization of grammar compressed texts revisited | 2020-12-16 | Paper |
| Online LZ77 Parsing and Matching Statistics with RLBWTs | 2020-12-16 | Paper |
| Faster Online Elastic Degenerate String Matching | 2020-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140763 | 2020-12-16 | Paper |
| Longest substring palindrome after edit | 2020-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140779 | 2020-12-16 | Paper |
| Longest Lyndon Substring After Edit | 2020-12-16 | Paper |
| Almost linear time computation of maximal repetitions in run length encoded strings | 2020-11-25 | Paper |
| Space-efficient algorithms for computing minimal/shortest unique substrings | 2020-10-22 | Paper |
| Faster STR-EC-LCS Computation | 2020-07-20 | Paper |
| Minimal Unique Substrings and Minimal Absent Words in a Sliding Window | 2020-07-20 | Paper |
| Small-space LCE data structure with constant-time queries | 2020-05-26 | Paper |
| Faster STR-IC-LCS Computation via RLE | 2020-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110887 | 2020-05-25 | Paper |
| Tight bounds on the maximum number of shortest unique substrings | 2020-05-25 | Paper |
| Shortest unique palindromic substring queries on run-length encoded strings | 2020-02-25 | Paper |
| Refining the \(r\)-index | 2020-02-20 | Paper |
| Dynamic index and LZ factorization in compressed space | 2020-02-14 | Paper |
| The parameterized position heap of a trie | 2020-02-06 | Paper |
| On the size of the smallest alphabet for Lyndon trees | 2019-10-07 | Paper |
| Algorithms and combinatorial properties on shortest unique palindromic substrings | 2019-01-18 | Paper |
| Linear-time text compression by longest-first substitution | 2018-08-20 | Paper |
| Shortest unique palindromic substring queries in optimal time | 2018-06-15 | Paper |
| Computing abelian string regularities based on RLE | 2018-06-15 | Paper |
| Diverse Palindromic Factorization is NP-Complete | 2018-05-15 | Paper |
| Fully Dynamic Data Structure for LCE Queries in Compressed Space | 2018-03-21 | Paper |
| Shortest Unique Substring Queries on Run-Length Encoded Strings | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608599 | 2018-03-21 | Paper |
| Factorizing a String into Squares in Linear Time | 2017-10-17 | Paper |
| Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction | 2017-10-17 | Paper |
| Efficient computation of substring equivalence classes with suffix arrays | 2017-10-10 | Paper |
| A new characterization of maximal repetitions by Lyndon trees | 2017-10-05 | Paper |
| The “Runs” Theorem | 2017-09-25 | Paper |
| Inferring strings from Lyndon factorization | 2017-09-07 | Paper |
| Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings | 2017-04-04 | Paper |
| Faster Compact On-Line Lempel-Ziv Factorization | 2017-03-03 | Paper |
| Faster Lyndon factorization algorithms for SLP and LZ78 compressed text | 2017-02-06 | Paper |
| Generalized pattern matching and periodicity under substring consistent equivalence relations | 2017-02-06 | Paper |
| Finding Gapped Palindromes Online | 2016-09-29 | Paper |
| Closed factorization | 2016-09-12 | Paper |
| Inferring Strings from Full Abelian Periods | 2016-01-11 | Paper |
| Diverse Palindromic Factorization Is NP-complete | 2015-11-10 | Paper |
| A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String | 2015-10-02 | Paper |
| Inferring strings from suffix trees and links on a binary alphabet | 2015-09-22 | Paper |
| An Opportunistic Text Indexing Structure Based on Run Length Encoding | 2015-09-21 | Paper |
| Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree | 2015-08-20 | Paper |
| LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding | 2015-08-20 | Paper |
| Constructing LZ78 tries and position heaps in linear time for large alphabets | 2015-06-02 | Paper |
| Compressed automata for dictionary matching | 2015-05-18 | Paper |
| Detecting regularities on grammar-compressed strings | 2015-01-30 | Paper |
| Shortest Unique Substrings Queries in Optimal Time | 2015-01-13 | Paper |
| Permuted Pattern Matching on Multi-track Strings | 2014-11-04 | Paper |
| Inferring Strings from Lyndon Factorization | 2014-10-14 | Paper |
| Computing Palindromic Factorizations and Palindromic Covers On-line | 2014-06-30 | Paper |
| On the existence of tight relative 2-designs on binary Hamming association schemes | 2013-12-03 | Paper |
| Detecting Regularities on Grammar-Compressed Strings | 2013-09-20 | Paper |
| Compressed Automata for Dictionary Matching | 2013-08-07 | Paper |
| Fast \(q\)-gram mining on SLP compressed strings | 2013-06-24 | Paper |
| Efficient Lyndon Factorization of Grammar Compressed Text | 2013-06-14 | Paper |
| Converting SLP to LZ78 in almost Linear Time | 2013-06-14 | Paper |
| Efficient LZ78 Factorization of Grammar Compressed Text | 2013-04-08 | Paper |
| An efficient algorithm to test square-freeness of strings compressed by straight-line programs | 2012-10-23 | Paper |
| Finding characteristic substrings from compressed texts | 2012-08-30 | Paper |
| Speeding Up q-Gram Mining on Grammar-Based Compressed Texts | 2012-08-14 | Paper |
| Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts | 2012-06-15 | Paper |
| Verifying and enumerating parameterized border arrays | 2011-12-07 | Paper |
| Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts | 2011-06-29 | Paper |
| Verifying a Parameterized Border Array in O(n 1.5) Time | 2010-07-26 | Paper |
| Lightweight Parameterized Suffix Array Construction | 2009-12-11 | Paper |
| A Series of Run-Rich Strings | 2009-04-02 | Paper |
| Counting Parameterized Border Arrays for a Binary Alphabet | 2009-04-02 | Paper |
| Algorithms for String Pattern Discovery | 2009-02-17 | Paper |
| REACHABILITY ON SUFFIX TREE GRAPHS | 2008-11-03 | Paper |
| Uniqueness of certain association schemes | 2008-07-11 | Paper |
| Efficient Computation of Substring Equivalence Classes with Suffix Arrays | 2008-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5456781 | 2008-04-14 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| On the complexity of deriving position specific score matrices from positive and negative sequences | 2007-04-18 | Paper |
| Discovery Science | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044542 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737698 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736019 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452128 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420643 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409168 | 2003-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708582 | 2003-06-18 | Paper |
| Fast algorithm for extracting multiple unordered short motifs using bit operations | 2003-02-11 | Paper |
