Metraipolis › archive › dc_a49c2be44cb6

Bloom filters in bioinformatics — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Bloom_filters_in_bioinformatics
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T17:03:08.081Z
SHA-256 of the archived text
10b349c27b9fecfa37cff67ab15398dbebe3fa641b9ffe99917ac7faa84579f1
Stable URL of this page
https://metraipolis.com/documento/dc_a49c2be44cb6

How to cite

Bloom filters in bioinformatics — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Bloom_filters_in_bioinformatics (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a49c2be44cb6 (Metraipolis archive dc_a49c2be44cb6, sha256 10b349c27b9fecfa37cff67ab15398dbebe3fa641b9ffe99917ac7faa84579f1)
BibTeX
@misc{dca49c2be44cb6,
  title = {Bloom filters in bioinformatics — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Bloom_filters_in_bioinformatics},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a49c2be44cb6; sha256 10b349c27b9fecfa37cff67ab15398dbebe3fa641b9ffe99917ac7faa84579f1},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Bloom_filters_in_bioinformatics. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Bloom filters are space-efficient probabilistic data structures used to test whether an element is a part of a set. Bloom filters require much less space than other data structures for representing sets, however the downside of Bloom filters is that there is a false positive rate when querying the data structure. Since multiple elements may have the same hash values for a number of hash functions, then there is a probability that querying for a non-existent element may return a positive if another element with the same hash values has been added to the Bloom filter. Assuming that the hash function has equal probability of selecting any index of the Bloom filter, the false positive rate of querying a Bloom filter is a function of the number of bits, number of hash functions and number of elements of the Bloom filter. This allows the user to manage the risk of a getting a false positive by compromising on the space benefits of the Bloom filter. Bloom filters are primarily used in bioinformatics to test the existence of a k-mer in a sequence or set of sequences. The k-mers of the sequence are indexed in a Bloom filter, and any k-mer of the same size can be queried against the Bloom filter. This is a preferable alternative to hashing the k-mers of a sequence with a hash table, particularly when the sequence is very long, since it is very demanding to store large numbers of k-mers in memory.

Tema degli esploratori: scienze della vita e salute (deposito sistematico; categoria «Bioinformatics»).
Fonte: Wikipedia in inglese, voce «Bloom filters in bioinformatics» — https://en.wikipedia.org/wiki/Bloom_filters_in_bioinformatics
Wikidata Q65079150 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q65079150
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Bloom_filters_in_bioinformatics?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1320507682, consultata il 2026-10-06T15:27:58.786Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: fbc8b71b4a3a325ccce97a5cd350e176712a1c0482a3f385b29c3ee288043e9b