Indexing circular patterns

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

Volumn 4921 LNCS, Issue , 2008, Pages 46-57

  Iliopoulos, Costas S ^a   Rahman, M Sohel ^a,b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

Author keywords

[No Author keywords available]

Indexed keywords

PHASE MODULATION;

CIRCULAR PATTERN;

PATTERN MATCHING;

EID: 49949086110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77891-2_5     Document Type: Conference Paper

References (23)

1. Abouelhoda, M.I., Ohlebusch, E., Kurtz, S.: Optimal exact string matching based on suffix arrays. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 31-43. Springer, Heidelberg (2002)
2. Alstrup, S., Brodai, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS, pp. 198-207 (2000)
3. 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)
4. Amir, A., Aumann, Y., Landau, G.M., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. J. Algorithms 37(2), 247-266 (2000)
5. Apostolico, A., Crochemore, M.: Optimal canonization of all substrings of a string. Inf. Comput. 95(1), 76-95 (1991)
6. Booth, K.S.: Lexicographically least circular substrings. Inf. Process. Lett. 10(4/5), 240-242 (1980)
7. Crochemore, M., Hancart, C., Lecroq, T.: Algorithmique du texte. Vuibert Informatique (2001)
8. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)
9. Duval, J.-P.: Factorizing words over an ordered alphabet. J. Algorithms 4(4), 363-381 (1983)
10. Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
11. Hon, W.-K., Sadakane, K., Sung, W.-K.: Breaking a time-and-space barrier in constructing full-text indices. In: FOCS, pp. 251-260. IEEE Computer Society Press, Los Alamitos (2003)
12. Huynh, T.N.D., Hon, W.-K., Lam, T.W., Sung, W.-K.: Approximate string matching using compressed suffix arrays. Theor. Comput. Sci. 352(1-3), 240-249 (2006)
13. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Simple linear work suffix array construction. J. ACM 53(6), 918-936 (2006)
14. Kim, D.K., Sim, J.S., Park, H., Park, K.: Constructing suffix arrays in linear time. J. Discrete Algorithms 3(2-4), 126-142 (2005)
15. Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323-350 (1977)
16. Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. J. Discrete Algorithms 3(2-4), 143-156 (2005)
17. Lothaire, M. (ed.): Applied Combinatorics on Words. In: Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2005)
18. Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22(5), 935-948 (1993)
19. McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262-272 (1976)
20. Sadakane, K., Shibuya, T.: Indexing huge genome sequences for solving various problems. Genome Informatics 12, 175-183 (2001)
21. Shiloach, Y.: Fast canonization of circular strings. J. Algorithms 2(2), 107-121 (1981)
22. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249-260 (1995)
23. Wagner, E.K., Hewlett, M.J.: Basic Virology, 2nd edn. Blackwell Publishing, Maiden (2003)