Space-efficient algorithms for document retrieval

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

Volumn 4580 LNCS, Issue , 2007, Pages 205-215

  Välimäki, Niko ^a   Mäkinen, Veli ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING;

DOCUMENT LISTING PROBLEM; SPACE-EFFICIENT ALGORITHMS;

INFORMATION RETRIEVAL SYSTEMS;

EID: 37849047274     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73437-6_22     Document Type: Conference Paper

References (13)

1. Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. Journal of Molecular Biology 215(3), 403-410 (1990)
2. Bast, H., Mortensen, C.W., Weber, I.: Output-sensitive autocompletion search. In: Crestani, F., Ferragina, P., Sanderson, M. (eds.) SPIRE 2006. LNCS, vol. 4209, pp. 150-162. Springer, Heidelberg (2006)
3. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific (2002)
4. Farach-Colton, M., Bender, M.A.: The lea problem revisited. In: Proc. Latin American Theoretical Informatics (LATIN), pp. 88-94 (2000)
5. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representation of sequences and full-text indexes. ACM Transactions on Algorithms (to appear)
6. Fischer, J., Heun, V.: A new succinct representation of rmq-information and improvements in the enhanced suffix array. In: Proceedings of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE'07), LNCS. Springer (to appear)
7. Mäkinen, V., Navarro, G.: Dynamic entropy compressed sequences and full-text indexes. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 306-317. Springer, Heidelberg (2006)
8. Matias, Y., Muthukrishnan, S., Sahinalpk, S.C., Ziv, J.: Augmenting suffix trees with applications. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 67-78. Springer, Heidelberg (1998)
9. Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (SODA'02), pp. 657-666 (2002)
10. Navarro, G., Mäkinen, V.: Compressed full-text indexes (Article 2). ACM Computing Surveys 39(1) (2007)
11. Puglisi, S.J., Smyth, W.F., Turpin, A.: Inverted files versus suffix arrays for locating patterns in primary memory. In: Crestani, F., Ferragina, P., Sanderson, M. (eds.) SPIRE 2006. LNCS, vol. 4209, pp. 122-133. Springer, Heidelberg (2006)
12. Sadakane, K.: Space-efficient data structures for flexible text retrieval systems. Journal of Discrete Algorithms. ISAAC 2002 5(1), 12-22 (2002)
13. Witten, I.H., Moffat, A., Bell, T.C.: Managing gigabytes scompressing and indexing documents and images, 2nd edn. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA (1999)