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 *

143 related articles for article (PubMed ID: 19645596)

  • 1. Maximum likelihood genome assembly.
    Medvedev P; Brudno M
    J Comput Biol; 2009 Aug; 16(8):1101-16. PubMed ID: 19645596
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS.
    Kundeti V; Rajasekaran S; Dinh H
    Discrete Math Algorithms Appl; 2010; 1():184-196. PubMed ID: 25364472
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 9. Optimal algorithms for haplotype assembly from whole-genome sequence data.
    He D; Choi A; Pipatsrisawat K; Darwiche A; Eskin E
    Bioinformatics; 2010 Jun; 26(12):i183-90. PubMed ID: 20529904
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 12. Safe and Complete Contig Assembly Through Omnitigs.
    Tomescu AI; Medvedev P
    J Comput Biol; 2017 Jun; 24(6):590-602. PubMed ID: 27749096
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Evaluation and Validation of Assembling Corrected PacBio Long Reads for Microbial Genome Completion via Hybrid Approaches.
    Lin HH; Liao YC
    PLoS One; 2015; 10(12):e0144305. PubMed ID: 26641475
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. ALLPATHS: de novo assembly of whole-genome shotgun microreads.
    Butler J; MacCallum I; Kleber M; Shlyakhter IA; Belmonte MK; Lander ES; Nusbaum C; Jaffe DB
    Genome Res; 2008 May; 18(5):810-20. PubMed ID: 18340039
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Near-optimal assembly for shotgun sequencing with noisy reads.
    Lam KK; Khalak A; Tse D
    BMC Bioinformatics; 2014; 15 Suppl 9(Suppl 9):S4. PubMed ID: 25252708
    [TBL] [Abstract][Full Text] [Related]  

  • 17. De novo detection of copy number variation by co-assembly.
    Nijkamp JF; van den Broek MA; Geertman JM; Reinders MJ; Daran JM; de Ridder D
    Bioinformatics; 2012 Dec; 28(24):3195-202. PubMed ID: 23047563
    [TBL] [Abstract][Full Text] [Related]  

  • 18. SOPRA: Scaffolding algorithm for paired reads via statistical optimization.
    Dayarian A; Michael TP; Sengupta AM
    BMC Bioinformatics; 2010 Jun; 11():345. PubMed ID: 20576136
    [TBL] [Abstract][Full Text] [Related]  

  • 19. NeatFreq: reference-free data reduction and coverage normalization for De Novo sequence assembly.
    McCorrison JM; Venepally P; Singh I; Fouts DE; Lasken RS; Methé BA
    BMC Bioinformatics; 2014 Nov; 15(1):357. PubMed ID: 25407910
    [TBL] [Abstract][Full Text] [Related]  

  • 20. SplitMEM: a graphical algorithm for pan-genome analysis with suffix skips.
    Marcus S; Lee H; Schatz MC
    Bioinformatics; 2014 Dec; 30(24):3476-83. PubMed ID: 25398610
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.