Basit öğe kaydını göster

dc.contributor.authorİleri, Atalay Mert
dc.contributor.authorKülekçi, Muhammed Oǧuzhan
dc.contributor.authorXu, Bojian
dc.date.accessioned10.07.201910:49:13
dc.date.accessioned2019-07-10T20:03:15Z
dc.date.available10.07.201910:49:13
dc.date.available2019-07-10T20:03:15Z
dc.date.issued2015en_US
dc.identifier.citationAtalay İleri, M., Külekçi, M. O. ve Xu, B. (2015). A simple yet time-optimal and linear-space algorithm for shortest unique substring queries. Theoretical Computer Science, 562, 621-633. https://dx.doi.org/10.1016/j.tcs.2014.11.004en_US
dc.identifier.issn0304-3975
dc.identifier.issn1879-2294
dc.identifier.urihttps://dx.doi.org/10.1016/j.tcs.2014.11.004
dc.identifier.urihttps://hdl.handle.net/20.500.12511/3838
dc.descriptionWOS: 000347602000043en_US
dc.description.abstractWe revisit the problem of finding shortest unique substring (SUS) proposed recently by Pei et al. (2013) [12]. We propose an optimal O(n) time and space algorithm that can find an SUS for every location of a string of size n and thus significantly improve their O(n(2)) time complexity. Our method also supports finding all the SUSes covering every location, whereas theirs can find only one SUS for every location. Further, our solution is simpler and easier to implement and is more space efficient in practice, since we only use the inverse suffix array and the longest common prefix array of the string, while their algorithm uses the suffix tree of the string and other auxiliary data structures. Our theoretical results are validated by an empirical study with real-world data that shows our method is at least 8 times faster and uses at least 20 times less memory. The speedup gained by our method against Pei et al's can become even more significant when the string size increases due to their quadratic time complexity. We also have compared our method with the recent Tsuruta et al.'s (2014) [14] proposal, another independent 0(n) time and space algorithm for SUS finding. The empirical study shows that both methods have nearly the same processing speed. However, ours uses at least 4 times less memory for finding one SUS and at least 2 times less memory for finding all SUSes, both covering every string location.en_US
dc.description.sponsorshipEWU's Faculty Grants for Research and Creative Worksen_US
dc.description.sponsorshipSupported in part by EWU's Faculty Grants for Research and Creative Works.en_US
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectUnique Substringen_US
dc.subjectShortest Unique Substringen_US
dc.subjectRepetitivenessen_US
dc.subjectRegularityen_US
dc.titleA simple yet time-optimal and linear-space algorithm for shortest unique substring queriesen_US
dc.typearticleen_US
dc.relation.ispartofTheoretical Computer Scienceen_US
dc.departmentİstanbul Medipol Üniversitesi, Mühendislik ve Doğa Bilimleri Fakültesi, Biyomedikal Mühendisliği Bölümüen_US
dc.identifier.volume562en_US
dc.identifier.startpage621en_US
dc.identifier.endpage633en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.doi10.1016/j.tcs.2014.11.004en_US
dc.identifier.wosqualityQ4en_US
dc.identifier.scopusqualityQ1en_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster