Approximate nearest neighbors and sequence comparison with block operations
- 1 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 416-424
- https://doi.org/10.1145/335305.335353
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Approximate string matching in sublinear expected timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximate nearest neighborsPublished by Association for Computing Machinery (ACM) ,1998
- Efficient search for approximate nearest neighbor in high dimensional spacesPublished by Association for Computing Machinery (ACM) ,1998
- Block edit models for approximate string matchingTheoretical Computer Science, 1997
- Two algorithms for nearest-neighbor search in high dimensionsPublished by Association for Computing Machinery (ACM) ,1997
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithmsPublished by Association for Computing Machinery (ACM) ,1986
- The string-to-string correction problem with block movesACM Transactions on Computer Systems, 1984
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- Rapid identification of repeated patterns in strings, trees and arraysPublished by Association for Computing Machinery (ACM) ,1972