Finding patterns in given intervals

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

Volumn 4708 LNCS, Issue , 2007, Pages 645-656

  Crochemore, Maxime ^a,b   Iliopoulos, Costas S ^a   Sohel Rahman, M ^a,c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b Université de Marne la Vallée   (France)

^c BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

Author keywords

[No Author keywords available]

Indexed keywords

INDEXING (OF INFORMATION); PROBLEM SOLVING; QUERY PROCESSING;

PRE-PROCESSING;

PATTERN MATCHING;

EID: 38049091158     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74456-6_57     Document Type: Conference Paper

References (25)

1. Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.: Range searching in categorical data: Colored range searching on grid. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 17-28. Springer, Heidelberg (2002)
2. Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: SODA, pp. 1221-1229. ACM Press, New York (2006)
3. Amir, A., Butman, A., Crochemore, M., Landau, G.M., Schaps, M.: Two-dimensional pattern matching with rotations. Theor. Comput. Sci. 314(1-2), 173-187 (2004)
4. Amir, A., Butman, A., Lewenstein, M.: Real scaled matching. Inf. Process. Lett. 70(4), 185-190 (1999)
5. Amir, A., Chencinski, E.: Faster two dimensional scaled matching. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 200-210. Springer, Heidelberg (2006)
6. Amir, A., Chencinski, E., Iliopoulos, C., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. In: CPM, pp. 1-15 (2006)
7. Amir, A., Kapah, O., Tsur, D.: Faster two dimensional pattern matching with rotations. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 409-419. Springer, Heidelberg (2004)
8. Bender, M.A., Farach-Colton, M.: The lca problem revisited. In: Latin American Theoretical INformatics (LATIN), pp. 88-94 (2000)
9. Butman, A., Eres, R., Landau, G.M.: Scaled and permuted string matching. Inf. Process. Lett. 92(6), 293-297 (2004)
10. Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don't cares. In: Babai, L. (ed.) STOC, pp. 91-100. ACM Press, New York (2004)
11. Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In: STOC, pp. 592-601 (2002)
12. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific (2002)
13. Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137-143 (1997)
14. Fischer, M., Paterson, M.: String matching and other products. In: Karp, R.M. (ed.) Complexity of Computation. SIAM AMS Proceedings, vol. 7, pp. 113-125 (1974)
15. Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for geometry problems. In: Symposium on the Theory of Computing (STOC), pp. 135-143 (1984)
16. Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
17. Hirschberg, D.S.: Algorithms for the longest common subsequence problem. J. ACM 24(4), 664-675 (1977)
18. Jurka, J.: Human repetitive elements. In: Meyers, RA. (ed.) Molecular Biology and Biotechnology
19. Jurka, J.: Origin and evolution of alu repetitive elements. In: Maraia, R. (ed.) The impact of short interspersed elements (SINEs) on the host genome
20. Levenshtein, V.: Binary codes capable of correcting, deletions, insertions and reversals. Soviet Phys. Dokl. 10, 707-710 (1966)
21. Mäkinen, V., Navarro, G.: Position-restricted substring searching. In: LATIN, pp. 1-12 (2006)
22. McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262-272 (1976)
23. Rahman, M.S., Iliopoulos, C., Lee, I., Mohamed, M., Smyth, W.: Finding patterns with variable length gaps or don't cares. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 146-155. Springer, Heidelberg (2006)
24. Sadakane, K.: Succinct data structures for flexible text retrieval systems. Journal of Discrete Algorithms 5(1), 12-22 (2007)
25. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249-260 (1995)