A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Searching for gapped palindromes
2009
Theoretical Computer Science
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 constantsize alphabet, where S is the number of output palindromes. Both algorithms can be extended to compute biological gapped palindromes within the same time bound.
doi:10.1016/j.tcs.2009.09.013
fatcat:7ge3eh4a4fg77bhyeg7ltqkyqe