Title :

PAC (Partitionned Aggregated bloom Comb trees)

Author(s) :

Marchet, Camille [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Limasset, Antoine [Auteur]
Centre National de la Recherche Scientifique [CNRS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]

English keyword(s) :

AMQ
Data structure
K-mer
Pangenomics

HAL domain(s) :

Informatique [cs]/Algorithme et structure de données [cs.DS]
Sciences du Vivant [q-bio]/Biochimie, Biologie Moléculaire/Génomique, Transcriptomique et Protéomique [q-bio.GN]

English abstract : [en]

PAC is a scalable structure able to list datasets that may contain a query sequence among thousands of indexed files.PAC is an AMQ (Approximate membership Query) structure based on bloom filters like Cobs, or Sequence Bloom ...
Show more >PAC is a scalable structure able to list datasets that may contain a query sequence among thousands of indexed files.PAC is an AMQ (Approximate membership Query) structure based on bloom filters like Cobs, or Sequence Bloom tree tools (HowDeSBT,AllsomeSBT,SSBT,...)A PAC index can be built from thousands datasets quickly and with low resource memory and disk footprint and can deliver very high query throughput.Show less >

Language :

Anglais

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL