Position-restricted substring searching

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

Volumn 3887 LNCS, Issue , 2006, Pages 703-714

  Mäkinen, Veli ^a   Navarro, Gonzalo ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; NUMERICAL ANALYSIS; TREES (MATHEMATICS); WAVELET TRANSFORMS;

RANK QUERIES; WAVELET TREES;

DATA STRUCTURES;

EID: 33745597587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_64     Document Type: Conference Paper

References (18)

1. S. Alstrup, G. Brodal, and T. Rahue. New data structures for orthogonal range searching, In Proc. 41st IEEE Symposium on Foundations of Computer Science (FOCS), pages 198-207, 2000.
2. A. Apostolico. The myriad virtues of subword trees. In Combinatorial Algorithms on Words, NATO ISI Series, pages 85-96. Springer-Verlag, 1985.
3. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing, 17(3):427-462, 1988.
4. D. Clark. Compact Pat Trees. PhD thesis, University of Waterloo, 1996.
5. P. Ferragina and G. Manzini. Opportunistic data structures with applications. In Proc. 41st IEEE Symposium on Foundations of Computer Science (FOCS), pages 390-398, 2000.
6. P. Ferragina and G. Manzini. Indexing compressed texts. Journal of the ACM, 52(4):552-581, 2005.
7. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. An alphabet-friendly FM-index. In Proc. 11th International Symposium on String Processing and Information Retrieval (SPIRE), LNCS v. 3246, pages 150-160, 2004.
8. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro, Compressed representation of sequences and full-text indexes. Technical Report 2004-05, Technische Fakultät, Universität Bielefeld, Germany, December 2004, Submitted to a journal.
9. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Succinct representation of sequences. Technical Report TR/DCC-2004-5, Department of Computer Science, University of Chile, Chile, August 2004. ftp://ftp.dcc.uchile. cl/pub/users/gnavarro/sequences.ps.gz.
10. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 841-850, 2003.
11. R. Grossi, A. Gupta, and J. Vitter. When indexing equals compression: Experiments with compressing suffix arrays and applications. In Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 636-645, 2004.
12. G. Jacobson, Space-efficient static trees and graphs. In Proc. 30th IEEE Symp. Foundations of Computer Science (FOCS'89), pages 549-554, 1989.
13. J. Kärkkäinen. Repetition-based text indexes. PhD thesis, Dept. of Computer Science, University of Helsinki, Finland, 1999. Also available as Report A-1999-4, Series A.
14. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, pages 935-948, 1993.
15. G. Manzini. An analysis of the Burrows-Wheeler transform, Journal of the ACM, 48(3):407-430, 2001.
16. I. Munro. Tables. In Proc. 16th Foundations of Software Technology and Theoretical Computer Science (FSTTCS'96), LNCS 1180, pages 37-42, 1996.
17. G. Navarro and V. Mäkinen. Compressed full-text indexes. Technical Report TR/DCC-2005-7, Department of Computer Science, University of Chile, Chile, June 2005. ftp://ftp.dec.uchile.cl/pub/users/gnavarro/survcompr.ps.gz. Submitted to a journal.
18. R. Raman, V. Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02), pages 233-242, 2002.