Zobrazeno 1 - 10
of 760
pro vyhledávání: '"Cenzato"'
Autor:
Becker, Ruben, Cenzato, Davide, Kim, Sung-Hwan, Kociumaka, Tomasz, Kodric, Bojana, Policriti, Alberto, Prezza, Nicola
Co-lex partial orders were recently introduced in (Cotumaccio et al., SODA 2021 and JACM 2023) as a powerful tool to index finite state automata, with applications to regular expression matching. They generalize Wheeler orders (Gagie et al., Theoreti
Externí odkaz:
http://arxiv.org/abs/2410.04771
Let T in \Sigma^n be a text over alphabet \Sigma. A suffixient set S \subseteq [n] for T is a set of positions such that, for every one-character right-extension T[i,j] of every right-maximal substring T[i,j-1] of T, there exists x in S such that T[i
Externí odkaz:
http://arxiv.org/abs/2407.18753
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
Autor:
Shahnawaz Khijmatgar, Josh Yong, Nicole Rübsamen, Felice Lorusso, Pooja Rai, Niccolo Cenzato, Franscesca Gaffuri, Massimo Del Fabbro, Gianluca Martino Tartaglia
Publikováno v:
Japanese Dental Science Review, Vol 60, Iss , Pp 32-39 (2024)
Oral cancer became a very common condition. WHO estimates that there are 4 cases of lip and oral cavity cancer for every 100,000 people worldwide. The early diagnosis of cancers is currently a top focus in the health sector. Recent systematic reviews
Externí odkaz:
https://doaj.org/article/51858ac9b40048589a1c876da4d60be1
It is known that the exact form of the Burrows-Wheeler-Transform (BWT) of a string collection depends, in most implementations, on the input order of the strings in the collection. Reordering strings of an input collection affects the number of equal
Externí odkaz:
http://arxiv.org/abs/2212.01156
Autor:
Cenzato, Davide, Lipták, Zsuzsanna
In recent years, the focus of bioinformatics research has moved from individual sequences to collections of sequences. Given the fundamental role of the Burrows-Wheeler Transform (BWT) in string processing, a number of dedicated tools have been devel
Externí odkaz:
http://arxiv.org/abs/2202.13235