Efficient Computation of Clustered-Clumps in Degenerate Strings - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Efficient Computation of Clustered-Clumps in Degenerate Strings

(1) , (1) , (1)
Costas S. Iliopoulos
  • Function : Author
  • PersonId : 1012032
Ritu Kundu
  • Function : Author
  • PersonId : 1012033
Manal Mohamed
  • Function : Author
  • PersonId : 1012034


Given a finite set of patterns, a clustered-clump is a maximal overlapping set of occurrences of such patterns. Several solutions have been presented for identifying clustered-clumps based on statistical, probabilistic, and most recently, formal language theory techniques. Here, motivated by applications in molecular biology and computer vision, we present efficient algorithms, using String Algorithm techniques, to identify clustered-clumps in a given text. The proposed algorithms compute in $$\mathcal {O}(n+m)$$ time the occurrences of all clustered-clumps for a given set of degenerate patterns $$\tilde{\mathcal {P}}$$ and/or degenerate text $$\tilde{T}$$ of total lengths m and n, respectively; such that the total number of non-solid symbols in $$\tilde{\mathcal {P}}$$ and $$\tilde{T}$$ is bounded by a fixed positive integer d.
Fichier principal
Vignette du fichier
430537_1_En_45_Chapter.pdf (151.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01557641 , version 1 (06-07-2017)


Attribution - CC BY 4.0



Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed. Efficient Computation of Clustered-Clumps in Degenerate Strings. 12th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2016, Thessaloniki, Greece. pp.510-519, ⟨10.1007/978-3-319-44944-9_45⟩. ⟨hal-01557641⟩
66 View
117 Download



Gmail Facebook Twitter LinkedIn More