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
Fast parallel algorithms for the unit cost editing distance between trees
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
ACM SIGICE Bulletin
An extension of Ukkonen's enhanced dynamic programming ASM algorithm
ACM Transactions on Information Systems (TOIS)
Approximate nearest neighbors and sequence comparison with block operations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Statistical Identification of Uniformly Mutated Segments within Repeats
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Saussurian analogy: a theoretical account and its application
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Estimating the selectivity of approximate string queries
ACM Transactions on Database Systems (TODS)
Efficient similarity joins for near duplicate detection
Proceedings of the 17th international conference on World Wide Web
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
Proceedings of the VLDB Endowment
Performance evaluation of similarity join for real time information integration
Proceedings of the 2nd Bangalore Annual Compute Conference
A bioinformatics-inspired adaptation to Ukkonen's edit distance calculating algorithm
Proceedings of the 46th Annual Southeast Regional Conference on XX
Context-sensitive document ranking
Journal of Computer Science and Technology
Efficient similarity joins for near-duplicate detection
ACM Transactions on Database Systems (TODS)
Combining EBMT, SMT, TM and IR technologies for quality and scale
EACL 2012 Proceedings of the Joint Workshop on Exploiting Synergies between Information Retrieval and Machine Translation (ESIRMT) and Hybrid Approaches to Machine Translation (HyTra)
| Hi-index | 0.00 |