Searching for gapped palindromes
Authors:
- Roman KolpakovRKRoman Kolpakov
- Gregory KucherovGKGregory Kucherov
- 1 November 2009
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 410 (51) , 5365-5373
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Palindrome recognition using a multidimensional tapeTheoretical Computer Science, 2003
- Palindrome complexityTheoretical Computer Science, 2003
- Palindromes and Sturmian wordsTheoretical Computer Science, 1999
- Finding all periods and initial palindromes of a string in parallelAlgorithmica, 1995
- Palindromes in the Fibonacci wordInformation Processing Letters, 1995
- On the design of some systolic algorithmsJournal of the ACM, 1989
- A simplified proof of the real-time recognizability of palindromes on turing machinesJournal of Mathematical Sciences, 1981
- Palindrome recognition in real time by a multitape turing machineJournal of Computer and System Sciences, 1978
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State MachinesIEEE Transactions on Computers, 1969