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: 36824947)

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

  • 42. Meta-colored compacted de Bruijn graphs.
    Pibiri GE; Fan J; Patro R
    bioRxiv; 2023 Nov; ():. PubMed ID: 37546988
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 46. Gerbil: a fast and memory-efficient 
    Erbert M; Rechner S; Müller-Hannemann M
    Algorithms Mol Biol; 2017; 12():9. PubMed ID: 28373894
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Design of shortest double-stranded DNA sequences covering all k-mers with applications to protein-binding microarrays and synthetic enhancers.
    Orenstein Y; Shamir R
    Bioinformatics; 2013 Jul; 29(13):i71-9. PubMed ID: 23813011
    [TBL] [Abstract][Full Text] [Related]  

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

  • 49. The complex task of choosing a de novo assembly: lessons from fungal genomes.
    Gallo JE; Muñoz JF; Misas E; McEwen JG; Clay OK
    Comput Biol Chem; 2014 Dec; 53 Pt A():97-107. PubMed ID: 25262360
    [TBL] [Abstract][Full Text] [Related]  

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

  • 51. Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform.
    Baier U; Beller T; Ohlebusch E
    Bioinformatics; 2016 Feb; 32(4):497-504. PubMed ID: 26504144
    [TBL] [Abstract][Full Text] [Related]  

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

  • 53. K-mer-Based Motif Analysis in Insect Species across
    Cserhati M; Xiao P; Guda C
    Comput Math Methods Med; 2019; 2019():4259479. PubMed ID: 31827584
    [TBL] [Abstract][Full Text] [Related]  

  • 54. KmerStream: streaming algorithms for k-mer abundance estimation.
    Melsted P; Halldórsson BV
    Bioinformatics; 2014 Dec; 30(24):3541-7. PubMed ID: 25355787
    [TBL] [Abstract][Full Text] [Related]  

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

  • 56. On the Hardness of Sequence Alignment on De Bruijn Graphs.
    Gibney D; Thankachan SV; Aluru S
    J Comput Biol; 2022 Dec; 29(12):1377-1396. PubMed ID: 36450127
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 60. The Statistics of
    Blanca A; Harris RS; Koslicki D; Medvedev P
    J Comput Biol; 2022 Feb; 29(2):155-168. PubMed ID: 35108101
    [No Abstract]   [Full Text] [Related]  

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