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 *

153 related articles for article (PubMed ID: 38254124)

  • 1. Fulgor: a fast and compact k-mer index for large-scale matching and color queries.
    Fan J; Khan J; Singh NP; Pibiri GE; Patro R
    Algorithms Mol Biol; 2024 Jan; 19(1):3. PubMed ID: 38254124
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 4. Where the patterns are: repetition-aware compression for colored de Bruijn graphs
    Campanelli A; Pibiri GE; Fan J; Patro R
    bioRxiv; 2024 Jul; ():. PubMed ID: 39026859
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Where the Patterns Are: Repetition-Aware Compression for Colored de Bruijn Graphs
    Campanelli A; Pibiri GE; Fan J; Patro R
    J Comput Biol; 2024 Oct; 31(10):1022-1044. PubMed ID: 39381838
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Compression Algorithm for Colored de Bruijn Graphs.
    Rahman A; Dufresne Y; Medvedev P
    Lebniz Int Proc Inform; 2023 Sep; 273():. PubMed ID: 38712341
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Compression algorithm for colored de Bruijn graphs.
    Rahman A; Dufresne Y; Medvedev P
    Algorithms Mol Biol; 2024 May; 19(1):20. PubMed ID: 38797858
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT.
    Cracco A; Tomescu AI
    Genome Res; 2023 Jul; 33(7):1198-1207. PubMed ID: 37253540
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Cuttlefish: fast, parallel and low-memory compaction of de Bruijn graphs from large-scale genome collections.
    Khan J; Patro R
    Bioinformatics; 2021 Jul; 37(Suppl_1):i177-i186. PubMed ID: 34252958
    [TBL] [Abstract][Full Text] [Related]  

  • 12. An Efficient, Scalable, and Exact Representation of High-Dimensional Color Information Enabled Using de Bruijn Graph Search.
    Almodaresi F; Pandey P; Ferdman M; Johnson R; Patro R
    J Comput Biol; 2020 Apr; 27(4):485-499. PubMed ID: 32176522
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Compact representation of k-mer de Bruijn graphs for genome read assembly.
    Rødland EA
    BMC Bioinformatics; 2013 Oct; 14():313. PubMed ID: 24152242
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Enhanced Compression of
    Rossignolo E; Comin M
    J Comput Biol; 2024 Jun; 31(6):524-538. PubMed ID: 38820168
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 18. Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes.
    Alanko JN; Vuohtoniemi J; Mäklin T; Puglisi SJ
    Bioinformatics; 2023 Jun; 39(39 Suppl 1):i260-i269. PubMed ID: 37387143
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 8.