Skip to Main content Skip to Navigation
Conference papers

Finding the Anticover of a String

Abstract : A k-anticover of a string x is a set of pairwise distinct factors of x of equal length k, such that every symbol of x is contained into an occurrence of at least one of those factors. The existence of a k-anticover can be seen as a notion of non-redundancy, which has application in computational biology, where they are associated with various non-regulatory mechanisms. In this paper we address the complexity of the problem of finding a k-anticover of a string x if it exists, showing that the decision problem is NP-complete on general strings for k ≥ 3. We also show that the problem admits a polynomial-time solution for k = 2. For unbounded k, we provide an exact exponential algorithm to find a k-anticover of a string of length n (or determine that none exists), which runs in O*(min{3 n−k 3 , (k(k+1) 2) n k+1}) time using polynomial space.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-02957658
Contributor : Marie-France Sagot <>
Submitted on : Monday, October 5, 2020 - 12:32:33 PM
Last modification on : Wednesday, October 14, 2020 - 3:53:34 AM

File

LIPIcs-CPM-2020-2.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas Iliopoulos, et al.. Finding the Anticover of a String. 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020, Copenhagen, Denmark. ⟨10.4230/LIPIcs.CPM.2020.2⟩. ⟨hal-02957658⟩

Share

Metrics

Record views

10

Files downloads

51