Substring range reporting

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

Volumn 6661 LNCS, Issue , 2011, Pages 299-308

  Bille, Philip ^a   Gørtz, Inge Li ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL QUERY; OPTIMAL TIME; SUB-STRINGS; SUBSTRING; SUFFIX-TREES; TIME-SPACE;

DATA STRUCTURES; ELECTROSTATIC DISCHARGE; OPTIMIZATION; PATTERN MATCHING; TREES (MATHEMATICS);

INDEXING (OF INFORMATION);

EID: 79960099448     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21458-5_26     Document Type: Conference Paper

References (22)

1. Alstrup, S., Brodal, G., Rauhe, T.: Optimal static range reporting in one dimension. In: Proc. 33rd STOC, pp. 476-482 (2001)
2. Alstrup, S.,Stølting Brodal, G., Rauhe, T.: New data structures for orthogonal range searching. In: Proc. 41st FOCS, pp. 198-207 (2000)
3. Amir, A., Chencinski, E., Iliopoulos, C.S., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. Theoret. Comput. Sci. 395(2-3), 298-310 (2008)
4. Bose, P., He, M., Maheshwari, A., Morin, P.: Succinct orthogonal range search structures on a grid with applications to text indexing. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 98-109. Springer, Heidelberg (2009)
5. Chazelle, B.: Filtering search: A new approach to query-answering. SIAM J. Comput. 15(3), 703-724 (1986)
6. Cohen, H., Porat, E.: Range non-overlapping indexing. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 1044-1053. Springer, Heidelberg (2009)
7. Crochemore, M., Iliopoulos, C.S., Kubica, M., Rahman, M.S., Walen, T.: Improved algorithms for the range next value problem and applications. In: Proc. 25th STACS, pp. 205-216 (2008)
8. Crochemore, M., Iliopoulos, C.S., Kubica, M., Rahman, M.S., Walen, T.: Finding patterns in given intervals. Fundam. Inform. 101(3), 173-186 (2010)
9. Crochemore, M., Iliopoulos, C.S., Rahman, M.S.: Optimal prefix and suffix queries on texts. Inf. Process. Lett. 108(5), 320-325 (2008)
10. Crochemore, M., Tischler, G.: The gapped suffix array: A new index structure for fast approximate matching. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 359-364. Springer, Heidelberg (2010)
11. Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. J. ACM 47(6), 987-1011 (2000)
12. Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with O(1) worst case access time. J. ACM 31, 538-544 (1984)
13. Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology, Cambridge (1997)
14. Iliopoulos, C.S., Rahman, M.S.: Faster index for property matching. Inf. Process. Lett. 105(6), 218-223 (2008)
15. Iliopoulos, C.S., Rahman, M.S.: Indexing factors with gaps. Algorithmica 55(1), 60-70 (2009)
16. Juan, M., Liu, J., Wang, Y.: Errata for "Faster index for property matching". Inf. Process. Lett. 109(18), 1027-1029 (2009)
17. Mäkinen, V., Navarro, G.: Position-restricted substring searching. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 703-714. Springer, Heidelberg (2006)
18. Mäkinen, V., Navarro, G.: Rank and select revisited and extended. Theoret. Comput. Sci. 387(3), 332-347 (2007)
19. Mortensen, C.W., Pagh, R., Pǎtraçcu, M.: On dynamic range reporting in one dimension. In: Proc. 37th STOC, pp. 104-111 (2005)
20. Pǎtraşcu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: Proc. 38th STOC, pp. 232-240 (2006)
21. Porat, E.: Personal communication (2011)
22. Yu, C.-C., Hon, W.-K., Wang, B.-F.: Improved data structures for the orthogonal range successor problem. Comput. Geometry 44(3), 148-159 (2011)