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
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
IEEE Transactions on Computers
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Finding All Approximate Gapped Palindromes
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
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
Hunting redundancies in strings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms
On nested palindromes in clickstream data
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Time-Space trade-offs for longest common extensions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Time-space trade-offs for longest common extensions
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We study the problem of finding, in a given word, all maximalgapped palindromes verifying two types of constraints, that we call long-armedand length-constrainedpalindromes. For both classes, we propose algorithms that run in time O(n+ S), where Sis the number of output palindromes. Both algorithms can be extended to compute biological gapped palindromes within the same time bound.