These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

186 related articles for article (PubMed ID: 25143290)

  • 1. BioBloom tools: fast, accurate and memory-efficient host species sequence screening using bloom filters.
    Chu J; Sadeghi S; Raymond A; Jackman SD; Nip KM; Mar R; Mohamadi H; Butterfield YS; Robertson AG; Birol I
    Bioinformatics; 2014 Dec; 30(23):3402-4. PubMed ID: 25143290
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Improving Bloom Filter Performance on Sequence Data Using k-mer Bloom Filters.
    Pellow D; Filippova D; Kingsford C
    J Comput Biol; 2017 Jun; 24(6):547-557. PubMed ID: 27828710
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Hierarchical Interleaved Bloom Filter: enabling ultrafast, approximate sequence queries.
    Mehringer S; Seiler E; Droop F; Darvish M; Rahn R; Vingron M; Reinert K
    Genome Biol; 2023 May; 24(1):131. PubMed ID: 37259161
    [TBL] [Abstract][Full Text] [Related]  

  • 4. fimpera: drastic improvement of Approximate Membership Query data-structures with counts.
    Robidou L; Peterlongo P
    Bioinformatics; 2023 May; 39(5):. PubMed ID: 37195454
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Mismatch-tolerant, alignment-free sequence classification using multiple spaced seeds and multiindex Bloom filters.
    Chu J; Mohamadi H; Erhan E; Tse J; Chiu R; Yeo S; Birol I
    Proc Natl Acad Sci U S A; 2020 Jul; 117(29):16961-16968. PubMed ID: 32641514
    [TBL] [Abstract][Full Text] [Related]  

  • 6. MetaProFi: an ultrafast chunked Bloom filter for storing and querying protein and nucleotide sequence data for accurate identification of functionally relevant genetic variants.
    Srikakulam SK; Keller S; Dabbaghie F; Bals R; Kalinina OV
    Bioinformatics; 2023 Mar; 39(3):. PubMed ID: 36825843
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Classification of DNA sequences using Bloom filters.
    Stranneheim H; Käller M; Allander T; Andersson B; Arvestad L; Lundeberg J
    Bioinformatics; 2010 Jul; 26(13):1595-600. PubMed ID: 20472541
    [TBL] [Abstract][Full Text] [Related]  

  • 8. AllSome Sequence Bloom Trees.
    Sun C; Harris RS; Chikhi R; Medvedev P
    J Comput Biol; 2018 May; 25(5):467-479. PubMed ID: 29620920
    [TBL] [Abstract][Full Text] [Related]  

  • 9. ntHash: recursive nucleotide hashing.
    Mohamadi H; Chu J; Vandervalk BP; Birol I
    Bioinformatics; 2016 Nov; 32(22):3492-3494. PubMed ID: 27423894
    [TBL] [Abstract][Full Text] [Related]  

  • 10. GRIM-Filter: Fast seed location filtering in DNA read mapping using processing-in-memory technologies.
    Kim JS; Senol Cali D; Xin H; Lee D; Ghose S; Alser M; Hassan H; Ergin O; Alkan C; Mutlu O
    BMC Genomics; 2018 May; 19(Suppl 2):89. PubMed ID: 29764378
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Practical dynamic de Bruijn graphs.
    Crawford VG; Kuhnle A; Boucher C; Chikhi R; Gagie T
    Bioinformatics; 2018 Dec; 34(24):4189-4195. PubMed ID: 29939217
    [TBL] [Abstract][Full Text] [Related]  

  • 12. GASSST: global alignment short sequence search tool.
    Rizk G; Lavenier D
    Bioinformatics; 2010 Oct; 26(20):2534-40. PubMed ID: 20739310
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A Fast and Scalable Workflow for SNPs Detection in Genome Sequences Using Hadoop Map-Reduce.
    Tahir M; Sardaraz M
    Genes (Basel); 2020 Feb; 11(2):. PubMed ID: 32033366
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Squeakr: an exact and approximate k-mer counting system.
    Pandey P; Bender MA; Johnson R; Patro R; Berger B
    Bioinformatics; 2018 Feb; 34(4):568-575. PubMed ID: 29444235
    [TBL] [Abstract][Full Text] [Related]  

  • 15. YOABS: yet other aligner of biological sequences--an efficient linearly scaling nucleotide aligner.
    Galinsky VL
    Bioinformatics; 2012 Apr; 28(8):1070-7. PubMed ID: 22402614
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Faster single-end alignment generation utilizing multi-thread for BWA.
    Jo H; Koh G
    Biomed Mater Eng; 2015; 26 Suppl 1():S1791-6. PubMed ID: 26405948
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage.
    Holley G; Wittler R; Stoye J
    Algorithms Mol Biol; 2016; 11():3. PubMed ID: 27087830
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Fast detection of maximal exact matches via fixed sampling of query K-mers and Bloom filtering of index K-mers.
    Liu Y; Zhang LY; Li J
    Bioinformatics; 2019 Nov; 35(22):4560-4567. PubMed ID: 30994891
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Turtle: identifying frequent k-mers with cache-efficient algorithms.
    Roy RS; Bhattacharya D; Schliep A
    Bioinformatics; 2014 Jul; 30(14):1950-7. PubMed ID: 24618471
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Efficient counting of k-mers in DNA sequences using a bloom filter.
    Melsted P; Pritchard JK
    BMC Bioinformatics; 2011 Aug; 12():333. PubMed ID: 21831268
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.