BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

218 related articles for article (PubMed ID: 34525345)

  • 1. Minimizer-space de Bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer.
    Ekim B; Berger B; Chikhi R
    Cell Syst; 2021 Oct; 12(10):958-968.e6. PubMed ID: 34525345
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Compacting de Bruijn graphs from sequencing data quickly and in low memory.
    Chikhi R; Limasset A; Medvedev P
    Bioinformatics; 2016 Jun; 32(12):i201-i208. PubMed ID: 27307618
    [TBL] [Abstract][Full Text] [Related]  

  • 3. MBG: Minimizer-based sparse de Bruijn Graph construction.
    Rautiainen M; Marschall T
    Bioinformatics; 2021 Aug; 37(16):2476-2478. PubMed ID: 33475133
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 8. RResolver: efficient short-read repeat resolution within ABySS.
    Nikolić V; Afshinfard A; Chu J; Wong J; Coombe L; Nip KM; Warren RL; Birol I
    BMC Bioinformatics; 2022 Jun; 23(1):246. PubMed ID: 35729491
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Benchmarking of de novo assembly algorithms for Nanopore data reveals optimal performance of OLC approaches.
    Cherukuri Y; Janga SC
    BMC Genomics; 2016 Aug; 17 Suppl 7(Suppl 7):507. PubMed ID: 27556636
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Assembly of long error-prone reads using de Bruijn graphs.
    Lin Y; Yuan J; Kolmogorov M; Shen MW; Chaisson M; Pevzner PA
    Proc Natl Acad Sci U S A; 2016 Dec; 113(52):E8396-E8405. PubMed ID: 27956617
    [TBL] [Abstract][Full Text] [Related]  

  • 11. cloudSPAdes: assembly of synthetic long reads using de Bruijn graphs.
    Tolstoganov I; Bankevich A; Chen Z; Pevzner PA
    Bioinformatics; 2019 Jul; 35(14):i61-i70. PubMed ID: 31510642
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Integration of string and de Bruijn graphs for genome assembly.
    Huang YT; Liao CF
    Bioinformatics; 2016 May; 32(9):1301-7. PubMed ID: 26755626
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 16. Aligning optical maps to de Bruijn graphs.
    Mukherjee K; Alipanahi B; Kahveci T; Salmela L; Boucher C
    Bioinformatics; 2019 Sep; 35(18):3250-3256. PubMed ID: 30698651
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Fast de Bruijn Graph Compaction in Distributed Memory Environments.
    Pan T; Nihalani R; Aluru S
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(1):136-148. PubMed ID: 30072337
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Read mapping on de Bruijn graphs.
    Limasset A; Cazaux B; Rivals E; Peterlongo P
    BMC Bioinformatics; 2016 Jun; 17(1):237. PubMed ID: 27306641
    [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. MetaVelvet: an extension of Velvet assembler to de novo metagenome assembly from short sequence reads.
    Namiki T; Hachiya T; Tanaka H; Sakakibara Y
    Nucleic Acids Res; 2012 Nov; 40(20):e155. PubMed ID: 22821567
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.