Text indexing with errors

Lecture Notes in Computer Science

Volumn 3537, Issue , 2005, Pages 21-32

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

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS; INDEXING (OF INFORMATION); PROBABILITY; QUERY LANGUAGES;

BOUNDED INDEX; TEXT DOCUMENT; TEXT INDEXING;

TEXT PROCESSING;

EID: 26444530064     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_3     Document Type: Conference Paper

References (32)

1. M. I. Abouelhoda, E. Ohlebusch, and S. Kurtz. Optimal exact string matching based on suffix arrays. In A. H. F. Laender and A. L. Oliveira, editors, Proc. 9th Int. Symp. on String Processing and Information Retrieval (SPIRE), volume 2476 of LNCS, pages 31-43. Springer, 2002.
2. A. Amir, D. Keselman, G. M. Landau, M. Lewenstein, N. Lewenstein, and M. Rodeh. Indexing and dictionary matching with one error. J. Algorithms, 37:309-325, 2000.
3. O. Barkol and Y. Rabani. Tighter bounds for nearest neighbor search and related problems in the cell probe model. In Proc. 32nd ACM Symp. on Theory of Computing (STOC), pages 388-396. ACM Press, 2000.
4. A. Borodin, R. Ostrovsky, and Y. Rabani. Lower bounds for high dimensional nearest neighbor search and related problems. In Proc. 31st ACM Symp. on Theory of Computing (STOC), pages 312-321. ACM Press, 1999.
5. G. S. Brodal and L. Ga̧sieniec. Approximate dictionary queries. In Proc. 7th Symp. on Combinatorial Pattern Matching (CPM), volume 1075 of LNCS, pages 65-74, 1996.
6. A. L. Buchsbaum, M. T. Goodrich, and J. Westbrook. Range searching over tree cross products. In Proc. 8th European Symp. on Algorithms (ESA), volume 1879, pages 120-131, 2000.
7. W. I. Chang and E. L. Lawler. Sublinear approximate string matching and biological applications. Algorithmica, 12:327-344, 1994.
8. E. Chávez and G. Navarro. A metric index for approximate string matching. In Proc. 5th Latin American Theoretical Informatics (LATIN), volume 2286 of LNCS, pages 181-195, 2002.
9. A. L. Cobbs. Fast approximate matching using suffix trees. In Proc. 6th Symp. on Combinatorial Pattern Matching (CPM), volume 937 of LNCS, pages 41-54. Springer, 1995.
10. R. Cole, L.-A. Gottlieb, and M. Lewenstein. Dictionary matching and indexing with errors and don't cares. In Proc. 36th ACM Symp. on Theory of Computing (STOC), pages 91-100, 2004.
11. E. D. Demaine and A. López-Ortiz. A linear lower bound on index size for text retrieval. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 289-294. ACM, Jan. 2001.
12. H. N. Gabow, J. L. Bentely, and R. E. Tarjan. Scaling and related techniques for geometry problems. In Proc. 16th ACM Symp. on Theory of Computing (STOC), pages 135-143. ACM, Apr. 1984.
13. A. Gabriele, F. Mignosi, A. Restivo, and M. Sciortino. Indexing structures for approximate string matching. In Proc. 5th Italian Conference on Algorithms and Complexity (CIAC), volume 2653 of LNCS, pages 140-151, 2003.
14. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Comp. Science and Computational Biology. Cambridge University Press, 1997.
15. P. Indyk. Nearest neighbors in high-dimensional spaces. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 39. CRC Press LLC, 2nd edition, 2004.
16. M. G. Maaß. Average-case analysis of approximate trie search. In Proc. 15th Symp. on Combinatorial Pattern Matching (CPM), volume 3109 of LNCS, pages 472-484. Springer, July 2004.
17. M. G. Maaß and J. Nowak. Text indexing with errors. Technical Report TUM-I0503, Fakultät für Informatik, TU München, Mar. 2005.
18. M. G. Maaß and J. Nowak. A new method for approximate indexing and dictionary lookup with one error. Information Processing Letters (IPL), To be published.
19. E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23(2):262-272, Apr. 1976.
20. S. Muthukrishnan. Efficient algorithms for document retrieval problems. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA). ACM/SIAM, 2002.
21. E. W. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12:345-374, 1994.
22. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, Mar. 2001.
23. G. Navarro and R. Baeza-Yates. A hybrid indexing method for approximate string matching. J. Discrete Algorithms, 1(1):205-209, 2000. Special issue on Matching Patterns.
24. G. Navarro, R. A. Baeza-Yates, E. Sutinen, and J. Tarhio. Indexing methods for approximate string matching. IEEE Data Eng. Bull., 24(4):19-27, Dec. 2001.
25. 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, Feb. 2004.
26. B. Pittel. Asymptotical growth of a class of random trees. Annals of Probability, 13(2):414-427, 1985.
27. W. Szpankowski. Asymptotic properties of data compression and suffix trees. IEEE Transact. on Information Theory, 39(5):1647-1659, Sept. 1993.
28. W. Szpankowski. Average Case Analysis of Algorithms on Sequences. Wiley-Interscience, 1st edition, 2000.
29. E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100-118, 1985.
30. E. Ukkonen. Approximate string-matching over suffix trees. In Proc. 4th Symp. on Combinatorial Pattern Matching (CPM), volume 684 of LNCS, pages 228-242. Springer, 1993.
31. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, 1995.
32. P. Weiner. Linear pattern matching. In Proc. 14th IEEE Symp. on Switching and Automata Theory, pages 1-11. IEEE, 1973.