A Survey on Shortest Unique Substring Queries

Abedin P., Külekci M. O., Thankachan S.

ALGORITHMS, cilt.13, sa.9, 2020 (ESCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 13 Sayı: 9
  • Basım Tarihi: 2020
  • Doi Numarası: 10.3390/a13090224
  • Dergi Adı: ALGORITHMS
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, Academic Search Premier, Aerospace Database, Communication Abstracts, Compendex, INSPEC, Metadex, zbMATH, Directory of Open Access Journals, Civil Engineering Abstracts
  • İstanbul Teknik Üniversitesi Adresli: Evet

Özet

The shortest unique substring (SUS) problem is an active line of research in the field of string algorithms and has several applications in bioinformatics and information retrieval. The initial version of the problem was proposed by Pei et al. [ICDE'13]. Over the years, many variants and extensions have been pursued, which include positional-SUS, interval-SUS, approximate-SUS, palindromic-SUS, range-SUS, etc. In this article, we highlight some of the key results and summarize the recent developments in this area.