Faster algorithms for string matching with k mismatches
SODA '00 Proceedings of the eleventh 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
Permutation Editing and Matching via Embeddings
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A note on randomized algorithm for string matching with mismatches
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Fast approximate pattern matching with few indels via embeddings
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
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)
Approximated Pattern Matching with the L1 , L2 and L∞ Metrics
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
From coding theory to efficient pattern matching
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Pattern matching with address errors: Rearrangement distances
Journal of Computer and System Sciences
Efficient computations of l1 and l∞ rearrangement distances
Theoretical Computer Science
Pattern matching with don't cares and few errors
Journal of Computer and System Sciences
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
The approximate swap and mismatch edit distance
Theoretical Computer Science
Discovering almost any hidden motif from multiple sequences
ACM Transactions on Algorithms (TALG)
A black box for online approximate pattern matching
Information and Computation
Finding the position of the k-mismatch and approximate tandem repeats
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Approximate matching in the L1 metric
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Parallel pattern matching with swaps on a linear array
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Information and Computation
Pattern matching in multiple streams
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Hi-index | 0.90 |