文章基本信息

标题：Finding the Anticover of a String
本地全文：下载
作者：Mai Alzamel ; Alessio Conte ; Shuhei Denzumi 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2020
卷号：161
页码：2:1-2:11
DOI：10.4230/LIPIcs.CPM.2020.2
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Anticover; String algorithms; Stringology; NP-complete