Cargando…
fimpera: drastic improvement of Approximate Membership Query data-structures with counts
MOTIVATION: High throughput sequencing technologies generate massive amounts of biological sequence datasets as costs fall. One of the current algorithmic challenges for exploiting these data on a global scale consists in providing efficient query engines on these petabyte-scale datasets. Most metho...
Autores principales: | Robidou, Lucas, Peterlongo, Pierre |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10212535/ https://www.ncbi.nlm.nih.gov/pubmed/37195454 http://dx.doi.org/10.1093/bioinformatics/btad305 |
Ejemplares similares
-
Certifying Certainty and Uncertainty in Approximate Membership Query Structures
por: Gopinathan, Kiran, et al.
Publicado: (2020) -
DRASTIC—INSIGHTS: querying information in a plant gene expression database
por: Button, Davina K., et al.
Publicado: (2006) -
Citations that Count, An Editorial Address to the ISCO Membership
por: Meijer, Gerrit A.
Publicado: (2004) -
QoS-Aware Approximate Query Processing for Smart Cities Spatial Data Streams
por: Al Jawarneh, Isam Mashhour, et al.
Publicado: (2021) -
GoM DE: interpreting structure in sequence count data with differential expression analysis allowing for grades of membership
por: Carbonetto, Peter, et al.
Publicado: (2023)