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
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
Fast parallel and serial approximate string matching
Journal of Algorithms
An improved algorithm for approximate string matching
SIAM Journal on Computing
Efficient string matching: an aid to bibliographic search
Communications of the ACM
A Faster Algorithm for Approximate String Matching
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for string matching with k mismatches
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
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Approximate String Matching in LDAP Based on Edit Distance
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Statistical Identification of Uniformly Mutated Segments within Repeats
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Finding Approximate Repetitions under Hamming Distance
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Information and Computation
A sublinear algorithm for weakly approximating edit distance
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Towards Automatic Clustering of Protein Sequences
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Finding approximate repetitions under Hamming distance
Theoretical Computer Science - Logic and complexity in computer science
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Dictionary matching and indexing with errors and don't cares
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Pattern matching with address errors: rearrangement distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
Pattern matching with address errors: Rearrangement distances
Journal of Computer and System Sciences
Efficient computations of l1 and l∞ rearrangement distances
Theoretical Computer Science
Efficient algorithms for the block edit problems
Information and Computation
Efficient computations of l1and l∞rearrangement distances
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Approximate swap and mismatch edit distance
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Approximate string matching with swap and mismatch
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
String matching with up to k swaps and mismatches
Information and Computation
The approximate swap and mismatch edit distance
Theoretical Computer Science
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Optimal spaced seeds for faster approximate string matching
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Finding patterns with variable length gaps or don’t cares
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Locally consistent parsing and applications to approximate string comparisons
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
String indexing for patterns with wildcards
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Sequential pattern mining -- approaches and algorithms
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |