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 | |
| State | Published - Jan 2023 |
Bibliographical note
Funding Information: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.
Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- 2d corner sharing tandem
- Double string
- Scaled tandem repeat
- Tandem repeat