Double String Tandem Repeats

Amihood Amir; Ayelet Butman; Gad M. Landau; Shoshana Marcus; Dina Sokol

doi:10.1007/s00453-022-01016-9

Double String Tandem Repeats

Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

A tandem repeat is an occurrence of two adjacent identical substrings. In this paper, we introduce the notion of a double string, which consists of two parallel strings, and we study the problem of locating all tandem repeats in a double string. The problem introduced here has applications beyond actual double strings, as we illustrate by solving two different problems with the algorithm of the double string tandem repeats problem. The first problem is that of finding all corner-sharing tandems in a 2-dimensional text, defined by Apostolico and Brimkov. The second problem is that of finding all scaled tandem repeats in a 1d text, where a scaled tandem repeat is defined as a string UU^′ such that U^′ is discrete scale of U. In addition to the algorithms for exact tandem repeats, we also present algorithms that solve the problem in the inexact sense, allowing up to k mismatches. We believe that this framework will open a new perspective for other problems in the future.

Original language	English
Pages (from-to)	170-187
Number of pages	18
Journal	Algorithmica
Volume	85
Issue number	1
DOIs	https://doi.org/10.1007/s00453-022-01016-9
State	Published - Jan 2023

Bibliographical note

Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

Funding

The authors A. Amir and G. M. Landau have been partially supported by Grant No. 2018141 from the United States-Israel Binational Science Foundation (BSF) and Israel Science Foundation Grant 1475-18. D. Sokol was also partially supported by BSF Grant No. 2018141. S. Marcus was partially supported by the Professional Staff Congress City University of New York Research Award 63164-00 51.

Funders	Funder number
Professional Staff Congress City University of New York
Bloom's Syndrome Foundation
Research Foundation of The City University of New York	63164-00 51
United States - Israel Binational Science Foundation
United States-Israel Binational Science Foundation	2018141
Israel Science Foundation	1475-18

Keywords

2d corner sharing tandem
Double string
Scaled tandem repeat
Tandem repeat

Access to Document

10.1007/s00453-022-01016-9

Cite this

@article{9d90ad2f474e4beea48ea94f6f2e0e49,

title = "Double String Tandem Repeats",

abstract = "A tandem repeat is an occurrence of two adjacent identical substrings. In this paper, we introduce the notion of a double string, which consists of two parallel strings, and we study the problem of locating all tandem repeats in a double string. The problem introduced here has applications beyond actual double strings, as we illustrate by solving two different problems with the algorithm of the double string tandem repeats problem. The first problem is that of finding all corner-sharing tandems in a 2-dimensional text, defined by Apostolico and Brimkov. The second problem is that of finding all scaled tandem repeats in a 1d text, where a scaled tandem repeat is defined as a string UU′ such that U′ is discrete scale of U. In addition to the algorithms for exact tandem repeats, we also present algorithms that solve the problem in the inexact sense, allowing up to k mismatches. We believe that this framework will open a new perspective for other problems in the future.",

keywords = "2d corner sharing tandem, Double string, Scaled tandem repeat, Tandem repeat",

author = "Amihood Amir and Ayelet Butman and Landau, {Gad M.} and Shoshana Marcus and Dina Sokol",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2023",

month = jan,

doi = "10.1007/s00453-022-01016-9",

language = "אנגלית",

volume = "85",

pages = "170--187",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Double String Tandem Repeats

AU - Amir, Amihood

AU - Butman, Ayelet

AU - Landau, Gad M.

AU - Marcus, Shoshana

AU - Sokol, Dina

PY - 2023/1

Y1 - 2023/1

N2 - A tandem repeat is an occurrence of two adjacent identical substrings. In this paper, we introduce the notion of a double string, which consists of two parallel strings, and we study the problem of locating all tandem repeats in a double string. The problem introduced here has applications beyond actual double strings, as we illustrate by solving two different problems with the algorithm of the double string tandem repeats problem. The first problem is that of finding all corner-sharing tandems in a 2-dimensional text, defined by Apostolico and Brimkov. The second problem is that of finding all scaled tandem repeats in a 1d text, where a scaled tandem repeat is defined as a string UU′ such that U′ is discrete scale of U. In addition to the algorithms for exact tandem repeats, we also present algorithms that solve the problem in the inexact sense, allowing up to k mismatches. We believe that this framework will open a new perspective for other problems in the future.

AB - A tandem repeat is an occurrence of two adjacent identical substrings. In this paper, we introduce the notion of a double string, which consists of two parallel strings, and we study the problem of locating all tandem repeats in a double string. The problem introduced here has applications beyond actual double strings, as we illustrate by solving two different problems with the algorithm of the double string tandem repeats problem. The first problem is that of finding all corner-sharing tandems in a 2-dimensional text, defined by Apostolico and Brimkov. The second problem is that of finding all scaled tandem repeats in a 1d text, where a scaled tandem repeat is defined as a string UU′ such that U′ is discrete scale of U. In addition to the algorithms for exact tandem repeats, we also present algorithms that solve the problem in the inexact sense, allowing up to k mismatches. We believe that this framework will open a new perspective for other problems in the future.

KW - 2d corner sharing tandem

KW - Double string

KW - Scaled tandem repeat

KW - Tandem repeat

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

U2 - 10.1007/s00453-022-01016-9

DO - 10.1007/s00453-022-01016-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85135821513

SN - 0178-4617

VL - 85

SP - 170

EP - 187

JO - Algorithmica

JF - Algorithmica

IS - 1

ER -

Double String Tandem Repeats

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this