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 *

150 related articles for article (PubMed ID: 36699393)

  • 1. kmtricks: efficient and flexible construction of Bloom filters for large sequencing data collections.
    Lemane T; Medvedev P; Chikhi R; Peterlongo P
    Bioinform Adv; 2022; 2(1):vbac029. PubMed ID: 36699393
    [TBL] [Abstract][Full Text] [Related]  

  • 2. 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]  

  • 3. 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]  

  • 4. MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs.
    Li D; Huang Y; Leung CM; Luo R; Ting HF; Lam TW
    BMC Bioinformatics; 2017 Oct; 18(Suppl 12):408. PubMed ID: 29072142
    [TBL] [Abstract][Full Text] [Related]  

  • 5. 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]  

  • 6. 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]  

  • 7. Needle: a fast and space-efficient prefilter for estimating the quantification of very large collections of expression experiments.
    Darvish M; Seiler E; Mehringer S; Rahn R; Reinert K
    Bioinformatics; 2022 Sep; 38(17):4100-4108. PubMed ID: 35801930
    [TBL] [Abstract][Full Text] [Related]  

  • 8. kmcEx: memory-frugal and retrieval-efficient encoding of counted k-mers.
    Jiang P; Luo J; Wang Y; Deng P; Schmidt B; Tang X; Chen N; Wong L; Zhao L
    Bioinformatics; 2019 Dec; 35(23):4871-4878. PubMed ID: 31038666
    [TBL] [Abstract][Full Text] [Related]  

  • 9. 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]  

  • 10. 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]  

  • 11. REINDEER: efficient indexing of k-mer presence and abundance in sequencing datasets.
    Marchet C; Iqbal Z; Gautheret D; Salson M; Chikhi R
    Bioinformatics; 2020 Jul; 36(Suppl_1):i177-i185. PubMed ID: 32657392
    [TBL] [Abstract][Full Text] [Related]  

  • 12. SPRISS: approximating frequent k-mers by sampling reads, and applications.
    Santoro D; Pellegrina L; Comin M; Vandin F
    Bioinformatics; 2022 Jun; 38(13):3343-3350. PubMed ID: 35583271
    [TBL] [Abstract][Full Text] [Related]  

  • 13. 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]  

  • 14. Compact and evenly distributed k-mer binning for genomic sequences.
    Nyström-Persson J; Keeble-Gagnère G; Zawad N
    Bioinformatics; 2021 Sep; 37(17):2563-2569. PubMed ID: 33693556
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Raptor: A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.
    Seiler E; Mehringer S; Darvish M; Turc E; Reinert K
    iScience; 2021 Jul; 24(7):102782. PubMed ID: 34337360
    [TBL] [Abstract][Full Text] [Related]  

  • 16. 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]  

  • 17. Lighter: fast and memory-efficient sequencing error correction without counting.
    Song L; Florea L; Langmead B
    Genome Biol; 2014; 15(11):509. PubMed ID: 25398208
    [TBL] [Abstract][Full Text] [Related]  

  • 18. ganon: precise metagenomics classification against large and up-to-date sets of reference sequences.
    Piro VC; Dadi TH; Seiler E; Reinert K; Renard BY
    Bioinformatics; 2020 Jul; 36(Suppl_1):i12-i20. PubMed ID: 32657362
    [TBL] [Abstract][Full Text] [Related]  

  • 19. k mdiff, large-scale and user-friendly differential k-mer analyses.
    Lemane T; Chikhi R; Peterlongo P
    Bioinformatics; 2022 Dec; 38(24):5443-5445. PubMed ID: 36315078
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Improved representation of sequence bloom trees.
    Harris RS; Medvedev P
    Bioinformatics; 2020 Feb; 36(3):721-727. PubMed ID: 31504157
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.