| Publication | Date of Publication | Type |
|---|
| Linear-size suffix tries and linear-size CDAWGs simplified and improved | 2024-11-07 | Paper |
| Linear time online algorithms for constructing linear-size suffix trie | 2024-10-07 | Paper |
| Computing palindromes on a trie in linear time | 2024-09-11 | Paper |
| Faster space-efficient STR-IC-LCS computation | 2024-06-04 | Paper |
| Optimally computing compressed indexing arrays based on the compact directed acyclic word graph | 2024-05-29 | Paper |
| Largest repetition factorization of Fibonacci words | 2024-05-29 | Paper |
| Linear-time computation of generalized minimal absent words for multiple strings | 2024-05-29 | Paper |
| Cartesian tree subsequence matching | 2024-05-06 | Paper |
| Minimal absent words on run-length encoded strings | 2024-05-06 | 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 |
| Bit catastrophes for the Burrows-Wheeler transform | 2023-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065395 | 2023-11-14 | 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 |
| On Sensitivity of Compact Directed Acyclic Word Graphs | 2023-07-25 | Paper |
| The parameterized suffix tray | 2023-03-22 | Paper |
| Sensitivity of string compressors and repetitiveness measures | 2023-03-07 | 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 |
| 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 |
| Suffix trees, DAWGs and CDAWGs for forward and backward tries | 2022-10-13 | Paper |
| Parameterized DAWGs: efficient constructions and bidirectional pattern searches | 2022-09-27 | Paper |
| A faster reduction of the dynamic time warping distance to the longest increasing subsequence length | 2022-08-18 | Paper |
| Combinatorics of minimal absent words for a sliding window | 2022-08-10 | Paper |
| On the size of overlapping Lempel-Ziv and Lyndon factorizations | 2022-07-18 | Paper |
| Online algorithms for constructing linear-size suffix trie | 2022-07-18 | Paper |
| Computing runs on a trie | 2022-07-18 | Paper |
| Faster queries for longest substring palindrome after block edit | 2022-07-18 | Paper |
| On the approximation ratio of LZ-end to LZ77 | 2022-06-15 | Paper |
| Longest common rollercoasters | 2022-06-15 | Paper |
| Grammar index by induced suffix sorting | 2022-06-15 | Paper |
| Position heaps for Cartesian-tree matching on strings and tries | 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 |
| Novel results on the number of runs of the Burrows-Wheeler-transform | 2022-03-24 | Paper |
| Computing minimal unique substrings for a sliding window | 2022-03-22 | Paper |
| RePair Grammars are the Smallest Grammars for Fibonacci Words | 2022-02-16 | 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 |
| Counting Lyndon Subsequences | 2021-06-02 | Paper |
| Combinatorics of minimal absent words for a sliding window | 2021-05-18 | 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 |
| On two LZ78-style grammars: compression bounds and compressed-space computation | 2021-02-16 | Paper |
| Linear-size CDAWG: new repetition-aware indexing and grammar compression | 2021-02-16 | Paper |
| Computing longest palindromic substring after single-character or block-wise edits | 2021-02-15 | Paper |
| Longest substring palindrome after edit | 2020-12-16 | Paper |
| Computing longest common square subsequences | 2020-12-16 | Paper |
| Longest Lyndon Substring After Edit | 2020-12-16 | Paper |
| Lyndon factorization of grammar compressed texts revisited | 2020-12-16 | Paper |
| Faster Online Elastic Degenerate String Matching | 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 |
| Computing all distinct squares in linear time for integer alphabets | 2020-05-25 | Paper |
| Tight bounds on the maximum number of shortest unique substrings | 2020-05-25 | Paper |
| Fully-online suffix tree and directed acyclic word graph construction for multiple texts | 2020-04-01 | Paper |
| Shortest unique palindromic substring queries on run-length encoded strings | 2020-02-25 | Paper |
| Efficient computation of longest single-arm-gapped palindromes in a string | 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 |
| Efficient dynamic dictionary matching with DAWGs and AC-automata | 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 |
| Dynamic RLE-compressed edit distance tables under general weighted cost functions | 2018-07-24 | 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 |
| Computing DAWGs and minimal absent words in linear time for integer alphabets | 2018-03-21 | Paper |
| Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets | 2018-03-01 | Paper |
| Efficiently finding all maximal \(\alpha\)-gapped repeats | 2018-01-24 | Paper |
| A hardness result and new algorithm for the longest common palindromic subsequence problem | 2017-10-18 | Paper |
| Fully-online Construction of Suffix Trees for Multiple Texts. | 2017-10-17 | Paper |
| Deterministic sub-linear space LCE data structures with efficient construction | 2017-10-17 | Paper |
| Factorizing a String into Squares in Linear Time | 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 |
| Computing longest single-arm-gapped palindromes in a string | 2017-04-04 | 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 |
| Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing | 2016-09-29 | Paper |
| Closed factorization | 2016-09-12 | Paper |
| Compacting a dynamic edit distance table by RLE compression | 2016-03-10 | 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 |
| Dynamic edit distance table under a general weighted cost function | 2015-08-24 | Paper |
| LZD factorization: simple and practical online grammar compression with variable-to-fixed encoding | 2015-08-20 | Paper |
| Semi-dynamic compact index for short patterns and succinct van Emde Boas tree | 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 |
| An efficient algorithm to test square-freeness of strings compressed by balanced straight line programs | 2014-05-06 | Paper |
| Palindrome pattern matching | 2014-01-09 | 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 |
| Missing pattern discovery | 2011-07-29 | Paper |
| Palindrome pattern matching | 2011-06-29 | 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 |
| Ternary directed acyclic word graphs | 2010-05-07 | Paper |
| Linear-time off-line text compression by longest-first substitution. | 2010-02-09 | Paper |
| Dynamic edit distance table under a general weighted cost function | 2010-01-28 | Paper |
| Lightweight parameterized suffix array construction | 2009-12-11 | Paper |
| Counting Parameterized Border Arrays for a Binary Alphabet | 2009-04-02 | Paper |
| Efficient algorithms to compute compressed longest common substrings and compressed palindromes | 2009-03-17 | Paper |
| REACHABILITY ON SUFFIX TREE GRAPHS | 2008-11-03 | Paper |
| Efficient Computation of Substring Equivalence Classes with Suffix Arrays | 2008-06-17 | Paper |
| Computing Longest Common Substring and All Palindromes from Compressed Strings | 2008-03-07 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| On-Line Linear-Time Construction of Word Suffix Trees | 2007-09-14 | Paper |
| Compact directed acyclic word graphs for a sliding window | 2007-04-26 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS | 2005-12-15 | Paper |
| Discovery Science | 2005-08-18 | Paper |
| On-line construction of compact directed acyclic word graphs | 2005-02-22 | Paper |
| Ternary directed acyclic word graphs | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737697 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044513 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736067 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4454542 | 2004-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4454549 | 2004-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420643 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708582 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547748 | 2002-08-21 | Paper |
