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 *

187 related articles for article (PubMed ID: 34252928)

  • 21. Asymptotically optimal minimizers schemes.
    Marçais G; DeBlasio D; Kingsford C
    Bioinformatics; 2018 Jul; 34(13):i13-i22. PubMed ID: 29949995
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 24. Practical selection of representative sets of RNA-seq samples using a hierarchical approach.
    Tung LH; Kingsford C
    Bioinformatics; 2021 Jul; 37(Suppl_1):i334-i341. PubMed ID: 34252927
    [TBL] [Abstract][Full Text] [Related]  

  • 25. The effect of genome graph expressiveness on the discrepancy between genome graph distance and string set distance.
    Qiu Y; Kingsford C
    Bioinformatics; 2022 Jun; 38(Suppl 1):i404-i412. PubMed ID: 35758819
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 28. A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets.
    Ekim B; Berger B; Orenstein Y
    Res Comput Mol Biol; 2020 May; 12074():37-53. PubMed ID: 38835399
    [TBL] [Abstract][Full Text] [Related]  

  • 29. The K-mer File Format: a standardized and compact disk representation of sets of k-mers.
    Dufresne Y; Lemane T; Marijon P; Peterlongo P; Rahman A; Kokot M; Medvedev P; Deorowicz S; Chikhi R
    Bioinformatics; 2022 Sep; 38(18):4423-4425. PubMed ID: 35904548
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Weighted minimizer sampling improves long read mapping.
    Jain C; Rhie A; Zhang H; Chu C; Walenz BP; Koren S; Phillippy AM
    Bioinformatics; 2020 Jul; 36(Suppl_1):i111-i118. PubMed ID: 32657365
    [TBL] [Abstract][Full Text] [Related]  

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

  • 32. Sketching methods with small window guarantee using minimum decycling sets.
    Marçais G; DeBlasio D; Kingsford C
    ArXiv; 2023 Nov; ():. PubMed ID: 37986724
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Syncmers are more sensitive than minimizers for selecting conserved
    Edgar R
    PeerJ; 2021; 9():e10805. PubMed ID: 33604186
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs.
    Limasset A; Flot JF; Peterlongo P
    Bioinformatics; 2020 Mar; 36(5):1374-1381. PubMed ID: 30785192
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Informational and linguistic analysis of large genomic sequence collections via efficient Hadoop cluster algorithms.
    Ferraro Petrillo U; Roscigno G; Cattaneo G; Giancarlo R
    Bioinformatics; 2018 Jun; 34(11):1826-1833. PubMed ID: 29342232
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Differentiable Learning of Sequence-Specific Minimizer Schemes with DeepMinimizer.
    Hoang M; Zheng H; Kingsford C
    J Comput Biol; 2022 Dec; 29(12):1288-1304. PubMed ID: 36095142
    [TBL] [Abstract][Full Text] [Related]  

  • 37. GenMap: ultra-fast computation of genome mappability.
    Pockrandt C; Alzamel M; Iliopoulos CS; Reinert K
    Bioinformatics; 2020 Jun; 36(12):3687-3692. PubMed ID: 32246826
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Fast Approximation of Frequent
    Pellegrina L; Pizzi C; Vandin F
    J Comput Biol; 2020 Apr; 27(4):534-549. PubMed ID: 31891535
    [TBL] [Abstract][Full Text] [Related]  

  • 39. KMCP: accurate metagenomic profiling of both prokaryotic and viral populations by pseudo-mapping.
    Shen W; Xiang H; Huang T; Tang H; Peng M; Cai D; Hu P; Ren H
    Bioinformatics; 2023 Jan; 39(1):. PubMed ID: 36579886
    [TBL] [Abstract][Full Text] [Related]  

  • 40. ntHash2: recursive spaced seed hashing for nucleotide sequences.
    Kazemi P; Wong J; Nikolić V; Mohamadi H; Warren RL; Birol I
    Bioinformatics; 2022 Oct; 38(20):4812-4813. PubMed ID: 36000872
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 10.