A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Parameterized pattern matching by Boyer-Moore-type algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Separable attributes: a technique for solving the sub matrices character count problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Information and Computation
The submatrices character count problem: an efficient solution using separable values
Information and Computation
Efficient parameterized string matching
Information Processing Letters
Approximate parameterized matching
ACM Transactions on Algorithms (TALG)
Finding Clones with Dup: Analysis of an Experiment
IEEE Transactions on Software Engineering
Periodicity and repetitions in parameterized strings
Discrete Applied Mathematics
Fast parameterized matching with q-grams
Journal of Discrete Algorithms
On the Longest Common Parameterized Subsequence
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Note: Pattern matching with pair correlation distance
Theoretical Computer Science
Approximated Pattern Matching with the L1 , L2 and L∞ Metrics
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Pattern Matching with Pair Correlation Distance
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Multi-patterns parameterized shift-and string matching algorithm with super alphabets
Proceedings of the International Conference on Advances in Computing, Communication and Control
Counting Parameterized Border Arrays for a Binary Alphabet
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Parameterized matching on non-linear structures
Information Processing Letters
Online Approximate Matching with Non-local Distances
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
On the longest common parameterized subsequence
Theoretical Computer Science
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Software maintenance by multi-patterns parameterized string matching with q-gram
ACM SIGSOFT Software Engineering Notes
Parameterized string matching: an application to software maintenance
ACM SIGSOFT Software Engineering Notes
Information Processing Letters
Verifying a parameterized border array in O(n1.5) time
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Parameterized searching with mismatches for run-length encoded strings
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Pattern matching in pseudo real-time
Journal of Discrete Algorithms
Verifying and enumerating parameterized border arrays
Theoretical Computer Science
Sublinear algorithms for parameterized matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Two dimensional parameterized matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
The set of parameterized k-covers problem
Theoretical Computer Science
Parameterized longest previous factor
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
p-Suffix sorting as arithmetic coding
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Parameterized longest previous factor
Theoretical Computer Science
Variations of the parameterized longest previous factor
Journal of Discrete Algorithms
p-Suffix sorting as arithmetic coding
Journal of Discrete Algorithms
Parameterized searching with mismatches for run-length encoded strings
Theoretical Computer Science
Approximate function matching under δ- and γ- distances
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Journal of Discrete Algorithms
| Hi-index | 0.90 |