BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

172 related articles for article (PubMed ID: 37253540)

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

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

  • 3. Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2.
    Khan J; Kokot M; Deorowicz S; Patro R
    Genome Biol; 2022 Sep; 23(1):190. PubMed ID: 36076275
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Building large updatable colored de Bruijn graphs via merging.
    Muggli MD; Alipanahi B; Boucher C
    Bioinformatics; 2019 Jul; 35(14):i51-i60. PubMed ID: 31510647
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 10. BlastFrost: fast querying of 100,000s of bacterial genomes in Bifrost graphs.
    Luhmann N; Holley G; Achtman M
    Genome Biol; 2021 Jan; 22(1):30. PubMed ID: 33430919
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
    Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
    BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
    [TBL] [Abstract][Full Text] [Related]  

  • 12. StLiter: A Novel Algorithm to Iteratively Build the Compacted de Bruijn Graph From Many Complete Genomes.
    Yu C; Mao K; Zhao Y; Chang C; Wang G
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(4):2471-2483. PubMed ID: 33630738
    [TBL] [Abstract][Full Text] [Related]  

  • 13. MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs.
    Li D; Huang Y; Leung CM; Luo R; Ting HF; Lam TW
    BMC Bioinformatics; 2017 Oct; 18(Suppl 12):408. PubMed ID: 29072142
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Multiplex de Bruijn graphs enable genome assembly from long, high-fidelity reads.
    Bankevich A; Bzikadze AV; Kolmogorov M; Antipov D; Pevzner PA
    Nat Biotechnol; 2022 Jul; 40(7):1075-1081. PubMed ID: 35228706
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Comparing methods for constructing and representing human pangenome graphs.
    Andreace F; Lechat P; Dufresne Y; Chikhi R
    Genome Biol; 2023 Nov; 24(1):274. PubMed ID: 38037131
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 19. deGSM: Memory Scalable Construction Of Large Scale de Bruijn Graph.
    Guo H; Fu Y; Gao Y; Li J; Wang Y; Liu B
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2157-2166. PubMed ID: 31056509
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Succinct colored de Bruijn graphs.
    Muggli MD; Bowe A; Noyes NR; Morley PS; Belk KE; Raymond R; Gagie T; Puglisi SJ; Boucher C
    Bioinformatics; 2017 Oct; 33(20):3181-3187. PubMed ID: 28200001
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.