Cargando…
kmtricks: efficient and flexible construction of Bloom filters for large sequencing data collections
SUMMARY: When indexing large collections of short-read sequencing data, a common operation that has now been implemented in several tools (Sequence Bloom Trees and variants, BIGSI) is to construct a collection of Bloom filters, one per sample. Each Bloom filter is used to represent a set of k-mers w...
Autores principales: | Lemane, Téo, Medvedev, Paul, Chikhi, Rayan, Peterlongo, Pierre |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9710589/ https://www.ncbi.nlm.nih.gov/pubmed/36699393 http://dx.doi.org/10.1093/bioadv/vbac029 |
Ejemplares similares
-
k
mdiff, large-scale and user-friendly differential k-mer analyses
por: Lemane, Téo, et al.
Publicado: (2022) -
The K-mer File Format: a standardized and compact disk representation of sets of k-mers
por: Dufresne, Yoann, et al.
Publicado: (2022) -
Space-efficient and exact de Bruijn graph representation based on a Bloom filter
por: Chikhi, Rayan, et al.
Publicado: (2013) -
Mapsembler, targeted and micro assembly of large NGS datasets on a desktop computer
por: Peterlongo, Pierre, et al.
Publicado: (2012) -
Data structures based on k-mers for querying large collections of sequencing data sets
por: Marchet, Camille, et al.
Publicado: (2021)