The subtree max gap problem with application to parallel string covering
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Periods and Quasiperiods Characterization
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Approximate Periods of Strings
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
String pattern matching for a deluge survival kit
Handbook of massive data sets
String regularities with don't cares
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Quasiperiodic Sturmian words and morphisms
Theoretical Computer Science
An extension of the periodicity lemma to longer periods
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
Computing the λ-covers of a string
Information Sciences: an International Journal
Algorithms for Computing the λ-regularities in Strings
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Discovering regularities in biosequences: Challenges and applications
Journal of Computational Methods in Sciences and Engineering
Generalized approximate regularities in strings
International Journal of Computer Mathematics
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science
An extension of the periodicity lemma to longer periods
Discrete Applied Mathematics
Optimality of some algorithms to detect quasiperiodicities
Theoretical Computer Science
New complexity results for the k-covers problem
Information Sciences: an International Journal
A linear time algorithm for seeds computation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Computing the λ-seeds of a string
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Computing the minimum approximate λ-cover of a string
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
The set of parameterized k-covers problem
Theoretical Computer Science
Algorithms for Computing the λ-regularities in Strings
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Computing regularities in strings: A survey
European Journal of Combinatorics
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
On left and right seeds of a string
Journal of Discrete Algorithms
Efficient seed computation revisited
Theoretical Computer Science
Theoretical Computer Science
| Hi-index | 0.90 |