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 *

201 related articles for article (PubMed ID: 25225118)

  • 1. SAGE: String-overlap Assembly of GEnomes.
    Ilie L; Haider B; Molnar M; Solis-Oba R
    BMC Bioinformatics; 2014 Sep; 15(1):302. PubMed ID: 25225118
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 7. Readjoiner: a fast and memory efficient string graph-based sequence assembler.
    Gonnella G; Kurtz S
    BMC Bioinformatics; 2012 May; 13():82. PubMed ID: 22559072
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Efficient construction of an assembly string graph using the FM-index.
    Simpson JT; Durbin R
    Bioinformatics; 2010 Jun; 26(12):i367-73. PubMed ID: 20529929
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 13. Efficient de novo assembly of large genomes using compressed data structures.
    Simpson JT; Durbin R
    Genome Res; 2012 Mar; 22(3):549-56. PubMed ID: 22156294
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Simultaneous compression of multiple error-corrected short-read sets for faster data transmission and better de novo assemblies.
    Tang T; Hutvagner G; Wang W; Li J
    Brief Funct Genomics; 2022 Sep; 21(5):387-398. PubMed ID: 35848773
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. String graph construction using incremental hashing.
    Ben-Bassat I; Chor B
    Bioinformatics; 2014 Dec; 30(24):3515-23. PubMed ID: 25183486
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 20. LSG: An External-Memory Tool to Compute String Graphs for Next-Generation Sequencing Data Assembly.
    Bonizzoni P; Vedova GD; Pirola Y; Previtali M; Rizzi R
    J Comput Biol; 2016 Mar; 23(3):137-49. PubMed ID: 26953874
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.