| Publication | Date of Publication | Type |
|---|
| Elastic-degenerate string matching with 1 error or mismatch | 2024-11-12 | Paper |
| Comparing elastic-degenerate strings: algorithms, lower bounds, and applications | 2024-10-21 | Paper |
| Suffix-prefix queries on a dictionary | 2024-10-21 | Paper |
| Sparse suffix and LCP array: simple, direct, small, and fast | 2024-05-31 | Paper |
| Pattern masking for dictionary matching: theory and practice | 2024-05-30 | Paper |
| Frequency-constrained substring complexity | 2024-05-29 | Paper |
| Making de Bruijn graphs Eulerian | 2024-05-06 | Paper |
| On strings having the same length-\(k\) substrings | 2024-05-06 | Paper |
| Longest palindromic substring in sublinear time | 2024-05-06 | Paper |
| Weighted shortest common supersequence problem revisited | 2024-04-19 | Paper |
| Range shortest unique substring queries | 2024-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187833 | 2024-01-15 | Paper |
| Maximal degenerate palindromes with gaps and mismatches | 2023-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075918 | 2023-09-20 | Paper |
| Bidirectional String Anchors: A New String Sampling Mechanism | 2023-09-20 | Paper |
| Subsequence covers of words | 2023-08-04 | Paper |
| On extended special factors of a word | 2023-07-28 | Paper |
| Efficient computation of sequence mappability | 2023-07-28 | Paper |
| Longest common prefixes with \(k\)-errors and applications | 2023-07-28 | Paper |
| Longest property-preserved common factor | 2023-07-28 | Paper |
| Maximal motif discovery in a sliding window | 2023-07-28 | Paper |
| Elastic-degenerate string matching with 1 error | 2023-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098776 | 2023-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098779 | 2023-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098790 | 2023-06-14 | Paper |
| Property Suffix Array with Applications in Indexing Weighted Sequences | 2023-05-23 | Paper |
| Unary Words Have the Smallest Levenshtein k-Neighbourhoods | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874433 | 2023-02-07 | Paper |
| Reverse-Safe Text Indexing | 2022-09-06 | Paper |
| All-pairs suffix/prefix in optimal time using Aho-Corasick space | 2022-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091065 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091170 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090361 | 2022-07-18 | Paper |
| Internal shortest absent word queries in constant time and linear space | 2022-06-13 | Paper |
| Elastic-Degenerate String Matching via Fast Matrix Multiplication | 2022-06-08 | Paper |
| Beyond the BEST theorem: fast assessment of Eulerian trails | 2022-05-20 | Paper |
| Longest common substring made fully dynamic | 2022-05-11 | Paper |
| Efficient computation of sequence mappability | 2022-05-03 | Paper |
| Constructing antidictionaries of long texts in output-sensitive space | 2021-08-05 | Paper |
| Efficient pattern matching in elastic-degenerate strings | 2021-07-21 | Paper |
| Comparing Degenerate Strings | 2021-05-20 | Paper |
| Efficient Identification of k-Closed Strings | 2021-04-19 | Paper |
| Longest Common Factor After One Edit Operation | 2021-02-16 | Paper |
| Pattern Matching on Elastic-Degenerate Text with Errors | 2021-02-16 | Paper |
| Reverse-Safe Data Structures for Text Indexing | 2021-01-27 | Paper |
| Influence maximization in the presence of vulnerable nodes: a ratio perspective | 2021-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140726 | 2020-12-16 | Paper |
| Linear-Time Algorithm for Long LCF with k Mismatches | 2020-12-16 | Paper |
| Dynamic and internal longest common substring | 2020-11-11 | Paper |
| Circular pattern matching with \(k\) mismatches | 2020-10-23 | Paper |
| Longest Common Prefixes with k-Mismatches and Applications | 2020-10-21 | Paper |
| Searching and Indexing Circular Patterns | 2020-08-07 | Paper |
| Optimal Computation of Overabundant Words | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111799 | 2020-05-27 | Paper |
| On-line pattern matching on similar texts | 2020-05-25 | Paper |
| Approximate pattern matching on elastic-degenerate text | 2020-02-20 | Paper |
| Faster algorithms for 1-mappability of a sequence | 2020-02-20 | Paper |
| Longest property-preserved common factor: a new string-processing framework | 2020-02-20 | Paper |
| Property suffix array with applications | 2020-02-12 | Paper |
| Circular pattern matching with \(k\) mismatches | 2020-01-30 | Paper |
| Indexing weighted sequences: neat and efficient | 2020-01-17 | Paper |
| Absent words in a sliding window with applications | 2020-01-17 | Paper |
| Creating improvisations on chord progressions using suffix trees | 2020-01-07 | Paper |
| On overabundant words and their application to biological sequence analysis | 2019-10-07 | Paper |
| Pattern matching and consensus problems on weighted sequences and profiles | 2019-06-27 | Paper |
| Fast Average-Case Pattern Matching on Weighted Sequences | 2019-06-24 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2019-06-06 | Paper |
| On-line weighted pattern matching | 2019-05-02 | Paper |
| Near-optimal computation of runs over general alphabet via non-crossing LCE queries | 2018-10-17 | Paper |
| Alignment-free sequence comparison using absent words | 2018-09-27 | Paper |
| How to answer a small batch of RMQs or LCA queries in practice | 2018-06-15 | Paper |
| Pattern Matching and Consensus Problems on Weighted Sequences and Profiles | 2018-04-19 | Paper |
| Crochemore's partitioning on weighted strings and applications | 2018-04-06 | Paper |
| Faster algorithms for 1-mappability of a sequence | 2018-03-26 | Paper |
| Optimal computation of avoided words | 2018-03-23 | Paper |
| Efficient algorithms for shortest partial seeds in words | 2018-02-16 | Paper |
| Minimal absent words in a sliding window and applications to on-line pattern matching | 2017-11-22 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2017-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369536 | 2017-10-17 | Paper |
| Circular Sequence Comparison with q-grams | 2017-07-25 | Paper |
| Efficient pattern matching in elastic-degenerate strings | 2017-06-01 | Paper |
| Fast circular dictionary-matching algorithm | 2017-04-04 | Paper |
| Linear-time computation of prefix table for weighted strings {\&} applications | 2017-02-06 | Paper |
| On-Line Pattern Matching on Uncertain Sequences and Applications | 2017-02-01 | Paper |
| An optimal algorithm for computing all subtree repeats in trees | 2017-01-13 | Paper |
| Order-preserving indexing | 2016-06-16 | Paper |
| Linear-Time Sequence Comparison Using Minimal Absent Words & Applications | 2016-05-03 | Paper |
| Average-Case Optimal Approximate Circular String Matching | 2016-04-08 | Paper |
| Linear-time superbubble identification algorithm for genome assembly | 2015-12-08 | Paper |
| Linear-Time Computation of Prefix Table for Weighted Strings | 2015-11-04 | Paper |
| Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment | 2015-09-30 | Paper |
| Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance | 2015-09-15 | Paper |
| Fast algorithm for partial covers in words | 2015-09-03 | Paper |
| Global and local sequence alignment with a bounded number of gaps | 2015-04-29 | Paper |
| Tree template matching in unranked ordered trees | 2014-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5169578 | 2014-07-10 | Paper |
| Efficient Algorithms for Shortest Partial Seeds in Words | 2014-06-30 | Paper |
| Extending alignments with \(k\)-mismatches and \(\ell\)-gaps | 2014-03-13 | Paper |
| An Optimal Algorithm for Computing All Subtree Repeats in Trees | 2014-01-17 | Paper |
| Enhanced string covering | 2014-01-16 | Paper |
| Efficient seed computation revisited | 2014-01-09 | Paper |
| Tree template matching in ranked ordered trees by pushdown automata | 2013-06-24 | Paper |
| On left and right seeds of a string | 2013-06-24 | Paper |
| Fast Algorithm for Partial Covers in Words | 2013-06-14 | Paper |
| Computing all subtree repeats in ordered trees | 2013-03-21 | Paper |
| Parallel algorithms for mapping short degenerate and weighted DNA sequences to a reference genome | 2012-08-30 | Paper |
| An algorithm for mapping short reads to a dynamically changing genomic sequence | 2012-05-11 | Paper |
| On the Right-Seed Array of a String | 2011-08-17 | Paper |
| Tree Template Matching in Ranked Ordered Trees by Pushdown Automata | 2011-07-29 | Paper |
| Efficient Seeds Computation Revisited | 2011-06-29 | Paper |
| Cover Array String Reconstruction | 2010-07-26 | Paper |
| A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches | 2010-05-04 | Paper |
