Document listing on repetitive collections

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

Volumn 7922 LNCS, Issue , 2013, Pages 107-119

  Gagie, Travis ^a   Karhu, Kalle ^b   Navarro, Gonzalo ^c   Puglisi, Simon J ^a   Sirén, Jouni ^c  

^a UNIVERSITY OF HELSINKI   (Finland)

^b AALTO UNIVERSITY   (Finland)

^c UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL STRUCTURES; COMPRESSED SUFFIX ARRAY; DOCUMENT COLLECTION; DOCUMENT RETRIEVAL; QUERY TIME; RUN LENGTH;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

PATTERN MATCHING;

EID: 84884295366     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38905-4_12     Document Type: Conference Paper

References (19)

1. 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)
2. Claude, F., Navarro, G.: Improved grammar-based compressed indexes. In: Calderón-Benavides, L., González-Caro, C., Chávez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 180-192. Springer, Heidelberg (2012)
3. Fischer, J.: Optimal succinctness for range minimum queries. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 158-169. Springer, Heidelberg (2010)
4. Gagie, T., Gawrychowski, P., Kärkkäinen, J., Nekrich, Y., Puglisi, S.J.: A faster grammar-based self-index. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 240-251. Springer, Heidelberg (2012)
5. Gagie, T., Navarro, G., Puglisi, S.J.: Colored range queries and document retrieval. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 67-81. Springer, Heidelberg (2010)
6. Gagie, T., Navarro, G., Puglisi, S.J.: New algorithms on wavelet trees and applications to information retrieval. Theor. Comp. Sci. 426-427, 25-41 (2012)
7. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proc. SODA, pp. 636-645 (2003)
8. Hon, W.-K., Shah, R., Vitter, J.: Space-efficient framework for top-k string retrieval problems. In: Proc. FOCS, pp. 713-722 (2009)
9. Mäkinen, V., Navarro, G., Sirén, J., Valimäki, N.: Storage and retrieval of highly repetitive sequence collections. J. Computational Biology 17(3), 281-308 (2010)
10. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935-948 (1993)
11. Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proc. SODA, pp. 657-666 (2002)
12. Navarro, G., Puglisi, S.J., Valenzuela, D.: Practical compressed document retrieval. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 193-205. Springer, Heidelberg (2011)
13. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proc. ALENEX (2007)
14. Pǎtraşcu, M.: Succincter. In: Proc. FOCS, pp. 305-313 (2008)
15. Sadakane, K.: Succinct data structures for flexible text retrieval systems. J. Disc. Alg. 5(1), 12-22 (2007)
16. Szpankowski, W.: A generalized suffix tree and its (un)expected asymptotic behaviors. SIAM J. Comput. 22(6), 1176-1198 (1993)
17. Välimäki, N., Mäkinen, V.: Space-efficient algorithms for document retrieval. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 205-215. Springer, Heidelberg (2007)
18. Weiner, P.: Linear pattern matching algorithm. In: Proc. SAT, pp. 1-11 (1973)
19. Willard, D.: Log-logarithmic worst-case range queries are possible in space θ (n). Inf. Pr. Lett. 17(2), 81-84 (1983)