STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Fast parallel and serial approximate string matching
Journal of Algorithms
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Block edit models for approximate string matching
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Communication complexity of document exchange
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The string-to-string correction problem with block moves
ACM Transactions on Computer Systems (TOCS)
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
On Approximate String Matching
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
On Approximate Nearest Neighbors in Non-Euclidean Spaces
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Efficient approximate and dynamic matching of patterns using a labeling paradigm
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for embedding edit distance into normed spaces
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Index Structures for String Databases
Proceedings of the 27th International Conference on Very Large Data Bases
An Improved Algorithm for Sequence Comparison with Block Reversals
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Edit Distance with Move Operations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Simple and Practical Sequence Nearest Neighbors with Block Operations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Computing Highly Specific and Mismatch Tolerant Oligomers Efficiently
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
An efficient algorithm for sequence comparison with block reversals
Theoretical Computer Science - Latin American theorotical informatics
Low distortion embeddings for edit distance
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Substring compression problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Nonembeddability theorems via Fourier analysis
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The greedy algorithm for edit distance with moves
Information Processing Letters
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
Edit distance with move operations
Journal of Discrete Algorithms
Low distortion embeddings for edit distance
Journal of the ACM (JACM)
Distance measures for biological sequences: Some recent approaches
International Journal of Approximate Reasoning
Earth mover distance over high-dimensional spaces
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
The greedy algorithm for edit distance with moves
Information Processing Letters
Efficient algorithms for the block edit problems
Information and Computation
An efficient algorithm for finding similar short substrings from large scale string data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Road network reconstruction for organizing paths
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The Computational Hardness of Estimating Edit Distance
SIAM Journal on Computing
Locally consistent parsing and applications to approximate string comparisons
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Indexing DNA sequences using q-grams
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Personal bankruptcy prediction by mining credit card data
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |