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 *

222 related articles for article (PubMed ID: 33866959)

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

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

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

  • 4. FastEtch: A Fast Sketch-Based Assembler for Genomes.
    Ghosh P; Kalyanaraman A
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1091-1106. PubMed ID: 28910776
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 10. Scalable Genome Assembly through Parallel de Bruijn Graph Construction for Multiple k-mers.
    Mahadik K; Wright C; Kulkarni M; Bagchi S; Chaterji S
    Sci Rep; 2019 Oct; 9(1):14882. PubMed ID: 31619717
    [TBL] [Abstract][Full Text] [Related]  

  • 11. MiniDBG: A Novel and Minimal De Bruijn Graph for Read Mapping.
    Yu C; Zhao Y; Zhao C; Jin J; Mao K; Wang G
    IEEE/ACM Trans Comput Biol Bioinform; 2024; 21(1):129-142. PubMed ID: 38060353
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Clover: a clustering-oriented de novo assembler for Illumina sequences.
    Hsieh MF; Lu CL; Tang CY
    BMC Bioinformatics; 2020 Nov; 21(1):528. PubMed ID: 33203354
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A hybrid and scalable error correction algorithm for indel and substitution errors of long reads.
    Das AK; Goswami S; Lee K; Park SJ
    BMC Genomics; 2019 Dec; 20(Suppl 11):948. PubMed ID: 31856721
    [TBL] [Abstract][Full Text] [Related]  

  • 14. The present and future of de novo whole-genome assembly.
    Sohn JI; Nam JW
    Brief Bioinform; 2018 Jan; 19(1):23-40. PubMed ID: 27742661
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 18. FSG: Fast String Graph Construction for De Novo Assembly.
    Bonizzoni P; Vedova GD; Pirola Y; Previtali M; Rizzi R
    J Comput Biol; 2017 Oct; 24(10):953-968. PubMed ID: 28715269
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 12.