Compact recognizers of episode sequences
Information and Computation
Efficient Computation of All Longest Common Subsequences
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On the Size of DASG for Multiple Texts
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Factor Oracle: A New Structure for Pattern Matching
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Discovering Best Variable-Length-Don't-Care Patterns
DS '02 Proceedings of the 5th International Conference on Discovery Science
Finding Best Patterns Practically
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Efficient Experimental String Matching by Weak Factor Recognition
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
The Minimum DAWG for All Suffixes of a String and Its Applications
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
A Practical Algorithm to Find the Best Subsequence Patterns
DS '00 Proceedings of the Third International Conference on Discovery Science
A Practical Algorithm to Find the Best Episode Patterns
DS '01 Proceedings of the 4th International Conference on Discovery Science
A practical algorithm to find the best subsequence patterns
Theoretical Computer Science
Directed acyclic subsequence graph: overview
Journal of Discrete Algorithms
Episode directed acyclic subsequence graph
Nordic Journal of Computing
The size of subsequence automaton
Theoretical Computer Science
Fast and compact regular expression matching
Theoretical Computer Science
Counting Parameterized Border Arrays for a Binary Alphabet
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Matching subsequences in trees
Journal of Discrete Algorithms
Longest common subsequence as private search
Proceedings of the 8th ACM workshop on Privacy in the electronic society
Finite automata based algorithms on subsequences and supersequences of degenerate strings
Journal of Discrete Algorithms
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
On trace inclusion optimization problems
Cybernetics and Systems Analysis
Finite automata based algorithms for the generalized constrained longest common subsequence problems
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Journal of Discrete Algorithms
Faster subsequence and don't-care pattern matching on compressed texts
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Verifying and enumerating parameterized border arrays
Theoretical Computer Science
Matching subsequences in trees
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Composite pattern discovery for PCR application
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Quadratic-time algorithm for a string constrained LCS problem
Information Processing Letters
| Hi-index | 5.23 |