Journal of the ACM (JACM)
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The subtree max gap problem with application to parallel string covering
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Fast and flexible string matching by combining bit-parallelism and suffix automata
Journal of Experimental Algorithmics (JEA)
Computing Display Conflicts in String Visualization
IEEE Transactions on Computers
Reducing space for index implementation
Theoretical Computer Science
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
Discovering Best Variable-Length-Don't-Care Patterns
DS '02 Proceedings of the 5th International Conference on Discovery Science
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Indexing Text with Approximate q-Grams
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Simple Optimal String Matching Algorithm
COM '00 Proceedings of the 11th 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 New Indexing Method for Approximate String Matching
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
A Metric Index for Approximate String Matching
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Bidirectional construction of suffix trees
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Compact suffix array: a space-efficient full-text index
Fundamenta Informaticae - Special issue on computing patterns in strings
Finite-state transducers in language and speech processing
Computational Linguistics
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences
Ternary directed acyclic word graphs
Theoretical Computer Science - Implementation and application of automata
Optimal discovery of repetitions in 2D
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
A metric index for approximate string matching
Theoretical Computer Science
The wide window string matching algorithm
Theoretical Computer Science
An efficient algorithm for online square detection
Theoretical Computer Science - Computing and combinatorics
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
The number of runs in a string
Information and Computation
Computing Longest Previous Factor in linear time and applications
Information Processing Letters
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Efficient on-line repetition detection
Theoretical Computer Science
On the Structure of Consistent Partitions of Substring Set of a Word
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A fast algorithm for finding the positions of all squares in a run-length encoded string
Theoretical Computer Science
Combinatorics of Finite Words and Suffix Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
From Nerode's congruence to suffix automata with mismatches
Theoretical Computer Science
General suffix automaton construction algorithm and space bounds
Theoretical Computer Science
General indexation of weighted automata: application to spoken utterance retrieval
SpeechIR '04 Proceedings of the Workshop on Interdisciplinary Approaches to Speech Indexing and Retrieval at HLT-NAACL 2004
Repetitions in strings: Algorithms and combinatorics
Theoretical Computer Science
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Optimal discovery of repetitions in 2D
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics
A faster algorithm for matching a set of patterns with variable length don't cares
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
On the implementation of compact DAWG's
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Ternary directed acyclic word graphs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Suffix automata and standard sturmian words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Factor automata of automata and applications
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Efficient and robust music identification with weighted finite-state transducers
IEEE Transactions on Audio, Speech, and Language Processing
Testing square-freeness of strings compressed by balanced straight line program
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Algorithms and theory of computation handbook
Computing Longest Previous non-overlapping Factors
Information Processing Letters
Theoretical Computer Science
Special factors and the combinatorics of suffix and factor automata
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Hunting redundancies in strings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Reversing longest previous factor tables is hard
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Near real-time suffix tree construction via the fringe marked ancestor problem
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
On suffix extensions in suffix trees
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
On-line construction of position heaps
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
A linear time algorithm for seeds computation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
An optimal algorithm for online square detection
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Online and dynamic recognition of squarefree strings
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms
A general weighted grammar library
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Information Processing Letters
On suffix extensions in suffix trees
Theoretical Computer Science
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Computing lempel-ziv factorization online
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Compact Suffix Array — A Space-Efficient Full-Text Index
Fundamenta Informaticae - Computing Patterns in Strings
A comparison of index-based lempel-Ziv LZ77 factorization algorithms
ACM Computing Surveys (CSUR)
Computing the Longest Previous Factor
European Journal of Combinatorics
Near real-time suffix tree construction via the fringe marked ancestor problem
Journal of Discrete Algorithms
On-line construction of position heaps
Journal of Discrete Algorithms
Text searching allowing for inversions and translocations of factors
Discrete Applied Mathematics
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics
Hi-index | 5.24 |