The following pages link to Esko Ukkonen (Q294883):
Displaying 50 items.
- Online timestamped text indexing (Q294884) (← links)
- Motif matching using gapped patterns (Q401471) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Bideterministic automata and minimal representations of regular languages (Q703504) (← links)
- Maximal and minimal representations of gapped and non-gapped motifs of a string (Q732024) (← links)
- Lower bounds on the size of deterministic parsers (Q792100) (← links)
- On size reduction techniques for multitape automata (Q860868) (← links)
- A linear-time algorithm for finding approximate shortest common superstrings (Q911299) (← links)
- Fast profile matching algorithms - A survey (Q932308) (← links)
- On the complexity of finding gapped motifs (Q972352) (← links)
- Exponential lower bounds for some NP-complete problems in a restricted linear decision tree model (Q1050255) (← links)
- Upper bounds on the size of LR(k) parsers (Q1062769) (← links)
- A greedy approximation algorithm for constructing shortest common superstrings (Q1102756) (← links)
- A method for transforming grammars into LL(k) form (Q1134533) (← links)
- The shortest common supersequence problem over binary alphabet is NP- complete (Q1157167) (← links)
- Structure preserving elimination of null productions from context-free grammars (Q1162160) (← links)
- Unifications, deunifications, and their complexity (Q1173920) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- The nonexistence of some covering context-free grammars (Q1257345) (← links)
- Finding lowest common ancestors in arbitrarily directed trees (Q1330662) (← links)
- On the equivalence problem for E-pattern languages (Q1389770) (← links)
- Design and implementation of a string database query language. (Q1400615) (← links)
- Approximate matching of run-length compressed strings (Q1402213) (← links)
- Reasoning about strings in databases (Q1807679) (← links)
- Approximate string matching on Ziv--Lempel compressed text (Q1827277) (← links)
- On-line construction of suffix trees (Q1897476) (← links)
- Efficient construction of maximal and minimal representations of motifs of a string (Q2271439) (← links)
- Longest common substrings with \(k\) mismatches (Q2345877) (← links)
- The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion (Q2489961) (← links)
- Sequential and indexed two-dimensional combinatorial template matching allowing rotations (Q2576875) (← links)
- (Q2721964) (← links)
- (Q2723951) (← links)
- The exact path length problem. (Q2777605) (← links)
- Motif Matching Using Gapped Patterns (Q2870056) (← links)
- (Q3075205) (← links)
- (Q3128935) (← links)
- Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets (Q3314997) (← links)
- (Q3315039) (← links)
- Structural Analysis of Gapped Motifs of a String (Q3525611) (← links)
- Bideterministic Automata and Minimal Representations of Regular Languages (Q3559792) (← links)
- The Complexity of LALR <i>(k)</i> Testing (Q3657462) (← links)
- Finding approximate patterns in strings (Q3681960) (← links)
- Algorithms for approximate string matching (Q3694730) (← links)
- (Q3730015) (← links)
- (Q3796783) (← links)
- (Q3885228) (← links)
- (Q3886900) (← links)
- (Q3912059) (← links)
- Minimizing the Number of Evaluation Passes for Attribute Grammars (Q3922195) (← links)
- On the calculation of the effects of roundoff errors (Q3930543) (← links)
