BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

141 related articles for article (PubMed ID: 22803627)

  • 1. Pathset graphs: a novel approach for comprehensive utilization of paired reads in genome assembly.
    Pham SK; Antipov D; Sirotkin A; Tesler G; Pevzner PA; Alekseyev MA
    J Comput Biol; 2013 Apr; 20(4):359-71. PubMed ID: 22803627
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. A scaffold analysis tool using mate-pair information in genome sequencing.
    Kim PG; Cho HG; Park K
    J Biomed Biotechnol; 2008; 2008():675741. PubMed ID: 18414585
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. A tool for analyzing mate pairs in assemblies (TAMPA).
    Dew IM; Walenz B; Sutton G
    J Comput Biol; 2005 Jun; 12(5):497-513. PubMed ID: 15952874
    [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. 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]  

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

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

  • 10. Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences.
    Gao S; Sung WK; Nagarajan N
    J Comput Biol; 2011 Nov; 18(11):1681-91. PubMed ID: 21929371
    [TBL] [Abstract][Full Text] [Related]  

  • 11. EPGA: de novo assembly using the distributions of reads and insert size.
    Luo J; Wang J; Zhang Z; Wu FX; Li M; Pan Y
    Bioinformatics; 2015 Mar; 31(6):825-33. PubMed ID: 25406329
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. GAPPadder: a sensitive approach for closing gaps on draft genomes with short sequence reads.
    Chu C; Li X; Wu Y
    BMC Genomics; 2019 Jun; 20(Suppl 5):426. PubMed ID: 31167639
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. SLIQ: simple linear inequalities for efficient contig scaffolding.
    Roy RS; Chen KC; Sengupta AM; Schliep A
    J Comput Biol; 2012 Oct; 19(10):1162-75. PubMed ID: 23057825
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Assessing the benefits of using mate-pairs to resolve repeats in de novo short-read prokaryotic assemblies.
    Wetzel J; Kingsford C; Pop M
    BMC Bioinformatics; 2011 Apr; 12():95. PubMed ID: 21486487
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 20. A de novo metagenomic assembly program for shotgun DNA reads.
    Lai B; Ding R; Li Y; Duan L; Zhu H
    Bioinformatics; 2012 Jun; 28(11):1455-62. PubMed ID: 22495746
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.