On shortest common superstring and swap permutations

Zvi Gotthilf; Moshe Lewenstein; Alexandru Popa

doi:10.1007/978-3-642-16321-0_28

On shortest common superstring and swap permutations

Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa

Department of Computer Science

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

7 Scopus citations

Abstract

The Shortest Common Superstring (SCS) is a well studied problem, having a wide range of applications. In this paper we consider two problems closely related to it. First we define the Swapped Restricted Superstring(SRS) problem, where we are given a set S of n strings, s₁, s₂, ..., s_n , and a text T=t₁ t₂ ...t_m , and our goal is to find a swap permutation π: {1, ..., m} →{1, ..., m} to maximize the number of strings in S that are substrings of t_π(1) t_π(2)...t_π(m). We then show that the SRS problem is NP-Complete. Afterwards, we consider a similar variant denoted SRSR, where our goal is to find a swap permutation π: {1, ..., m} →{1, ..., m} to maximize the total number of times that the strings of S appear in t _π(1) t_π(2)...t_π(m) (we can count the same string s_i as a substring of t_π(1) t _π(2)...t_π(m) more than once). For this problem, we present a polynomial time exact algorithm.

Original language	English
Title of host publication	String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings
Pages	270-278
Number of pages	9
DOIs	https://doi.org/10.1007/978-3-642-16321-0_28
State	Published - 2010
Event	17th International Symposium on String Processing and Information Retrieval, SPIRE 2010 - Los Cabos, Mexico Duration: 11 Oct 2010 → 13 Oct 2010

Publication series

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

Conference

Conference	17th International Symposium on String Processing and Information Retrieval, SPIRE 2010
Country/Territory	Mexico
City	Los Cabos
Period	11/10/10 → 13/10/10

Bibliographical note

Funding Information:
★ This work was partially supported by the Israel Science Foundation grant 1484/08.

Funding Information:
Acknowledgements. We thank the anonymous reviewers for their useful comments. The third author is funded by an EPSRC PhD studentship.

Funding

★ This work was partially supported by the Israel Science Foundation grant 1484/08. Acknowledgements. We thank the anonymous reviewers for their useful comments. The third author is funded by an EPSRC PhD studentship.

Funders	Funder number
Engineering and Physical Sciences Research Council
Israel Science Foundation	1484/08

Access to Document

10.1007/978-3-642-16321-0_28

Cite this

Gotthilf, Z., Lewenstein, M., & Popa, A. (2010). On shortest common superstring and swap permutations. In String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings (pp. 270-278). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6393 LNCS). https://doi.org/10.1007/978-3-642-16321-0_28

@inproceedings{00ed2dd70af8482a8ced637fc3940939,

title = "On shortest common superstring and swap permutations",

abstract = "The Shortest Common Superstring (SCS) is a well studied problem, having a wide range of applications. In this paper we consider two problems closely related to it. First we define the Swapped Restricted Superstring(SRS) problem, where we are given a set S of n strings, s1, s2, ..., sn , and a text T=t1 t2 ...tm , and our goal is to find a swap permutation π: {1, ..., m} →{1, ..., m} to maximize the number of strings in S that are substrings of tπ(1) tπ(2)...tπ(m). We then show that the SRS problem is NP-Complete. Afterwards, we consider a similar variant denoted SRSR, where our goal is to find a swap permutation π: {1, ..., m} →{1, ..., m} to maximize the total number of times that the strings of S appear in t π(1) tπ(2)...tπ(m) (we can count the same string si as a substring of tπ(1) t π(2)...tπ(m) more than once). For this problem, we present a polynomial time exact algorithm.",

author = "Zvi Gotthilf and Moshe Lewenstein and Alexandru Popa",

note = "Funding Information: ★ This work was partially supported by the Israel Science Foundation grant 1484/08. Funding Information: Acknowledgements. We thank the anonymous reviewers for their useful comments. The third author is funded by an EPSRC PhD studentship.; 17th International Symposium on String Processing and Information Retrieval, SPIRE 2010 ; Conference date: 11-10-2010 Through 13-10-2010",

year = "2010",

doi = "10.1007/978-3-642-16321-0_28",

language = "אנגלית",

isbn = "3642163203",

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

pages = "270--278",

booktitle = "String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings",

}

Gotthilf, Z, Lewenstein, M & Popa, A 2010, On shortest common superstring and swap permutations. in String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6393 LNCS, pp. 270-278, 17th International Symposium on String Processing and Information Retrieval, SPIRE 2010, Los Cabos, Mexico, 11/10/10. https://doi.org/10.1007/978-3-642-16321-0_28

On shortest common superstring and swap permutations. / Gotthilf, Zvi; Lewenstein, Moshe; Popa, Alexandru.
String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. 2010. p. 270-278 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6393 LNCS).

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

TY - GEN

T1 - On shortest common superstring and swap permutations

AU - Gotthilf, Zvi

AU - Lewenstein, Moshe

AU - Popa, Alexandru

N1 - Funding Information: ★ This work was partially supported by the Israel Science Foundation grant 1484/08. Funding Information: Acknowledgements. We thank the anonymous reviewers for their useful comments. The third author is funded by an EPSRC PhD studentship.

PY - 2010

Y1 - 2010

N2 - The Shortest Common Superstring (SCS) is a well studied problem, having a wide range of applications. In this paper we consider two problems closely related to it. First we define the Swapped Restricted Superstring(SRS) problem, where we are given a set S of n strings, s1, s2, ..., sn , and a text T=t1 t2 ...tm , and our goal is to find a swap permutation π: {1, ..., m} →{1, ..., m} to maximize the number of strings in S that are substrings of tπ(1) tπ(2)...tπ(m). We then show that the SRS problem is NP-Complete. Afterwards, we consider a similar variant denoted SRSR, where our goal is to find a swap permutation π: {1, ..., m} →{1, ..., m} to maximize the total number of times that the strings of S appear in t π(1) tπ(2)...tπ(m) (we can count the same string si as a substring of tπ(1) t π(2)...tπ(m) more than once). For this problem, we present a polynomial time exact algorithm.

AB - The Shortest Common Superstring (SCS) is a well studied problem, having a wide range of applications. In this paper we consider two problems closely related to it. First we define the Swapped Restricted Superstring(SRS) problem, where we are given a set S of n strings, s1, s2, ..., sn , and a text T=t1 t2 ...tm , and our goal is to find a swap permutation π: {1, ..., m} →{1, ..., m} to maximize the number of strings in S that are substrings of tπ(1) tπ(2)...tπ(m). We then show that the SRS problem is NP-Complete. Afterwards, we consider a similar variant denoted SRSR, where our goal is to find a swap permutation π: {1, ..., m} →{1, ..., m} to maximize the total number of times that the strings of S appear in t π(1) tπ(2)...tπ(m) (we can count the same string si as a substring of tπ(1) t π(2)...tπ(m) more than once). For this problem, we present a polynomial time exact algorithm.

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

U2 - 10.1007/978-3-642-16321-0_28

DO - 10.1007/978-3-642-16321-0_28

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

AN - SCOPUS:78449306564

SN - 3642163203

SN - 9783642163203

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

SP - 270

EP - 278

BT - String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings

T2 - 17th International Symposium on String Processing and Information Retrieval, SPIRE 2010

Y2 - 11 October 2010 through 13 October 2010

ER -

Gotthilf Z, Lewenstein M, Popa A. On shortest common superstring and swap permutations. In String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. 2010. p. 270-278. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-16321-0_28

On shortest common superstring and swap permutations

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this