4 citations · 7 across the 4 of their papers we have counts for
4 papers
Enumerative Data Compression with Non-Uniquely Decodable Codes
M. Oğuzhan Külekci, Yasin Öztürk, Elif Altunok +1
Non-uniquely decodable codes can be defined as the codes that cannot be uniquely decoded without additional disambiguation information. These are mainly the class of non-prefix-fre…
On Longest Repeat Queries
Atalay Mert İleri, M. Oğuzhan Külekci, Bojian Xu
Repeat finding in strings has important applications in subfields such as computational biology. Surprisingly, all prior work on repeat finding did not consider the constraint on t…
Efficient Algorithms for the Order Preserving Pattern Matching Problem
Simone Faro, Oğuzhan Külekci
Given a pattern x of length m and a text y of length n, both over an ordered alphabet, the order-preserving pattern matching problem consists in finding all substrings of the text…
Shortest Unique Substring Query Revisited
Atalay Mert İleri, M. Oğuzhan Külekci, Bojian Xu
We revisit the problem of finding shortest unique substring (SUS) proposed recently by [6]. We propose an optimal time and space algorithm that can find an SUS for every loc…