Vector representations for efficient comparison and search for similar strings

Cybernetics and Systems Analysis

Volumn 43, Issue 4, 2007, Pages 484-498

  Sokolov, A M ^a  

^a International Scientific Educational Center of Information Technologies and Systems   (Ukraine)

Author keywords

Approximate nearest neighbor search; Approximating edit distance; Metric embedding; Neural network based information technologies

Indexed keywords

APPROXIMATE NEAREST-NEIGHBOR SEARCH; EDIT DISTANCES; METRIC EMBEDDING; Q-GRAM METHOD;

APPROXIMATION THEORY; MAPPING; NEURAL NETWORKS; RANDOM PROCESSES;

VECTORS;

EID: 34948842449     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/s10559-007-0075-1     Document Type: Article

References (20)

1. V. I. Levenshtein, "Binary Codes Capable of Correcting Deletions, Insertions, and Reversals," Dokl. Akad. Nauk SSSR, 163, No. 4, 845-848 (1965).
2. C. Burks, M. J. Cinkosky, and P. Gilna, "Decades of nonlinearity: The growth of DNA sequence data," in: N. G. Cooper (ed.), Los Alamos Science, No. 20 (1992), pp. 254-255.
3. T. K. Vintsyuk, "Speech recognition by dynamic programming methods," Cybernetics, No. 1, 81-88 (1968).
4. R. A. Wagner and M. J. Fischer, "The string-to-string correction problem," J. ACM, 21, No. 1, 168-173 (1974).
5. G. Navarro, "A guided tour to approximate string matching," ACM Computing Surveys, 33, No. 1, 31-88 (2001).
6. P. Indyk, "Embedded stringology," Talk at Fifteenth Annual Combinatorial Pattern Matching Symposium (2004), http:// theory.lcs.mit.edu/~indyk/cpm.ps.
7. P. Indyk, "Open problems," in: Jiri Matousek (ed.), Workshop on Discrete Metric Spaces and Their Algorithmic Applications, Haifa (2002).
8. A. Sokolov and D. Rachkovskij, "Some approaches to distributed encoding of sequences," in: Proc. XI-th Intern. Conf. Knowledge-Dialogue-Solution, 2, Varna, Bulgaria (2005), pp. 522-528.
9. A. Sokolov, "Nearest string by neural-like encoding," in: Proc. XI-th Intern. Conf. Knowledge-Dialogue-Solution, Varna, Bulgaria (2006), pp. 101-106.
10. N. G. de Bruijn, A Combinatorial Problem, Koninklijke Nederlandsche Akademie van Wetenschappen, 49 (1946).
11. D. Knuth, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms [Russian translation], Mir, Moscow (1977).
12. E. Ukkonen, "Approximate string-matching with q-grams and maximal matches," Theor. Comput. Sci., 92, No. 1, 191-211 (1992).
13. A. Borodin, R. Ostrovsky, and Y. Rabani, "Lower bounds for high dimensional nearest neighbor search and related problems," in: Proc. 31st STOC, ACM Press, New York (1999), pp. 312-321.
14. E. Kushilevitz, R. Ostrovsky, and Y. Rabani, "Efficient search for approximate nearest neighbor in high dimensional spaces," in: Proc. 30th STOC, ACM Press, New York (1998), pp. 614-623.
15. P. Indyk and R. Motwani, "Approximate nearest neighbors: Towards removing the curse of dimensionality," in: Proc. 30th STOC (1998), pp. 604-613.
16. M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni, "Locality-sensitive hashing scheme based on p -stable distributions," in: 20th Annual Symposium on Computational Geometry, New York (2004), pp. 253-262.
17. J. Nolan, An Introduction to Stable Distributions, http:// academic2.american.edu/jpnolan/stable/chap1.pdf.
18. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing." in: Proc. VLDB, Morgan Kaufmann Publishers, San Francisco (1999), pp. 518-529.
19. D. A. Rachkovskii, S.V. Slipchenko, E. M. Kussul', and T. N. Baidyk, "A binding procedure for distributed binary data representations," Cybernetics and Systems Analysis, No. 3, 3-8 (2005).
20. Z. Bar-Yossef, T. S. Jayram, R. Krauthgamer, and R. Kumar, "Approximating edit distance efficiently," in: 45th IEEE Symposium on Foundations of Computer Science, IEEE (2004), pp. 550-559.