Introducing efficient parallelism into approximate string matching and a new serial algorithm
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Alphabet independent two dimensional matching
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Two-dimensional periodicity and its applications
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Work-time-optimal parallel algorithms for string problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science
Repetition Complexity of Words
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Generalized Pattern Matching and the Complexity of Unavoidability Testing
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Approximate Periods of Strings
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Finding Approximate Repetitions under Hamming Distance
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On Maximal Repetitions in Words
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
String pattern matching for a deluge survival kit
Handbook of massive data sets
Inplace run-length 2d compressed search
Theoretical Computer Science
Finding Maximal Repetitions in a Word in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Finding approximate repetitions under Hamming distance
Theoretical Computer Science - Logic and complexity in computer science
Speeding up the detection of evolutive tandem repeats
Theoretical Computer Science
Parallel two dimensional witness computation
Information and Computation
Finding approximate tandem repeats in genomic sequences
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Computing all repeats using suffix arrays
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Linear-time computation of local periods
Theoretical Computer Science
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences
Space efficient search for maximal repetitions
Theoretical Computer Science - Combinatorics on words
Optimal discovery of repetitions in 2D
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
FireμSat: meeting the challenge of detecting microsatellites in DNA
SAICSIT '06 Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
An efficient algorithm for online square detection
Theoretical Computer Science - Computing and combinatorics
The number of runs in a string
Information and Computation
Repetitions detection on a linear array with reconfigurable pipelined bus system
International Journal of Parallel, Emergent and Distributed Systems
Discovering regularities in biosequences: Challenges and applications
Journal of Computational Methods in Sciences and Engineering
Towards a Solution to the "Runs" Conjecture
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Efficient on-line repetition detection
Theoretical Computer Science
New Perspectives on the Prefix Array
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Application of the Burrows-Wheeler Transform for searching for tandem repeats in DNA sequences
International Journal of Bioinformatics Research and Applications
A fast algorithm for finding the positions of all squares in a run-length encoded string
Theoretical Computer Science
Practical Algorithms for the Longest Common Extension Problem
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Repetitions in strings: Algorithms and combinatorics
Theoretical Computer Science
Optimal discovery of repetitions in 2D
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Distinct squares in run-length encoded strings
Theoretical Computer Science
Small-space 2D compressed dictionary matching
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
A minimal periods algorithm with applications
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
The longest common extension problem revisited and applications to approximate string searching
Journal of Discrete Algorithms
Algorithms for finding a minimum repetition representation of a string
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
New complexity results for the k-covers problem
Information Sciences: an International Journal
Theoretical Computer Science
Hunting redundancies in strings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Succinct 2D dictionary matching with no slowdown
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
The number of runs in a string: improved analysis of the linear upper bound
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Finding the position of the k-mismatch and approximate tandem repeats
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
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
The three squares lemma revisited
Journal of Discrete Algorithms
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Information Processing Letters
Minimum Unique Substrings and Maximum Repeats
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Time-Space trade-offs for longest common extensions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
On the maximum number of cubic subwords in a word
European Journal of Combinatorics
Computing regularities in strings: A survey
European Journal of Combinatorics
Fast and practical algorithms for computing all the runs in a string
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
More results on overlapping squares
Journal of Discrete Algorithms
Fast algorithms for finding a minimum repetition representation of strings and trees
Discrete Applied Mathematics
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics
Time-space trade-offs for longest common extensions
Journal of Discrete Algorithms
| Hi-index | 0.01 |