Text indexing with errors

Journal of Discrete Algorithms

Volumn 5, Issue 4 SPEC. ISS., 2007, Pages 662-681

  Maaß, Moritz G ^a   Nowak, Johannes ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Average case; Edit distance; Levenshtein distance; PATRICIA tree; Suffix array; Suffix tree; Text indexing; Trie

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; ERRORS; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL SYSTEMS; QUERY LANGUAGES; TEXT PROCESSING; TREES (MATHEMATICS);

EDIT DISTANCE; INDEX COMPLEXITY; LEVENSHTEIN DISTANCE; SUFFIX ARRAY; SUFFIX TREES; TEXT DOCUMENTS; TEXT INDEXING;

PROBLEM SOLVING;

EID: 35348834170     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.11.001     Document Type: Article

References (45)

1. Amir A., Keselman D., Landau G.M., Lewenstein M., Lewenstein N., and Rodeh M. Indexing and dictionary matching with one error. J. Algorithms 37 (2000) 309-325
2. Abouelhoda M.I., Ohlebusch E., and Kurtz S. Optimal exact string matching based on suffix arrays. In: Laender A.H.F., and Oliveira A.L. (Eds). Proc. 9th Int. Symp. on String Processing and Information Retrieval (SPIRE). Lecture Notes in Computer Science vol. 2476 (2002), Springer 31-43
3. Apostolico A., and Szpankowski W. Self-alignments in words and their applications. J. Algorithms 13 (1992) 446-467
4. Stølting Brodal G., and Ga̧sieniec L. Approximate dictionary queries. Proc. 7th Symp. on Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science vol. 1075 (1996), Springer 65-74
5. A.L. Buchsbaum, M.T. Goodrich, J. Westbrook, Range searching over tree cross products, in: Proc. 8th European Symp. on Algorithms (ESA), vol. 1879, 2000, pp. 120-131
6. Borodin A., Ostrovsky R., and Rabani Y. Lower bounds for high dimensional nearest neighbor search and related problems. Proc. 31st ACM Symp. on Theory of Computing (STOC) (1999), ACM Press 312-321
7. Barkol O., and Rabani Y. Tighter bounds for nearest neighbor search and related problems in the cell probe model. Proc. 32nd ACM Symp. on Theory of Computing (STOC) (2000), ACM Press 388-396
8. Stølting Brodal G., and Venkatesh S. Improved bounds for dictionary look-up with one error. Inform. Process. Lett. 75 1-2 (2000) 57-59
9. Beame P., and Vee E. Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. Proc. 34th ACM Symp. on Theory of Computing (STOC) (2002), ACM Press 688-697
10. R. Cole, L.-A. Gottlieb, M. Lewenstein, Dictionary matching and indexing with errors and don't cares, in: Proc. 36th ACM Symp. on Theory of Computing (STOC), 2004, pp. 91-100
11. Chang W.I., and Lawler E.L. Sublinear approximate string matching and biological applications. Algorithmica 12 (1994) 327-344
12. Chávez E., and Navarro G. A metric index for approximate string matching. Proc. 5th Latin American Theoretical Informatics (LATIN). Lecture Notes in Computer Science vol. 2286 (2002), Springer 181-195
13. Cobbs A.L. Fast approximate matching using suffix trees. Proc. 6th Symp. on Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science vol. 937 (1995), Springer 41-54
14. Demaine E.D., and López-Ortiz A. A linear lower bound on index size for text retrieval. Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA) (2001), ACM 289-294
15. Farach M. Optimal suffix tree construction with large alphabets. Proc. 38th IEEE Symp. on Foundations of Computer Science (FOCS). Miami, FL (1997), IEEE 137-143
16. P. Ferragina, G. Manzini, Opportunistic data structures with applications, in: Proc. 41st IEEE Symp. on Foundations of Computer Science (FOCS), 2000, pp. 390-398
17. Gabow H.N., Bentely J.L., and Tarjan R.E. Scaling and related techniques for geometry problems. Proc. 16th ACM Symp. on Theory of Computing (STOC) (1984), ACM 135-143
18. Gabriele A., Mignosi F., Restivo A., and Sciortino M. Indexing structures for approximate string matching. Proc. 5th Italian Conference on Algorithms and Complexity (CIAC). Lecture Notes in Computer Science vol. 2653 (2003), Springer 140-151
19. Gusfield D. Algorithms on Strings, Trees, and Sequences: Comp. Science and Computational Biology (1997), Cambridge University Press
20. R. Grossi, J.S. Vitter, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, in: Proc. 32nd ACM Symp. on Theory of Computing (STOC), 2000, pp. 397-406
21. Hamming R.W. Error detecting and error correcting codes. Bell Syst. Tech. J. (1950) 147-160
22. Indyk P. Nearest neighbors in high-dimensional spaces. In: Goodman E.J., and O'Rourke J. (Eds). Handbook of Discrete and Computational Geometry. second ed. (2004), CRC Press LLC (Chapter 39)
23. Ko P., and Aluru S. Space efficient linear time construction of suffix arrays. In: Baeza-Yates R.A., Chávez E., and Crochemore M. (Eds). Proc. 14th Symp. on Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science vol. 2676 (2003), Springer 200-210
24. Kärkkäinen J., and Sanders P. Simple linear work suffix array construction. Proc. 30th Int. Colloq. on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science vol. 2719 (2003), Springer 943-955
25. Kim D.K., Sim J.S., Park H., and Park K. Linear-time construction of suffix arrays (extended abstract). In: Baeza-Yates R.A., Chávez E., and Crochemore M. (Eds). Proc. 14th Symp. on Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science vol. 2676 (2003), Springer 186-199
26. Levenshtein V.I. Binary codes capable of correcting deletions, insertions and reversals. Dokl. Akad. Nauk SSSR 163 4 (1965) 845-848
27. Maaß M.G. Average-case analysis of approximate trie search. Proc. 15th Symp. on Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science vol. 3109 (2004), Springer 472-484
28. McCreight E.M. A space-economical suffix tree construction algorithm. J. ACM 23 2 (1976) 262-272
29. Manber U., and Myers G. Suffix arrays: A new method for on-line string searches. SIAM J. Comp. 22 5 (1993) 935-948
30. Maaß M.G., and Nowak J. A new method for approximate indexing and dictionary lookup with one error. Inform. Process. Lett. 96 5 (2005) 185-191
31. Muthukrishnan S. Efficient algorithms for document retrieval problems. Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA) (2002), ACM/SIAM
32. Myers E.W. A sublinear algorithm for approximate keyword searching. Algorithmica 12 (1994) 345-374
33. Navarro G. A guided tour to approximate string matching. ACM Comput. Surv. 33 1 (2001) 31-88
34. Navarro G., and Baeza-Yates R. A hybrid indexing method for approximate string matching. J. Discrete Algorithms 1 1 (2000) 205-209 (special issue on Matching Patterns)
35. Navarro G., Baeza-Yates R.A., Sutinen E., and Tarhio J. Indexing methods for approximate string matching. IEEE Data Eng. Bull. 24 4 (2001) 19-27
36. J. Nowak, A new indexing method for approximate pattern matching with one mismatch, Master's thesis, Fakultät für Informatik, Technische Universität München, Boltzmannstr. 3, D-85748 Garching, February 2004
37. Pittel B. Asymptotical growth of a class of random trees. Ann. Probab. 13 2 (1985) 414-427
38. Szpankowski W. Asymptotic properties of data compression and suffix trees. IEEE Trans. Inform. Theory 39 5 (1993) 1647-1659
39. Szpankowski W. Average Case Analysis of Algorithms on Sequences. first ed. (2000), Wiley-Interscience
40. Ukkonen E. Algorithms for approximate string matching. Information and Control 64 (1985) 100-118
41. Ukkonen E. Approximate string-matching over suffix trees. Proc. 4th Symp. on Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science vol. 684 (1993), Springer 228-242
42. Ukkonen E. On-line construction of suffix trees. Algorithmica 14 (1995) 249-260
43. Weiner P. Linear pattern matching. Proc. 14th IEEE Symp. on Switching and Automata Theory (1973), IEEE 1-11
44. Yao A.C., and Yao F.F. Dictionary look-up with small errors. Proc. 6th Symp. on Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science vol. 937 (1995), Springer 387-394
45. Yao A.C., and Yao F.F. Dictionary look-up with one error. J. Algorithms 25 (1997) 194-202