Faster and space-optimal edit distance "1" dictionary

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5577 LNCS, Issue , 2009, Pages 154-167

  Belazzougui, Djamal ^a  

^a Institut National de Formation en Informatique   (Algeria)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; PATTERN MATCHING; TEXT PROCESSING;

ALL POSITIONS; ALPHABET SIZE; APPROXIMATE QUERY; CONSTANT FACTORS; EDIT DISTANCE; FULL-TEXT INDEX; OPTIMAL SPACE; SEARCH PROBLEM;

QUERY PROCESSING;

EID: 70350624896     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02441-2_14     Document Type: Conference Paper

References (11)

1. Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275-292 (2005)
2. Botelho, F.C., Pagh, R., Ziviani, N.: Simple and space-efficient minimal perfect hash functions. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 139-150. Springer, Heidelberg (2007)
3. Brass, P.: Advandced Data structures. Cambridge University Press, Cambridge (2008)
4. Brodai, G.S., Gasieniec, L.: Approximate dictionary queries. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 65-74. Springer, Heidelberg (1996)
5. Brodai, G.S., Srinivasan, V.: Improved bounds for dictionary look-up with one error. Information Processing Letters 75(1-2), 57-59 (2000)
6. Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don't cares. In: STOC, pp. 91-100 (2004)
7. Dietzfelbinger, M., Gil, J., Matias, Y., Pippenger, N.: Polynomial hash functions are reliable (extended abstract). In: ICALP, pp. 235-246 (1992)
8. Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM 21(2), 246-260 (1974)
9. Fano, R.M.: On the number of bits required to implement an associative memory. In: Memorandum 61, Computer Structures Group, Project MAC, MIT Press, Cambridge (1971)
10. Hagerup, T., Tholey, T.: Efficient minimal perfect hashing in nearly minimal space. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 317-326. Springer, Heidelberg (2001)
11. Maaß, M.G., Nowak, J.: Text indexing with errors. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 21-32. Springer, Heidelberg (2005)