Searching for gapped palindromes

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

Volumn 5029 LNCS, Issue , 2008, Pages 18-30

  Kolpakov, Roman ^a   Kucherov, Gregory ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b ECOLE CENTRALE DE LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PHASE MODULATION;

(SPM) CLASSES; HEIDELBERG (CO); SPRINGER (CO); TIME BOUND; TWO TYPES;

PATTERN MATCHING;

EID: 45849089983     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69068-9_5     Document Type: Conference Paper

References (25)

1. Allouche, J.-P., Baake, M., Cassaigne, J., Damanik, D.: Palindrome complexity. Theor. Comput. Sci. 292(1), 9-31 (2003)
2. Apostolico, A., Breslauer, D., Galii, Z.: Parallel detection of all palindromes in a string. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 497-506. Springer, Heidelberg (1994)
3. Biedl, T., Buss, J., Demaine, E., Demaine, M., Hajiaghayi, M., Vinar, T.: Palindrome recognition using a multidimensional tape. Theor. Comput. Sci. 302(1-3), 475-480 (2003)
4. Breslauer, D., Galii, Z.: Finding all periods and initial palindromes of a string in parallel. Algorithmica 14, 355-366 (1995)
5. Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Transactions on Computers 18, 349-365 (1969)
6. Cook, S.: Linear time simulation of deterministic two-way pushdown automata. In: Proceedings of the 5th World Computer Congress, IFIP 1971, Ljubljana, Yugoslavia, August 23-28, 1971, Vol. 1, pp. 75-80 (1971)
7. Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Oxford (1994)
8. De Luca, A., De Luca, A.: Palindromes in Sturmian words. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 199-208. Springer, Heidelberg (2005)
9. Droubay, X., Pirillo, G.: Palindromes and Sturmian words. Theoret. Comput. Sci. 223, 73-85 (1999)
10. Droubay, X.: Palindromes in the Fibonacci word. Information Processing Letters 55(4), 217-221 (1995)
11. Galil, Z.: Palindrome recognition in real time by a multitape turing ma-chine. Journal of Computer and System Sciences 16(2), 140-157 (1978)
12. Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
13. Kolpakov, R., Kucherov, G.: Finding repeats with fixed gap. In: Proceedings of the 7th International Symposium on String Processing and Information Retrieval (SPIRE), A Coruña, Spain, September 27-29, 2000, pp. 162-168. IEEE, Los Alamitos (2000)
14. Kolpakov, R., Kucherov, G.: On maximal repetitions in words. Journal of Discrete Algorithms 1(1), 159-186 (2000)
15. Kolpakov, R., Kucherov, G.: Identification of periodic structures in words. In: Berstel, J., Perrin, D. (eds.) Applied combinatorics on words, Encyclopedia of Mathematics and its Applications. Lothaire books, ch.8, vol. 104, pp. 430-477. Cambridge University Press, Cambridge (2005)
16. Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput. 6, 323-350 (1977)
17. Kärkkäinen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943-955. Springer, Heidelberg (2003)
18. Lu, L., Jia, H., Droge, P., Li, J.: The human genome-wide distribution of DNA palindromes. Functional and Integrative Genomics 7(3), 221-227 (2007)
19. Manacher, G.: A new linear-time "on-line" algorithm for finding the smallest initial palindrome of a string. Journ. ACM 22(3), 346-351 (1975)
20. Porto, A.H.L., Barbosa, V.C.: Finding approximate palindromes in strings. Pattern Recognition 35, 2581-2591 (2002)
21. Slisenko, A.O.: Recognition of palindromes by multihead turing machines. In: Orverkov, V.P., Sonin, N.A. (eds.) Problems in the Constructive Trend in Mathematics VI, Proceedings of the Steklov Institute of Mathematics, vol. 129, pp. 30-202 (1973)
22. Slissenko, A.: A simplified proof of real-time recognizability of palindromes on Turing machines. J. of Soviet Mathematics 15(1), 68-77 (1981);
23. Russian original. In: Zapiski Nauchnykh Seminarov LOMI, vol. 68, pp. 123-139 (1977)
24. van de Snepscheut, J., Swenker, J.: On the design of some systolic algorithms. J. ACM 36(4), 826-840 (1989)
25. Warburton, P.E., Giordano, J., Cheung, F., Gelfand, Y., Benson, G.: Inverted repeat structure of the human genome: The X-chromosome contains a preponderance of large, highly homologous inverted repeats that contain testes genes. Genome Research 14, 1861-1869 (2004)