Zobrazeno 1 - 10
of 233
pro vyhledávání: '"Masillo, A"'
We consider the problem of maintaining a collection of strings while efficiently supporting splits and concatenations on them, as well as comparing two substrings, and computing the longest common prefix between two suffixes. This problem can be solv
Externí odkaz:
http://arxiv.org/abs/2403.13162
Despite consistently yielding the best compression on repetitive text collections, the Lempel-Ziv parsing has resisted all attempts at offering relevant guarantees on the cost to access an arbitrary symbol. This makes it less attractive for use on co
Externí odkaz:
http://arxiv.org/abs/2403.09893
We present a new data structure for maintaining dynamic permutations, which we call a $\textit{forest of splay trees (FST)}$. The FST allows one to efficiently maintain the cycle structure of a permutation $\pi$ when the allowed updates are transposi
Externí odkaz:
http://arxiv.org/abs/2306.04470
Autor:
Masillo, Francesco
Due to the exponential growth of genomic data, constructing dedicated data structures has become the principal bottleneck in common bioinformatics applications. In particular, the Burrows-Wheeler Transform (BWT) is the basis of some of the most popul
Externí odkaz:
http://arxiv.org/abs/2305.07319
Publikováno v:
Lipt\'ak, Zs., Masillo, F. & Puglisi, S.J. Suffix sorting via matching statistics. Algorithms Mol Biol 19, 11 (2024)
We introduce a new algorithm for constructing the generalized suffix array of a collection of highly similar strings. As a first step, we construct a compressed representation of the matching statistics of the collection with respect to a reference s
Externí odkaz:
http://arxiv.org/abs/2207.00972
Publikováno v:
Algorithms for Molecular Biology, Vol 19, Iss 1, Pp 1-18 (2024)
Abstract We introduce a new algorithm for constructing the generalized suffix array of a collection of highly similar strings. As a first step, we construct a compressed representation of the matching statistics of the collection with respect to a re
Externí odkaz:
https://doaj.org/article/50be11581b2245a7939b0057c8245f12
Publikováno v:
In Vacuum January 2024 219 Part A
Autor:
Paola Masillo, Sabrina Machetti
Publikováno v:
Italiano LinguaDue, Vol 15, Iss 2 (2023)
Il contributo illustra uno studio sviluppato a partire da due progetti realizzati in due diversi contesti della scuola primaria: il primo, in cui il plurilinguismo rappresenta un fatto sociale (Provincia Autonoma di Bolzano); il secondo, in cui il pl
Externí odkaz:
https://doaj.org/article/49b4b14ed8424585a7ed9be24ce04dbe
Publikováno v:
Theoretical Computer Science 857: 123-146 (2021)
The Burrows-Wheeler-Transform (BWT) is a reversible string transformation which plays a central role in text compression and is fundamental in many modern bioinformatics applications. The BWT is a permutation of the characters, which is in general be
Externí odkaz:
http://arxiv.org/abs/1908.09125
Autor:
Lipták, Zsuzsanna1 (AUTHOR), Masillo, Francesco1 (AUTHOR), Puglisi, Simon J.2,3 (AUTHOR) simon.puglisi@helsinki.fi
Publikováno v:
Algorithms for Molecular Biology. 3/12/2024, Vol. 19 Issue 1, p1-18. 18p.