Small Longest Tandem Scattered Subsequences
We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string. This algorithm is based on the Hunt-Szymanski algorithm, therefore its performance improves if the string is not self s...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Alexandru Ioan Cuza University of Iasi
2021-08-01
|
| Series: | Scientific Annals of Computer Science |
| Subjects: | |
| Online Access: | https://www.info.uaic.ro/en/sacs_articles/small-longest-tandem-scattered-subsequences/ |
| Summary: | We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string. This algorithm is based on the Hunt-Szymanski algorithm, therefore its performance improves if the string is not self similar, which occurs naturally on strings over large alphabets. Our algorithm relies on new results for data structures that support dynamic longest increasing sub-sequences. In the process we also obtain improved algorithms for the decremental string comparison problem. |
|---|---|
| ISSN: | 1843-8121 2248-2695 |