- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1471-2105
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Efficient counting of k-mers in DNA sequences using a bloom filter ; volume:12 ; number:1 ; day:10 ; month:8 ; year:2011 ; pages:1-7 ; date:12.2011
BMC bioinformatics ; 12, Heft 1 (10.8.2011), 1-7, 12.2011
- Urheber
-
Páll Melsted
- Beteiligte Personen und Organisationen
-
Pritchard, Jonathan K.
SpringerLink (Online service)
- DOI
-
10.1186/1471-2105-12-333
- URN
-
urn:nbn:de:1111-2016021726268
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:26 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Páll Melsted
- Pritchard, Jonathan K.
- SpringerLink (Online service)
Ähnliche Objekte (12)
BLOOM: BLoom filter based oblivious outsourced matchings
Bloom filters for molecules
Packet forwarding using improved Bloom filters
Bloom Filters: One Size Fits All?
Replay Attack Detection Using Bloom Filters
Privacy-preserving record linkage using Bloom filters
Hierarchical bloom filter trees for approximate matching
On application of bloom filters to iris biometrics
Counting Cherry Reduction Sequences in Phylogenetic Tree-Child Networks is Counting Linear Extensions
Counting zero-sum sequences with the polynomial method
Hierarchical Interleaved Bloom Filter: enabling ultrafast, approximate sequence queries
Towards Bloom filter-based indexing of iris biometric data
BLOOM: BLoom filter based oblivious outsourced matchings
Bloom filters for molecules
Packet forwarding using improved Bloom filters
Bloom Filters: One Size Fits All?
Replay Attack Detection Using Bloom Filters
Privacy-preserving record linkage using Bloom filters
Hierarchical bloom filter trees for approximate matching
On application of bloom filters to iris biometrics
Counting Cherry Reduction Sequences in Phylogenetic Tree-Child Networks is Counting Linear Extensions
Counting zero-sum sequences with the polynomial method
Hierarchical Interleaved Bloom Filter: enabling ultrafast, approximate sequence queries
Towards Bloom filter-based indexing of iris biometric data
BLOOM: BLoom filter based oblivious outsourced matchings
Bloom filters for molecules
Packet forwarding using improved Bloom filters
Bloom Filters: One Size Fits All?
Replay Attack Detection Using Bloom Filters
Privacy-preserving record linkage using Bloom filters
Hierarchical bloom filter trees for approximate matching
On application of bloom filters to iris biometrics
Counting Cherry Reduction Sequences in Phylogenetic Tree-Child Networks is Counting Linear Extensions
Counting zero-sum sequences with the polynomial method
Hierarchical Interleaved Bloom Filter: enabling ultrafast, approximate sequence queries