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)

  • 1. Sequence-specific minimizers via polar sets.
    Zheng H; Kingsford C; Marçais G
    Bioinformatics; 2021 Jul; 37(Suppl_1):i187-i195. PubMed ID: 34252928
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Improved design and analysis of practical minimizers.
    Zheng H; Kingsford C; Marçais G
    Bioinformatics; 2020 Jul; 36(Suppl_1):i119-i127. PubMed ID: 32657376
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Improving the performance of minimizers and winnowing schemes.
    Marçais G; Pellow D; Bork D; Orenstein Y; Shamir R; Kingsford C
    Bioinformatics; 2017 Jul; 33(14):i110-i117. PubMed ID: 28881970
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing.
    Orenstein Y; Pellow D; Marçais G; Shamir R; Kingsford C
    PLoS Comput Biol; 2017 Oct; 13(10):e1005777. PubMed ID: 28968408
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Density and Conservation Optimization of the Generalized Masked-Minimizer Sketching Scheme.
    Hoang M; Marçais G; Kingsford C
    J Comput Biol; 2024 Jan; 31(1):2-20. PubMed ID: 37975802
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. How to optimally sample a sequence for rapid analysis.
    Frith MC; Shaw J; Spouge JL
    Bioinformatics; 2023 Feb; 39(2):. PubMed ID: 36702468
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Sketching Methods with Small Window Guarantee Using Minimum Decycling Sets.
    Marçais G; DeBlasio D; Kingsford C
    J Comput Biol; 2024 Jul; 31(7):597-615. PubMed ID: 38980804
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Sparse and skew hashing of K-mers.
    Pibiri GE
    Bioinformatics; 2022 Jun; 38(Suppl 1):i185-i194. PubMed ID: 35758794
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Efficient minimizer orders for large values of
    Pellow D; Pu L; Ekim B; Kotlar L; Berger B; Shamir R; Orenstein Y
    Genome Res; 2023 Jul; 33(7):1154-1161. PubMed ID: 37558282
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Theory of local k-mer selection with applications to long-read alignment.
    Shaw J; Yu YW
    Bioinformatics; 2022 Oct; 38(20):4659-4669. PubMed ID: 36124869
    [TBL] [Abstract][Full Text] [Related]  

  • 13. ntCard: a streaming algorithm for cardinality estimation in genomics data.
    Mohamadi H; Khan H; Birol I
    Bioinformatics; 2017 May; 33(9):1324-1330. PubMed ID: 28453674
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Improved Analysis of High-Throughput Sequencing Data Using Small Universal k-Mer Hitting Sets.
    Orenstein Y
    Methods Mol Biol; 2021; 2243():95-105. PubMed ID: 33606254
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Lower Density Selection Schemes via Small Universal Hitting Sets with Short Remaining Path Length.
    Zheng H; Kingsford C; Marçais G
    J Comput Biol; 2021 Apr; 28(4):395-409. PubMed ID: 33325773
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A space and time-efficient index for the compacted colored de Bruijn graph.
    Almodaresi F; Sarkar H; Srivastava A; Patro R
    Bioinformatics; 2018 Jul; 34(13):i169-i177. PubMed ID: 29949982
    [TBL] [Abstract][Full Text] [Related]  

  • 17. KCMBT: a k-mer Counter based on Multiple Burst Trees.
    Mamun AA; Pal S; Rajasekaran S
    Bioinformatics; 2016 Sep; 32(18):2783-90. PubMed ID: 27283950
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. CMash: fast, multi-resolution estimation of k-mer-based Jaccard and containment indices.
    Liu S; Koslicki D
    Bioinformatics; 2022 Jun; 38(Suppl 1):i28-i35. PubMed ID: 35758788
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 10.