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 *

141 related articles for article (PubMed ID: 35317833)

  • 1. Space-efficient representation of genomic k-mer count tables.
    Shibuya Y; Belazzougui D; Kucherov G
    Algorithms Mol Biol; 2022 Mar; 17(1):5. PubMed ID: 35317833
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Set-Min Sketch: A Probabilistic Map for Power-Law Distributions with Application to
    Shibuya Y; Belazzougui D; Kucherov G
    J Comput Biol; 2022 Feb; 29(2):140-154. PubMed ID: 35049334
    [No Abstract]   [Full Text] [Related]  

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

  • 4. On weighted k-mer dictionaries.
    Pibiri GE
    Algorithms Mol Biol; 2023 Jun; 18(1):3. PubMed ID: 37328897
    [TBL] [Abstract][Full Text] [Related]  

  • 5. These are not the k-mers you are looking for: efficient online k-mer counting using a probabilistic data structure.
    Zhang Q; Pell J; Canino-Koning R; Howe AC; Brown CT
    PLoS One; 2014; 9(7):e101271. PubMed ID: 25062443
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Space-efficient computation of k-mer dictionaries for large values of k.
    Díaz-Domínguez D; Leinonen M; Salmela L
    Algorithms Mol Biol; 2024 Apr; 19(1):14. PubMed ID: 38581000
    [TBL] [Abstract][Full Text] [Related]  

  • 7. KCOSS: an ultra-fast k-mer counter for assembled genome analysis.
    Tang D; Li Y; Tan D; Fu J; Tang Y; Lin J; Zhao R; Du H; Zhao Z
    Bioinformatics; 2022 Jan; 38(4):933-940. PubMed ID: 34849595
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Comparing fixed sampling with minimizer sampling when using k-mer indexes to find maximal exact matches.
    Almutairy M; Torng E
    PLoS One; 2018; 13(2):e0189960. PubMed ID: 29389989
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Representation of
    Rahman A; Medevedev P
    J Comput Biol; 2021 Apr; 28(4):381-394. PubMed ID: 33290137
    [No Abstract]   [Full Text] [Related]  

  • 11. KAnalyze: a fast versatile pipelined k-mer toolkit.
    Audano P; Vannberg F
    Bioinformatics; 2014 Jul; 30(14):2070-2. PubMed ID: 24642064
    [TBL] [Abstract][Full Text] [Related]  

  • 12. DSK: k-mer counting with very low memory usage.
    Rizk G; Lavenier D; Chikhi R
    Bioinformatics; 2013 Mar; 29(5):652-3. PubMed ID: 23325618
    [TBL] [Abstract][Full Text] [Related]  

  • 13. MEM-based pangenome indexing for
    Hwang S; Brown NK; Ahmed OY; Jenike KM; Kovaka S; Schatz MC; Langmead B
    bioRxiv; 2024 May; ():. PubMed ID: 38826299
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. BLight: efficient exact associative structure for k-mers.
    Marchet C; Kerbiriou M; Limasset A
    Bioinformatics; 2021 Sep; 37(18):2858-2865. PubMed ID: 33821954
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. A general near-exact k-mer counting method with low memory consumption enables de novo assembly of 106× human sequence data in 2.7 hours.
    Shi CH; Yip KY
    Bioinformatics; 2020 Dec; 36(Suppl_2):i625-i633. PubMed ID: 33381843
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Fulgor: A fast and compact
    Fan J; Singh NP; Khan J; Pibiri GE; Patro R
    bioRxiv; 2023 May; ():. PubMed ID: 37214944
    [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. 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]  

    [Next]    [New Search]
    of 8.