Optimal parallel pattern matching in strings
Information and Control
On the application of sheared retrieval to orthogonal range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
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
A linear space algorithm for the LCS problem
Acta Informatica
SIAM Journal on Computing
An improvement to bottom-up tree pattern matching
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Data structures and algorithms for approximate string matching
Journal of Complexity
Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
An improved algorithm for approximate string matching
SIAM Journal on Computing
Fast algorithms for the unit cost editing distance between trees
Journal of Algorithms
An algorithm for string matching with a sequence of don't cares
Information Processing Letters
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Fast linear-space computations of longest common subsequences
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
More efficient bottom-up multi-pattern matching in trees
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Journal of the ACM (JACM)
An Alphabet Independent Approach to Two-Dimensional Pattern Matching
SIAM Journal on Computing
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The String-to-String Correction Problem
Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Bounds for the String Editing Problem
Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Introductory Combinatorics
Efficient Preprocessing of Simple Binary Pattern Forests
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Heaviest Increasing/Common Subsequence Problems
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Alignment of Trees - An Alternative to Tree Edit
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Preserving order in a forest in less than logarithmic time
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Efficient tree pattern matching
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Approximate string matching in sublinear expected time
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Truly alphabet-independent two-dimensional pattern matching
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Towards a process model for identifying knowledge-related structures in product data
PAKM'06 Proceedings of the 6th international conference on Practical Aspects of Knowledge Management
Hi-index | 0.00 |