Searching for Gapped Palindromes

  • Roman Kolpakov
  • Gregory Kucherov
Conference paper

DOI: 10.1007/978-3-540-69068-9_5

Volume 5029 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Kolpakov R., Kucherov G. (2008) Searching for Gapped Palindromes. In: Ferragina P., Landau G.M. (eds) Combinatorial Pattern Matching. CPM 2008. Lecture Notes in Computer Science, vol 5029. Springer, Berlin, Heidelberg

Abstract

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 both classes, we propose algorithms that run in time O(n + S), where S is the number of output palindromes. Both algorithms can be extended to compute biological gapped palindromes within the same time bound.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Roman Kolpakov
    • 1
  • Gregory Kucherov
    • 2
  1. 1.Moscow UniversityMoscowRussia
  2. 2.LIFL/CNRS/INRIAParc scientifique de la Haute BorneVilleneuve d’AscqFrance