- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1471-2105
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Creator
-
Páll Melsted
- Contributor
-
Pritchard, Jonathan K.
SpringerLink (Online service)
- DOI
-
10.1186/1471-2105-12-333
- URN
-
urn:nbn:de:1111-2016021726268
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:26 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Páll Melsted
- Pritchard, Jonathan K.
- SpringerLink (Online service)
Other Objects (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