A new succinct representation of RMQ-information and improvements in the enhanced suffix array

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

Volumn 4614 LNCS, Issue , 2007, Pages 459-470

  Fischer, Johannes ^a   Heun, Volker ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; PROBLEM SOLVING; QUERY PROCESSING; TREES (MATHEMATICS);

ENHANCED SUFFIX ARRAY; INTERMEDIATE SPACE; SPACE CONSUMPTION; SUFFIX TREE;

COMPUTER SCIENCE;

EID: 38049088202     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74450-4_41     Document Type: Conference Paper

References (17)

1. Berkman, O., Vishkin, U.: Recursive star-tree parallel data structure. SIAM J. Comput. 22(2), 221-242 (1993)
2. Sadakane, K.: Space-efficient data structures for flexible text retrieval systems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 14-24. Springer, Heidelberg (2002)
3. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1), 53-86 (2004)
4. Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2), 75-94 (2005)
5. Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. of the ACM Symp. on Theory of Computing, pp. 135-143. ACM Press, New York (1984)
6. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. FOCS, pp. 549-554. IEEE Computer Society Press, Los Alamitos (1989)
7. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys (to appear, 2007) Preliminary version available at http://www.dcc.uchile.cl/~gnavarro/ps/acmcs06.ps.gz
8. Sadakane, K.: Succinct representations of lcp information and improvements in the compressed suffix arrays. In: Proc. SODA, ACM/SIAM, pp. 225-237 (2002)
9. Sadakane, K.: Compressed suffix trees with full functionality. Theory of Computing Systems (to appear, 2007), Preliminary version available at http://tcslab.csce.kyushu--u.ac.jp/~sada/papers/cst.ps
10. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: Proc. SPAA, pp. 258-264. ACM Press, New York (2002)
11. Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22(5), 935-948 (1993)
12. Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proc. SODA, ACM/SIAM, pp. 657-666 (2002)
13. Chen, K.-Y., Chao, K.-M.: On the range maximum-sum segment query problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 294-305. Springer, Heidelberg (2004)
14. Tarjan, R.E., Vishkin, U.: An efficient parallel biconnectivity algorithm. SIAM J. Comput. 14(4), 862-874 (1985)
15. Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 36-48. Springer, Heidelberg (2006)
16. Yao, A.C.-C.: Should tables be sorted? J. ACM 28(3), 615-628 (1981)
17. Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181-192. Springer, Heidelberg (2001)