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 *

139 related articles for article (PubMed ID: 33471088)

  • 21. Paired de bruijn graphs: a novel approach for incorporating mate pair information into genome assemblers.
    Medvedev P; Pham S; Chaisson M; Tesler G; Pevzner P
    J Comput Biol; 2011 Nov; 18(11):1625-34. PubMed ID: 21999285
    [TBL] [Abstract][Full Text] [Related]  

  • 22. LightAssembler: fast and memory-efficient assembly algorithm for high-throughput sequencing reads.
    El-Metwally S; Zakaria M; Hamza T
    Bioinformatics; 2016 Nov; 32(21):3215-3223. PubMed ID: 27412092
    [TBL] [Abstract][Full Text] [Related]  

  • 23. BASE: a practical de novo assembler for large genomes using long NGS reads.
    Liu B; Liu CM; Li D; Li Y; Ting HF; Yiu SM; Luo R; Lam TW
    BMC Genomics; 2016 Aug; 17 Suppl 5(Suppl 5):499. PubMed ID: 27586129
    [TBL] [Abstract][Full Text] [Related]  

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

  • 25. Coverage-preserving sparsification of overlap graphs for long-read assembly.
    Jain C
    Bioinformatics; 2023 Mar; 39(3):. PubMed ID: 36892439
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Omega: an overlap-graph de novo assembler for metagenomics.
    Haider B; Ahn TH; Bushnell B; Chai J; Copeland A; Pan C
    Bioinformatics; 2014 Oct; 30(19):2717-22. PubMed ID: 24947750
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Empirical evaluation of methods for
    Dida F; Yi G
    PeerJ Comput Sci; 2021; 7():e636. PubMed ID: 34307867
    [TBL] [Abstract][Full Text] [Related]  

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

  • 29. Illumina error correction near highly repetitive DNA regions improves de novo genome assembly.
    Heydari M; Miclotte G; Van de Peer Y; Fostier J
    BMC Bioinformatics; 2019 Jun; 20(1):298. PubMed ID: 31159722
    [TBL] [Abstract][Full Text] [Related]  

  • 30. The MaSuRCA genome assembler.
    Zimin AV; Marçais G; Puiu D; Roberts M; Salzberg SL; Yorke JA
    Bioinformatics; 2013 Nov; 29(21):2669-77. PubMed ID: 23990416
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads.
    Lima L; Sinaimeri B; Sacomoto G; Lopez-Maestre H; Marchet C; Miele V; Sagot MF; Lacroix V
    Algorithms Mol Biol; 2017; 12():2. PubMed ID: 28250805
    [TBL] [Abstract][Full Text] [Related]  

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

  • 33. Full-length de novo viral quasispecies assembly through variation graph construction.
    Baaijens JA; Van der Roest B; Köster J; Stougie L; Schönhuth A
    Bioinformatics; 2019 Dec; 35(24):5086-5094. PubMed ID: 31147688
    [TBL] [Abstract][Full Text] [Related]  

  • 34. De novo assembly of bacterial genomes with repetitive DNA regions by dnaasm application.
    Kuśmirek W; Nowak R
    BMC Bioinformatics; 2018 Jul; 19(1):273. PubMed ID: 30021513
    [TBL] [Abstract][Full Text] [Related]  

  • 35. HyDA-Vista: towards optimal guided selection of k-mer size for sequence assembly.
    Shariat B; Movahedi NS; Chitsaz H; Boucher C
    BMC Genomics; 2014; 15 Suppl 10(Suppl 10):S9. PubMed ID: 25558875
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Software for pre-processing Illumina next-generation sequencing short read sequences.
    Chen C; Khaleel SS; Huang H; Wu CH
    Source Code Biol Med; 2014; 9():8. PubMed ID: 24955109
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs.
    Limasset A; Flot JF; Peterlongo P
    Bioinformatics; 2020 Mar; 36(5):1374-1381. PubMed ID: 30785192
    [TBL] [Abstract][Full Text] [Related]  

  • 38. IDBA-tran: a more robust de novo de Bruijn graph assembler for transcriptomes with uneven expression levels.
    Peng Y; Leung HC; Yiu SM; Lv MJ; Zhu XG; Chin FY
    Bioinformatics; 2013 Jul; 29(13):i326-34. PubMed ID: 23813001
    [TBL] [Abstract][Full Text] [Related]  

  • 39. RMI-DBG algorithm: A more agile iterative de Bruijn graph algorithm in short read genome assembly.
    Hosseini ZZ; Rahimi SK; Forouzan E; Baraani A
    J Bioinform Comput Biol; 2021 Apr; 19(2):2150005. PubMed ID: 33866959
    [TBL] [Abstract][Full Text] [Related]  

  • 40. A practical comparison of de novo genome assembly software tools for next-generation sequencing technologies.
    Zhang W; Chen J; Yang Y; Tang Y; Shang J; Shen B
    PLoS One; 2011 Mar; 6(3):e17915. PubMed ID: 21423806
    [TBL] [Abstract][Full Text] [Related]  

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