Approximate Periods of Strings
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
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
A language-theoretic approach to covering problems
Journal of Automata, Languages and Combinatorics
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
Covering problems from a formal language point of view
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Optimality of some algorithms to detect quasiperiodicities
Theoretical Computer Science
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
On left and right seeds of a string
Journal of Discrete Algorithms
Theoretical Computer Science
Hi-index | 0.89 |