| Publication | Date of Publication | Type |
|---|
Sparse suffix trees
Lecture Notes in Computer Science | 2024-01-29 | Paper |
| Discovering unbounded unions of regular pattern languages from positive examples | 2023-01-25 | Paper |
Boyer-Moore approach to approximate string matching
SWAT 90 | 2022-12-09 | Paper |
| Seed-driven learning of position probability matrices from large sequence sets | 2020-05-27 | Paper |
Online timestamped text indexing
Information Processing Letters | 2016-06-16 | Paper |
Longest common substrings with k mismatches
Information Processing Letters | 2015-05-21 | Paper |
Motif matching using gapped patterns
Theoretical Computer Science | 2014-08-27 | Paper |
Motif matching using gapped patterns
Lecture Notes in Computer Science | 2014-01-17 | Paper |
| Geometric point pattern matching in the Knuth-Morris-Pratt way | 2011-02-10 | Paper |
On the complexity of finding gapped motifs
Journal of Discrete Algorithms | 2010-05-25 | Paper |
Bideterministic Automata and Minimal Representations of Regular Languages
Implementation and Application of Automata | 2010-05-07 | Paper |
Maximal and minimal representations of gapped and non-gapped motifs of a string
Theoretical Computer Science | 2009-10-09 | Paper |
Efficient construction of maximal and minimal representations of motifs of a string
Theoretical Computer Science | 2009-08-07 | Paper |
Structural Analysis of Gapped Motifs of a String
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Fast profile matching algorithms - A survey
Theoretical Computer Science | 2008-07-10 | Paper |
| An MDL method for finding haplotype blocks and for estimating the strenght of haplotype block boundaries | 2008-04-14 | Paper |
On size reduction techniques for multitape automata
Theoretical Computer Science | 2007-01-09 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion
Discrete Applied Mathematics | 2006-04-28 | Paper |
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
Theoretical Computer Science | 2005-12-29 | Paper |
Computational Science - ICCS 2004
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Transposition invariant string matching
Journal of Algorithms | 2005-09-28 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Theory Is Forever
Lecture Notes in Computer Science | 2005-01-18 | Paper |
Bideterministic automata and minimal representations of regular languages
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2087048 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087057 (Why is no real title available?) | 2004-08-11 | Paper |
Approximate string matching on Ziv--Lempel compressed text
Journal of Discrete Algorithms | 2004-08-06 | Paper |
Approximate matching of run-length compressed strings
Algorithmica | 2003-08-19 | Paper |
Design and implementation of a string database query language.
Information Systems | 2003-08-13 | Paper |
| scientific article; zbMATH DE number 1962813 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1951569 (Why is no real title available?) | 2003-07-21 | Paper |
| scientific article; zbMATH DE number 1950551 (Why is no real title available?) | 2003-07-17 | Paper |
| scientific article; zbMATH DE number 1945170 (Why is no real title available?) | 2003-07-02 | Paper |
| scientific article; zbMATH DE number 1839479 (Why is no real title available?) | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1759461 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1786446 (Why is no real title available?) | 2002-08-21 | Paper |
The exact path length problem.
Journal of Algorithms | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1617244 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1615281 (Why is no real title available?) | 2001-07-08 | Paper |
Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
SIAM Journal on Computing | 2000-03-19 | Paper |
Reasoning about strings in databases
Journal of Computer and System Sciences | 1999-11-23 | Paper |
On the equivalence problem for E-pattern languages
Theoretical Computer Science | 1998-06-30 | Paper |
| scientific article; zbMATH DE number 1003305 (Why is no real title available?) | 1997-10-05 | Paper |
| scientific article; zbMATH DE number 826062 (Why is no real title available?) | 1995-12-13 | Paper |
On-line construction of suffix trees
Algorithmica | 1995-08-27 | Paper |
Finding lowest common ancestors in arbitrarily directed trees
Information Processing Letters | 1995-04-04 | Paper |
Approximate string matching with suffix automata
Algorithmica | 1994-01-19 | Paper |
| scientific article; zbMATH DE number 176144 (Why is no real title available?) | 1993-05-18 | Paper |
Approximate Boyer–Moore String Matching
SIAM Journal on Computing | 1993-05-17 | Paper |
Approximate string-matching with q-grams and maximal matches
Theoretical Computer Science | 1992-09-26 | Paper |
Unifications, deunifications, and their complexity
BIT | 1992-06-25 | Paper |
A linear-time algorithm for finding approximate shortest common superstrings
Algorithmica | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4062625 (Why is no real title available?) | 1988-01-01 | Paper |
A greedy approximation algorithm for constructing shortest common superstrings
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3995082 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3960991 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3999290 (Why is no real title available?) | 1986-01-01 | Paper |
Algorithms for approximate string matching
Information and Control | 1985-01-01 | Paper |
Finding approximate patterns in strings
Journal of Algorithms | 1985-01-01 | Paper |
Upper bounds on the size of LR(k) parsers
Information Processing Letters | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3845091 (Why is no real title available?) | 1983-01-01 | Paper |
Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets
SIAM Journal on Computing | 1983-01-01 | Paper |
Lower bounds on the size of deterministic parsers
Journal of Computer and System Sciences | 1983-01-01 | Paper |
The Complexity of LALR <i>(k)</i> Testing
Journal of the ACM | 1983-01-01 | Paper |
Exponential lower bounds for some NP-complete problems in a restricted linear decision tree model
BIT | 1983-01-01 | Paper |
The equivalence problem for some non-real-time deterministic pushdown automata
Journal of the ACM | 1982-01-01 | Paper |
Structure preserving elimination of null productions from context-free grammars
Theoretical Computer Science | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3723900 (Why is no real title available?) | 1981-01-01 | Paper |
The shortest common supersequence problem over binary alphabet is NP- complete
Theoretical Computer Science | 1981-01-01 | Paper |
On the calculation of the effects of roundoff errors
ACM Transactions on Mathematical Software | 1981-01-01 | Paper |
Minimizing the Number of Evaluation Passes for Attribute Grammars
SIAM Journal on Computing | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3690741 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3692689 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3622973 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3628418 (Why is no real title available?) | 1979-01-01 | Paper |
A method for transforming grammars into LL(k) form
Acta Informatica | 1979-01-01 | Paper |
The nonexistence of some covering context-free grammars
Information Processing Letters | 1979-01-01 | Paper |
An analysis of the effect of rounding errors on the flow of control in numerical processes
BIT | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3602700 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3564359 (Why is no real title available?) | 1976-01-01 | Paper |
