Zobrazeno 1 - 10
of 89
pro vyhledávání: '"Previtali, Marco"'
Autor:
Bonizzoni, Paola, Costantini, Matteo, De Felice, Clelia, Petescia, Alessia, Pirola, Yuri, Previtali, Marco, Rizzi, Raffaella, Stoye, Jens, Zaccagnino, Rocco, Zizza, Rosalba
Publikováno v:
Information Sciences 607 (2022) 458-476
Feature embedding methods have been proposed in literature to represent sequences as numeric vectors to be used in some bioinformatics investigations, such as family classification and protein structure prediction. Recent theoretical results showed t
Externí odkaz:
http://arxiv.org/abs/2202.13884
Autor:
Genco, Alessio, Ciantia, Matteo Oryem, Previtali, Marco, Brown, Michael, Ivanovic, Ana, Cresswell, Nick, Twomey, Vincent
Publikováno v:
In Computers and Geotechnics September 2024 173
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.
Publikováno v:
E3S Web of Conferences, Vol 544, p 05007 (2024)
Particle rolling is an essential microscopic mechanism that governs macroscopic behavior. This study conducts biaxial shearing tests on bi-dispersed circular discs at different confining pressures. A novel 2D image analysis technique is employed to m
Externí odkaz:
https://doaj.org/article/43ba25cff16441c394d5afdcf05015cc
Indexing very large collections of strings, such as those produced by the widespread next generation sequencing technologies, heavily relies on multistring generalization of the Burrows-Wheeler Transform (BWT): large requirements of in-memory approac
Externí odkaz:
http://arxiv.org/abs/1705.07756
Autor:
Bonizzoni, Paola, Della Vedova, Gianluca, Nicosia, Serena, Previtali, Marco, Rizzi, Raffaella
Indexing of very large collections of strings such as those produced by the widespread sequencing technologies, heavily relies on multi-string generalizations of the Burrows-Wheeler Transform (BWT), and for this problem various in-memory algorithms h
Externí odkaz:
http://arxiv.org/abs/1607.08342
We present a space- and time-efficient fully dynamic implementation de Bruijn graphs, which can also support fixed-length jumbled pattern matching.
Comment: Presented at the 23rd edition of the International Symposium on String Processing and In
Comment: Presented at the 23rd edition of the International Symposium on String Processing and In
Externí odkaz:
http://arxiv.org/abs/1607.04909
The string graph for a collection of next-generation reads is a lossless data representation that is fundamental for de novo assemblers based on the overlap-layout-consensus paradigm. In this paper, we explore a novel approach to compute the string g
Externí odkaz:
http://arxiv.org/abs/1604.03587
Some recent results have introduced external-memory algorithms to compute self-indexes of a set of strings, mainly via computing the Burrows-Wheeler Transform (BWT) of the input strings. The motivations for those results stem from Bioinformatics, whe
Externí odkaz:
http://arxiv.org/abs/1405.7520
Publikováno v:
In iScience 30 August 2019 18:20-27