Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Külekci, M. Oğuzhan"'
Autor:
Filiz, Gözde, Külekci, M. Oğuzhan
In the reordering buffer management problem, a sequence of requests must be executed by a service station, where a cost occurs for each pair of consecutive requests with different attributes. A reordering buffer management algorithm aims to permute t
Externí odkaz:
http://arxiv.org/abs/2105.10689
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-free codes, where a codeword can be a prefix of other(s), and thus, the c
Externí odkaz:
http://arxiv.org/abs/1911.05676
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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 the locality of repeats. In this paper, we propose and study the proble
Externí odkaz:
http://arxiv.org/abs/1501.06259
Publikováno v:
In Discrete Applied Mathematics 15 March 2020 274:11-25
We revisit the problem of finding shortest unique substring (SUS) proposed recently by [6]. We propose an optimal $O(n)$ time and space algorithm that can find an SUS for every location of a string of size $n$. Our algorithm significantly improves th
Externí odkaz:
http://arxiv.org/abs/1312.2738
Autor:
Faro, Simone, Külekci, M. Oguzhan
Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biology. In the last two decades a gen
Externí odkaz:
http://arxiv.org/abs/1209.6449
Publikováno v:
In Journal of Discrete Algorithms March 2017 43:18-25
Publikováno v:
In Theoretical Computer Science 11 January 2015 562:621-633
Autor:
Faro, Simone, Külekci, M. Oğuzhan
Publikováno v:
In Journal of Discrete Algorithms September 2014 28:61-72