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 *

119 related articles for article (PubMed ID: 37403080)

  • 21. A new method to compute K-mer frequencies and its application to annotate large repetitive plant genomes.
    Kurtz S; Narechania A; Stein JC; Ware D
    BMC Genomics; 2008 Oct; 9():517. PubMed ID: 18976482
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Readjoiner: a fast and memory efficient string graph-based sequence assembler.
    Gonnella G; Kurtz S
    BMC Bioinformatics; 2012 May; 13():82. PubMed ID: 22559072
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Simplitigs as an efficient and scalable representation of de Bruijn graphs.
    Břinda K; Baym M; Kucherov G
    Genome Biol; 2021 Apr; 22(1):96. PubMed ID: 33823902
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Integrating long-range connectivity information into de Bruijn graphs.
    Turner I; Garimella KV; Iqbal Z; McVean G
    Bioinformatics; 2018 Aug; 34(15):2556-2565. PubMed ID: 29554215
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. Accurate determination of node and arc multiplicities in de bruijn graphs using conditional random fields.
    Steyaert A; Audenaert P; Fostier J
    BMC Bioinformatics; 2020 Sep; 21(1):402. PubMed ID: 32928110
    [TBL] [Abstract][Full Text] [Related]  

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

  • 28. K-mer clustering algorithm using a MapReduce framework: application to the parallelization of the Inchworm module of Trinity.
    Kim CS; Winn MD; Sachdeva V; Jordan KE
    BMC Bioinformatics; 2017 Nov; 18(1):467. PubMed ID: 29100493
    [TBL] [Abstract][Full Text] [Related]  

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

  • 30. Optimization of de novo transcriptome assembly from high-throughput short read sequencing data improves functional annotation for non-model organisms.
    Haznedaroglu BZ; Reeves D; Rismani-Yazdi H; Peccia J
    BMC Bioinformatics; 2012 Jul; 13():170. PubMed ID: 22808927
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Optimized Sequence Library Design for Efficient In Vitro Interaction Mapping.
    Orenstein Y; Puccinelli R; Kim R; Fordyce P; Berger B
    Cell Syst; 2017 Sep; 5(3):230-236.e5. PubMed ID: 28957657
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs.
    Holley G; Melsted P
    Genome Biol; 2020 Sep; 21(1):249. PubMed ID: 32943081
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers.
    Orenstein Y; Berger B
    J Comput Biol; 2016 Feb; 23(2):67-79. PubMed ID: 26713687
    [TBL] [Abstract][Full Text] [Related]  

  • 34. SplitMEM: a graphical algorithm for pan-genome analysis with suffix skips.
    Marcus S; Lee H; Schatz MC
    Bioinformatics; 2014 Dec; 30(24):3476-83. PubMed ID: 25398610
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Lossless indexing with counting de Bruijn graphs.
    Karasikov M; Mustafa H; Rätsch G; Kahles A
    Genome Res; 2022 Sep; 32(9):1754-1764. PubMed ID: 35609994
    [TBL] [Abstract][Full Text] [Related]  

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

  • 37. Disk-based k-mer counting on a PC.
    Deorowicz S; Debudaj-Grabysz A; Grabowski S
    BMC Bioinformatics; 2013 May; 14():160. PubMed ID: 23679007
    [TBL] [Abstract][Full Text] [Related]  

  • 38. FSG: Fast String Graph Construction for De Novo Assembly.
    Bonizzoni P; Vedova GD; Pirola Y; Previtali M; Rizzi R
    J Comput Biol; 2017 Oct; 24(10):953-968. PubMed ID: 28715269
    [TBL] [Abstract][Full Text] [Related]  

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

  • 40. External memory BWT and LCP computation for sequence collections with applications.
    Egidi L; Louza FA; Manzini G; Telles GP
    Algorithms Mol Biol; 2019; 14():6. PubMed ID: 30899322
    [TBL] [Abstract][Full Text] [Related]  

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