| Publication | Date of Publication | Type |
|---|
| Sparse suffix trees | 2024-01-29 | Paper |
| Boyer-Moore approach to approximate string matching | 2022-12-09 | Paper |
| Seed-driven Learning of Position Probability Matrices from Large Sequence Sets. | 2020-05-27 | Paper |
| Online timestamped text indexing | 2016-06-16 | Paper |
| Longest common substrings with \(k\) mismatches | 2015-05-21 | Paper |
| Motif matching using gapped patterns | 2014-08-27 | Paper |
| Motif Matching Using Gapped Patterns | 2014-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3075205 | 2011-02-10 | Paper |
| On the complexity of finding gapped motifs | 2010-05-25 | Paper |
| Bideterministic Automata and Minimal Representations of Regular Languages | 2010-05-07 | Paper |
| Maximal and minimal representations of gapped and non-gapped motifs of a string | 2009-10-09 | Paper |
| Efficient construction of maximal and minimal representations of motifs of a string | 2009-08-07 | Paper |
| Structural Analysis of Gapped Motifs of a String | 2008-09-17 | Paper |
| Fast profile matching algorithms - A survey | 2008-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5456817 | 2008-04-14 | Paper |
| On size reduction techniques for multitape automata | 2007-01-09 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion | 2006-04-28 | Paper |
| Sequential and indexed two-dimensional combinatorial template matching allowing rotations | 2005-12-29 | Paper |
| Computational Science - ICCS 2004 | 2005-12-23 | Paper |
| Transposition invariant string matching | 2005-09-28 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| Bideterministic automata and minimal representations of regular languages | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737694 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737703 | 2004-08-11 | Paper |
| Approximate string matching on Ziv--Lempel compressed text | 2004-08-06 | Paper |
| Approximate matching of run-length compressed strings | 2003-08-19 | Paper |
| Design and implementation of a string database query language. | 2003-08-13 | 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/Q4413212 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410142 | 2003-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782748 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536411 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547735 | 2002-08-21 | Paper |
| The Exact Path Length Problem | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721964 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723951 | 2001-07-08 | Paper |
| Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time | 2000-03-19 | Paper |
| Reasoning about strings in databases | 1999-11-23 | Paper |
| On the equivalence problem for E-pattern languages | 1998-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128935 | 1997-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858448 | 1995-12-13 | Paper |
| On-line construction of suffix trees | 1995-08-27 | Paper |
| Finding lowest common ancestors in arbitrarily directed trees | 1995-04-04 | Paper |
| Approximate string matching with suffix automata | 1994-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035246 | 1993-05-18 | Paper |
| Approximate Boyer–Moore String Matching | 1993-05-17 | Paper |
| Approximate string-matching with \(q\)-grams and maximal matches | 1992-09-26 | Paper |
| Unifications, deunifications, and their complexity | 1992-06-25 | Paper |
| A linear-time algorithm for finding approximate shortest common superstrings | 1990-01-01 | Paper |
| A greedy approximation algorithm for constructing shortest common superstrings | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796783 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3730015 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4721668 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4725747 | 1986-01-01 | Paper |
| Upper bounds on the size of LR(k) parsers | 1985-01-01 | Paper |
| Finding approximate patterns in strings | 1985-01-01 | Paper |
| Algorithms for approximate string matching | 1985-01-01 | Paper |
| Lower bounds on the size of deterministic parsers | 1983-01-01 | Paper |
| Exponential lower bounds for some NP-complete problems in a restricted linear decision tree model | 1983-01-01 | Paper |
| Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3315039 | 1983-01-01 | Paper |
| The Complexity of LALR (k) Testing | 1983-01-01 | Paper |
| Structure preserving elimination of null productions from context-free grammars | 1982-01-01 | Paper |
| The equivalence problem for some non-real-time deterministic pushdown automata | 1982-01-01 | Paper |
| The shortest common supersequence problem over binary alphabet is NP- complete | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912059 | 1981-01-01 | Paper |
| Minimizing the Number of Evaluation Passes for Attribute Grammars | 1981-01-01 | Paper |
| On the calculation of the effects of roundoff errors | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3885228 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3886900 | 1980-01-01 | Paper |
| A method for transforming grammars into LL(k) form | 1979-01-01 | Paper |
| The nonexistence of some covering context-free grammars | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4185829 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190163 | 1979-01-01 | Paper |
| An analysis of the effect of rounding errors on the flow of control in numerical processes | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4168089 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4136590 | 1976-01-01 | Paper |
