Artykuł w czasopiśmie
Brak miniatury
Licencja
CC-BY - Uznanie autorstwak-Approximate Quasiperiodicity Under Hamming and Edit Distance
| cris.lastimport.scopus | 2024-02-12T20:22:52Z |
| dc.abstract.en | Quasiperiodicity in strings was introduced almost 30 years ago as an extension of string periodicity. The basic notions of quasiperiodicity are cover and seed. A cover of a text T is a string whose occurrences in T cover all positions of T. A seed of text T is a cover of a superstring of T. In various applications exact quasiperiodicity is still not sufficient due to the presence of errors. We consider approximate notions of quasiperiodicity, for which we allow approximate occurrences in T with a small Hamming, Levenshtein or weighted edit distance. In previous work Sim et al. (J Korea Inf Sci Soc 29(1):16–21, 2002) and Christodoulakis et al. (J Autom Lang Comb 10(5/6), 609–626, 2005) showed that computing approximate covers and seeds, respectively, under weighted edit distance is NP-hard. They, therefore, considered restricted approximate covers and seeds which need to be factors of the original string T and presented polynomial-time algorithms for computing them. Further algorithms, considering approximate occurrences with Hamming distance bounded by k, were given in several contributions by Guth et al. They also studied relaxed approximate quasiperiods. We present more efficient algorithms for computing restricted approximate covers and seeds. In particular, we improve upon the complexities of many of the aforementioned algorithms, also for relaxed quasiperiods. Our solutions are especially efficient if the number (or total cost) of allowed errors is small. We also show conditional lower bounds for computing restricted approximate covers and prove NP-hardness of computing non-restricted approximate covers and seeds under the Hamming distance. |
| dc.affiliation | Uniwersytet Warszawski |
| dc.contributor.author | Radoszewski, Jakub |
| dc.contributor.author | Kędzierski, Andrzej |
| dc.date.accessioned | 2024-01-25T04:46:21Z |
| dc.date.available | 2024-01-25T04:46:21Z |
| dc.date.copyright | 2021-06-22 |
| dc.date.issued | 2022 |
| dc.description.accesstime | AT_PUBLICATION |
| dc.description.finance | Publikacja bezkosztowa |
| dc.description.number | 3 |
| dc.description.version | FINAL_PUBLISHED |
| dc.description.volume | 84 |
| dc.identifier.doi | 10.1007/S00453-021-00842-7 |
| dc.identifier.issn | 0178-4617 |
| dc.identifier.uri | https://repozytorium.uw.edu.pl//handle/item/110251 |
| dc.identifier.weblink | https://link.springer.com/content/pdf/10.1007/s00453-021-00842-7.pdf |
| dc.language | eng |
| dc.pbn.affiliation | computer and information sciences |
| dc.relation.ispartof | Algorithmica |
| dc.relation.pages | 566-589 |
| dc.rights | CC-BY |
| dc.sciencecloud | nosend |
| dc.subject.en | Quasiperiodicity |
| dc.subject.en | Approximate cover |
| dc.subject.en | Approximate seed |
| dc.subject.en | Hamming distance |
| dc.subject.en | Edit distance |
| dc.title | k-Approximate Quasiperiodicity Under Hamming and Edit Distance |
| dc.type | JournalArticle |
| dspace.entity.type | Publication |