Range non-overlapping indexing and successive list indexing

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

Volumn 4619 LNCS, Issue , 2007, Pages 625-636

  Keller, Orgad ^a   Kopelowitz, Tsvi ^a   Lewenstein, Moshe ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION; PROBLEM SOLVING; QUERY PROCESSING; TEXT PROCESSING;

LIST INDEXING; NON-OVERLAPPING INDEXING;

INDEXING (OF INFORMATION);

EID: 38149120507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73951-7_54     Document Type: Conference Paper

References (15)

1. Agarwal, P., Erickson, J.: Geometric range searching and its relatives (1999)
2. Alstrup, S., Brodai, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: IEEE Symposium on Foundations of Computer Science, pp. 198-207 (2000)
3. Amir, A., Keselman, D., Landau, G.M., Lewenstein, M., Lewenstein, N., Rodeh, M.: Text indexing and dictionary matching with one error. J. Algorithms 37(2), 309-325 (2000)
4. Apostolico, A., Preparata, F.P.: Data structures and algorithms for the string statistics problem. Algorithmica 15(5), 481-494 (1996)
5. Brodai, G.S., Lyngsø, R.B., Östlin, A., Pedersen, C.N.S.: Solving the string statistics problem in time O(n log n). In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 728-739. Springer, Heidelberg (2002)
6. Dietzfelbinger, M., Karlin, A.R., Mehlhorn, K., auf der Heide, F.M., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: Upper and lower bounds, vol. 23, pp. 738-761, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics (1994)
7. Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), Washington, DC, USA, p. 137. IEEE Computer Society Press, Los Alamitos (1997)
8. Ferragina, P.: Dynamic text indexing under string updates. J. Algorithms 22(2), 296-328 (1997)
9. Ferragina, P., Muthukrishnan, S., de Berg, M.: Multi-method dispatching: A geometric approach with applications to string matching problems. In: STOC, pp. 483-491 (1999)
10. Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp. 135-143. ACM Press, New York (1984)
11. Knuth, D., Morris, J.H., Pratt, V.: Fast pattern matching in strings. SIAM Journal on Computing 6(2), 323-350 (1977)
12. Lenhof, H.-P., Smid, M.: Using persistent data structures for adding range restrictions to searching problems. RAIRO Theoretical Informatics and Applications 28, 25-49 (1994)
13. McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262-272 (1976)
14. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249-260 (1995)
15. Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, pp. 1-11. IEEE, New York (1973)