Zobrazeno 1 - 10
of 2 067
pro vyhledávání: '"Kim, Sung-Hwan"'
An index on a finite-state automaton is a data structure able to locate specific patterns on the automaton's paths and consequently on the regular language accepted by the automaton itself. Cotumaccio and Prezza [SODA '21], introduced a data structur
Externí odkaz:
http://arxiv.org/abs/2406.02763
Autor:
Alanko, Jarno, Cenzato, Davide, Cotumaccio, Nicola, Kim, Sung-Hwan, Manzini, Giovanni, Prezza, Nicola
The LCP array is an important tool in stringology, allowing to speed up pattern matching algorithms and enabling compact representations of the suffix tree. Recently, Conte et al. [DCC 2023] and Cotumaccio et al. [SPIRE 2023] extended the definition
Externí odkaz:
http://arxiv.org/abs/2404.14235
Autor:
Becker, Ruben, Canton, Matteo, Cenzato, Davide, Kim, Sung-Hwan, Kodric, Bojana, Prezza, Nicola
We initiate the study of sub-linear sketching and streaming techniques for estimating the output size of common dictionary compressors such as Lempel-Ziv '77, the run-length Burrows-Wheeler transform, and grammar compression. To this end, we focus on
Externí odkaz:
http://arxiv.org/abs/2310.17980
Autor:
Becker, Ruben, Cenzato, Davide, Kim, Sung-Hwan, Kodric, Bojana, Maso, Riccardo, Prezza, Nicola
Wheeler automata were introduced in 2017 as a tool to generalize existing indexing and compression techniques based on the Burrows-Wheeler transform. Intuitively, an automaton is said to be Wheeler if there exists a total order on its states reflecti
Externí odkaz:
http://arxiv.org/abs/2307.07267
Autor:
Becker, Ruben, Cenzato, Davide, Kim, Sung-Hwan, Kodric, Bojana, Policriti, Alberto, Prezza, Nicola
A Wheeler automaton is a finite state automaton whose states admit a total Wheeler order, reflecting the co-lexicographic order of the strings labeling source-to-node paths. A Wheeler language is a regular language admitting an accepting Wheeler auto
Externí odkaz:
http://arxiv.org/abs/2306.04737
Autor:
Becker, Ruben, Cáceres, Manuel, Cenzato, Davide, Kim, Sung-Hwan, Kodric, Bojana, Olivares, Francisco, Prezza, Nicola
Wheeler nondeterministic finite automata (WNFAs) were introduced as a generalization of prefix sorting from strings to labeled graphs. WNFAs admit optimal solutions to classic hard problems on labeled graphs and languages. The problem of deciding whe
Externí odkaz:
http://arxiv.org/abs/2305.05129
Sorting is a fundamental algorithmic pre-processing technique which often allows to represent data more compactly and, at the same time, speeds up search queries on it. In this paper, we focus on the well-studied problem of sorting and indexing strin
Externí odkaz:
http://arxiv.org/abs/2304.10962
Publikováno v:
In Toxicology June 2024 505
Publikováno v:
In Corrosion Science 15 May 2024 232
Autor:
Cho, Yoon, Jeon, Seulgi, Kim, Sung-Hwan, Kim, Hyeon-Young, Kim, Bumseok, Yang, Mi-Jin, Rho, Jinhyung, Lee, Moo-Yeol, Lee, Kyuhong, Kim, Min-Seok
Publikováno v:
In Heliyon 15 February 2024 10(3)