On the design of some systolic algorithms
Journal of the ACM (JACM)
Text algorithms
Palindromes in the Fibonacci word
Information Processing Letters
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Palindromes and Sturmian words
Theoretical Computer Science
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
Journal of the ACM (JACM)
Theoretical Computer Science
Parallel Detection of all Palindromes in a String
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Finding Repeats with Fixed Gap
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Palindrome recognition using a multidimensional tape
Theoretical Computer Science
Linear work suffix array construction
Journal of the ACM (JACM)
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
IEEE Transactions on Computers
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Counting and verifying maximal palindromes
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Efficient retrieval of approximate palindromes in a run-length encoded string
Theoretical Computer Science
Theoretical Computer Science
On palindromic sequence automata and applications
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |
We study the problem of finding, in a given word, all maximal gapped palindromes verifying two types of constraints, that we call long-armed and length-constrained palindromes. For each of the two classes, we propose an algorithm that runs in time O(n+S) for a constant-size alphabet, where S is the number of output palindromes. Both algorithms can be extended to compute biological gapped palindromes within the same time bound.