Efficient counting of k-mers in DNA sequences using a bloom filter

被引：0
|
作者：
Páll Melsted
Jonathan K Pritchard
机构：
[1] The University of Chicago,Department of Human Genetics
[2] The University of Chicago,Howard Hughes Medical Institute
来源：
BMC Bioinformatics | / 12卷
关键词：
Hash Function; Hash Table; Memory Usage; Bloom Filter; False Positive Ratio;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Efficient counting of k-mers in DNA sequences using a bloom filter
    Melsted, Pall
    Pritchard, Jonathan K.
    [J]. BMC BIOINFORMATICS, 2011, 12
  • [2] Efficient Mining Closed k-mers from DNA and Protein Sequences
    Zhang, Jingsong
    Bi, Cheng
    Wang, Yinglin
    Zeng, Tao
    Liao, Bo
    Chen, Luonan
    [J]. 2020 IEEE INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (BIGCOMP 2020), 2020, : 342 - 349
  • [3] Mining Discriminative K-Mers in DNA Sequences Using Sketches and Hardware Acceleration
    Saavedra, Antonio
    Lehnert, Hans
    Hernandez, Cecilia
    Carvajal, Gonzalo
    Figueroa, Miguel
    [J]. IEEE ACCESS, 2020, 8 : 114715 - 114732
  • [4] Scheduling K-mers Counting in a Distributed Environment
    Amorosi, Lavinia
    Di Rocco, Lorenzo
    Petrillo, Umberto Ferraro
    [J]. OPTIMIZATION IN ARTIFICIAL INTELLIGENCE AND DATA SCIENCES, 2022, : 73 - 83
  • [5] A New Feature Selection Methodology for K-mers Representation of DNA Sequences
    Giosue, Lo Bosco
    Luca, Pinello
    [J]. COMPUTATIONAL INTELLIGENCE METHODS FOR BIOINFORMATICS AND BIOSTATISTICS, CIBB 2014, 2015, 8623 : 99 - 108
  • [6] These Are Not the K-mers You Are Looking For: Efficient Online K-mer Counting Using a Probabilistic Data Structure
    Zhang, Qingpeng
    Pell, Jason
    Canino-Koning, Rosangela
    Howe, Adina Chuang
    Brown, C. Titus
    [J]. PLOS ONE, 2014, 9 (07):
  • [7] Model for the distributions of k-mers in DNA sequences -: art. no. 011908
    Chen, YH
    Nyeo, SL
    Yeh, CY
    [J]. PHYSICAL REVIEW E, 2005, 72 (01):
  • [8] Fast detection of maximal exact matches via fixed sampling of query K-mers and Bloom filtering of index K-mers
    Liu, Yuansheng
    Zhang, Leo Yu
    Li, Jinyan
    [J]. BIOINFORMATICS, 2019, 35 (22) : 4560 - 4567
  • [9] A fast, lock-free approach for efficient parallel counting of occurrences of k-mers
    Marcais, Guillaume
    Kingsford, Carl
    [J]. BIOINFORMATICS, 2011, 27 (06) : 764 - 770
  • [10] Kcollections: A Fast and Efficient Library for K-mers
    Fujimoto, M. Stanley
    Lyman, Cole A.
    Clement, Mark J.
    [J]. 2020 IEEE 34TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW 2020), 2020, : 193 - 198
12345