Approximating the Anticover of a String

Amihood Amir; Itai Boneh; Eitan Kondratovsky

doi:10.1007/978-3-030-59212-7_8

Approximating the Anticover of a String

Amihood Amir, Itai Boneh, Eitan Kondratovsky

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

The k-anticover of a string S is a set of distinct k-length substrings such that every index in S is contained in one of these substrings. The existence of an anticover indicates a lack of structure in S. It was recently proven by Alzamel et al. [2] that finding whether or not a k-anticover exists is-Hard for. In this paper, we extend the definition to provide three optimization versions for the k-anticover problem. We provide efficient approximation algorithms for these problems.

Original language	English
Title of host publication	String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings
Editors	Christina Boucher, Sharma V. Thankachan
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	99-114
Number of pages	16
ISBN (Print)	9783030592110
DOIs	https://doi.org/10.1007/978-3-030-59212-7_8
State	Published - 2020
Event	27th International Symposium on String Processing and Information Retrieval, SPIRE 2020 - Orlando, United States Duration: 13 Oct 2020 → 15 Oct 2020

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12303 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	27th International Symposium on String Processing and Information Retrieval, SPIRE 2020
Country/Territory	United States
City	Orlando
Period	13/10/20 → 15/10/20

Bibliographical note

Publisher Copyright:
© 2020, Springer Nature Switzerland AG.

Funding

This work was partially supported by ISF grant 1475/18 and BSF grant 2018141. This work is part of the second author’s Ph.D. dissertation.

Funders	Funder number
United States-Israel Binational Science Foundation	2018141
Israel Science Foundation	1475/18

Keywords

Anticover
Approximation algorithms
NP-hardness

Access to Document

10.1007/978-3-030-59212-7_8

Cite this

Amir, A., Boneh, I., & Kondratovsky, E. (2020). Approximating the Anticover of a String. In C. Boucher, & S. V. Thankachan (Eds.), String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings (pp. 99-114). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12303 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-59212-7_8

Amir, Amihood ; Boneh, Itai ; Kondratovsky, Eitan. / Approximating the Anticover of a String. String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings. editor / Christina Boucher ; Sharma V. Thankachan. Springer Science and Business Media Deutschland GmbH, 2020. pp. 99-114 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b6602caf8e1f41eaa73fb64349c0f227,

title = "Approximating the Anticover of a String",

abstract = "The k-anticover of a string S is a set of distinct k-length substrings such that every index in S is contained in one of these substrings. The existence of an anticover indicates a lack of structure in S. It was recently proven by Alzamel et al. [2] that finding whether or not a k-anticover exists is-Hard for. In this paper, we extend the definition to provide three optimization versions for the k-anticover problem. We provide efficient approximation algorithms for these problems.",

keywords = "Anticover, Approximation algorithms, NP-hardness",

author = "Amihood Amir and Itai Boneh and Eitan Kondratovsky",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 27th International Symposium on String Processing and Information Retrieval, SPIRE 2020 ; Conference date: 13-10-2020 Through 15-10-2020",

year = "2020",

doi = "10.1007/978-3-030-59212-7_8",

language = "אנגלית",

isbn = "9783030592110",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "99--114",

editor = "Christina Boucher and Thankachan, {Sharma V.}",

booktitle = "String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings",

address = "גרמניה",

}

Amir, A, Boneh, I & Kondratovsky, E 2020, Approximating the Anticover of a String. in C Boucher & SV Thankachan (eds), String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12303 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 99-114, 27th International Symposium on String Processing and Information Retrieval, SPIRE 2020, Orlando, United States, 13/10/20. https://doi.org/10.1007/978-3-030-59212-7_8

Approximating the Anticover of a String. / Amir, Amihood; Boneh, Itai; Kondratovsky, Eitan.
String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings. ed. / Christina Boucher; Sharma V. Thankachan. Springer Science and Business Media Deutschland GmbH, 2020. p. 99-114 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12303 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Approximating the Anticover of a String

AU - Amir, Amihood

AU - Boneh, Itai

AU - Kondratovsky, Eitan

PY - 2020

Y1 - 2020

N2 - The k-anticover of a string S is a set of distinct k-length substrings such that every index in S is contained in one of these substrings. The existence of an anticover indicates a lack of structure in S. It was recently proven by Alzamel et al. [2] that finding whether or not a k-anticover exists is-Hard for. In this paper, we extend the definition to provide three optimization versions for the k-anticover problem. We provide efficient approximation algorithms for these problems.

AB - The k-anticover of a string S is a set of distinct k-length substrings such that every index in S is contained in one of these substrings. The existence of an anticover indicates a lack of structure in S. It was recently proven by Alzamel et al. [2] that finding whether or not a k-anticover exists is-Hard for. In this paper, we extend the definition to provide three optimization versions for the k-anticover problem. We provide efficient approximation algorithms for these problems.

KW - Anticover

KW - Approximation algorithms

KW - NP-hardness

UR - http://www.scopus.com/inward/record.url?scp=85092077709&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-59212-7_8

DO - 10.1007/978-3-030-59212-7_8

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85092077709

SN - 9783030592110

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 99

EP - 114

BT - String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings

A2 - Boucher, Christina

A2 - Thankachan, Sharma V.

PB - Springer Science and Business Media Deutschland GmbH

T2 - 27th International Symposium on String Processing and Information Retrieval, SPIRE 2020

Y2 - 13 October 2020 through 15 October 2020

ER -

Amir A, Boneh I, Kondratovsky E. Approximating the Anticover of a String. In Boucher C, Thankachan SV, editors, String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings. Springer Science and Business Media Deutschland GmbH. 2020. p. 99-114. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-59212-7_8

Approximating the Anticover of a String

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this