Compressed string dictionary look-up with edit distance one

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

Volumn 7354 LNCS, Issue , 2012, Pages 280-292

  Belazzougui, Djamal ^a   Venturini, Rossano ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EDIT DISTANCE; QUERY TIME; SPACE COMPLEXITY;

ARTIFICIAL INTELLIGENCE;

PATTERN MATCHING;

EID: 84863109054     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31265-6_23     Document Type: Conference Paper

References (16)

1. Belazzougui, D.: Faster and Space-Optimal Edit Distance "1" Dictionary. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009 Lille. LNCS, vol. 5577, pp. 154-167. Springer, Heidelberg (2009)
2. Belazzougui, D., Navarro, G.: Alphabet-Independent Compressed Text Indexing. In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 748-759. Springer, Heidelberg (2011)
3. Brodal, G.S., Ga̧sieniec, L.: Approximate Dictionary Queries. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 65-74. Springer, Heidelberg (1996)
4. Brodal, G.S., Srinivasan, V.: Improved bounds for dictionary look-up with one error. Information Processing Letters 75(1-2), 57-59 (2000)
5. Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)
6. Dietzfelbinger, M., Gil, J., Matias, Y., Pippenger, N.: Polynomial Hash Functions are Reliable (Extended abstract). In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 235-246. Springer, Heidelberg (1992)
7. Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM 21, 246-260 (1974)
8. Fano, R.M.: On the number of bits required to implement an associative memory. Memorandum 61, Computer Structures Group, Project MAC (1971)
9. Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theor. Comput. Sci. 372(1), 115-121 (2007)
10. Ferragina, P., Venturini, R.: The compressed permuterm index. ACM Transactions on Algorithms 7(1), 10 (2010)
11. Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465-492 (2011)
12. 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)
13. Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 31(2), 249-260 (1987)
14. Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762-776 (2001)
15. Russo, L.M.S., Navarro, G., Oliveira, A.L.: Fully compressed suffix trees. ACM Transactions on Algorithms 7(4), 53 (2011)
16. Sadakane, K.: Compressed suffix trees with full functionality. Theory Comput. Syst. 41(4), 589-607 (2007)