Wee LCP

Information Processing Letters

Volumn 110, Issue 8-9, 2010, Pages 317-320

  Fischer, Johannes ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

Compressed data structures; Data sructures; Longest common prefixes; Suffix arrays; Text indexing

Indexed keywords

LONGEST COMMON PREFIXES; SUFFIX ARRAYS; SUFFIX-TREES; TEXT-INDEXING;

AUTOMOBILE SEATS; DATA STRUCTURES;

INDEXING (OF INFORMATION);

EID: 77949489607     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.02.010     Document Type: Article

References (22)

1. Abouelhoda M.I., Kurtz S., and Ohlebusch E. Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2 1 (2004) 53-86
2. Cole R., Kopelowitz T., and Lewenstein M. Suffix trays and suffix trists: Structures for faster text indexing. Proc. ICALP (Part I). LNCS vol. 4051 (2006), Springer 358-369
3. Ferragina P., and Manzini G. Indexing compressed text. J. ACM 52 4 (2005) 552-581
4. Ferragina P., and Venturini R. A simple storage scheme for strings achieving entropy bounds. Theoret. Comput. Sci. 372 1 (2007) 115-121
5. Fischer J., Mäkinen V., and Navarro G. Faster entropy-bounded compressed suffix trees. Theoret. Comput. Sci. 410 51 (2009) 5354-5364
6. Golynski A. Optimal lower bounds for rank and select indexes. Theoret. Comput. Sci. 387 3 (2007) 348-359
7. Gonnet G.H., Baeza-Yates R.A., and Snider T. New indices for text: PAT trees and PAT arrays. In: Frakes W.B., and Baeza-Yates R.A. (Eds). Information Retrieval: Data Structures and Algorithms (1992), Prentice-Hall 66-82 (Chapter 3)
8. González R., and Navarro G. Statistical encoding of succinct data structures. Proc. CPM. LNCS vol. 4009 (2006), Springer 294-305
9. Grossi R., Gupta A., and Vitter J.S. High-order entropy-compressed text indexes. Proc. SODA (2003), ACM/SIAM 841-850
10. Gusfield D. Algorithms on Strings, Trees, and Sequences (1997), Cambridge University Press
11. Jacobson G. Space-efficient static trees and graphs. Proc. FOCS (1989), IEEE Computer Society 549-554
12. Kärkkäinen J., Manzini G., and Puglisi S.J. Permuted longest-common-prefix array. Proc. CPM. LNCS vol. 5577 (2009), Springer 181-192
13. Kasai T., Lee G., Arimura H., Arikawa S., and Park K. Linear-time longest-common-prefix computation in suffix arrays and its applications. Proc. CPM. LNCS vol. 2089 (2001), Springer 181-192
14. Mäkinen V. Compact suffix array - a space efficient full-text index. Fund. Inform. 56 1-2 (2003) 191-210 (Special Issue: Computing Patterns in Strings)
15. Manber U., and Myers E.W. Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22 5 (1993) 935-948
16. Manzini G. An analysis of the Burrows-Wheeler transform. J. ACM 48 3 (2001) 407-430
17. Manzini G. Two space saving tricks for linear time LCP array computation. Proc. Scandinavian Workshop on Algorithm Theory (SWAT). LNCS vol. 3111 (2004), Springer 372-383
18. Navarro G., and Mäkinen V. Compressed full-text indexes. ACM Comput. Surv. 39 1 (2007) (Article No. 2)
19. Russo L.M.S., Navarro G., and Oliveira A.L. Fully-compressed suffix trees. Proc. LATIN. LNCS vol. 4957 (2008), Springer 362-373
20. Sadakane K. New text indexing functionalities of the compressed suffix arrays. J. Algorithms 48 2 (2003) 294-313
21. Sadakane K. Compressed suffix trees with full functionality. Theory Comput. Syst. 41 4 (2007) 589-607
22. Sadakane K., and Grossi R. Squeezing succinct data structures into entropy bounds. Proc. SODA (2006), ACM/SIAM 1230-1239