A new method for approximate indexing and dictionary lookup with one error

Information Processing Letters

Volumn 96, Issue 5, 2005, Pages 185-191

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

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Algorithms; Data structures; Fault tolerance; Information retrieval

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FAULT TOLERANT COMPUTER SYSTEMS; GLOSSARIES; PROBABILITY;

DICTIONARY LOOKUP; PATTERN LENGTH;

INDEXING (OF INFORMATION);

EID: 27144440080     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.08.001     Document Type: Article

References (16)

1. A. Amir, D. Keselman, G.M. Landau, M. Lewenstein, N. Lewenstein, and M. Rodeh Indexing and dictionary matching with one error J. Algorithms 37 2000 309 325
2. 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
3. E. Chávez, and G. Navarro A metric index for approximate string matching Proc. 5th Latin American Theoretical Informatics (LATIN) Lecture Notes in Comput. Sci. vol. 2286 2002 Springer Berlin 181 195
4. A.L. Cobbs Fast approximate matching using suffix trees Proc. 6th Symp. on Combinatorial Pattern Matching (CPM) Lecture Notes in Comput. Sci. vol. 937 1995 Springer Berlin 41 54
5. 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
6. A. Gabriele, F. Mignosi, A. Restivo, and M. Sciortino Indexing structures for approximate string matching Proc. 5th Italian Conf. on Algorithms and Complexity (CIAC) Lecture Notes in Comput. Sci. vol. 2653 2003 Springer Berlin 140 151
7. D. Gusfield Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology 1997 Cambridge University Press Cambridge
8. M.G. Maaß Average-case analysis of approximate trie search Proc. 15th Symp. on Combinatorial Pattern Matching (CPM) Lecture Notes in Comput. Sci. vol. 3109 2004 Springer Berlin 472 484
9. E.W. Myers A sublinear algorithm for approximate keyword searching Algorithmica 12 1994 345 374
10. G. Navarro, and R. Baeza-Yates A hybrid indexing method for approximate string matching J. Discrete Algorithms 1 1 2000 205 209 (Special issue on Matching Patterns)
11. G. Navarro, R.A. Baeza-Yates, E. Sutinen, and J. Tarhio Indexing methods for approximate string matching IEEE Data Engrg. Bull. 24 4 2001 19 27
12. 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, 2004
13. B. Pittel Asymptotical growth of a class of random trees Ann. Probab. 13 2 1985 414 427
14. W. Szpankowski Asymptotic properties of data compression and suffix trees IEEE Trans. Inform. Theory 39 5 1993 1647 1659
15. E. Ukkonen Approximate string-matching over suffix trees Proc. 4th Symp. on Combinatorial Pattern Matching (CPM) Lecture Notes in Comput. Sci. vol. 684 1993 Springer Berlin 228 242
16. E. Ukkonen On-line construction of suffix trees Algorithmica 14 1995 249 260