The combination of direct and paired link graphs can boost repetitive genome assembly
Published 2016 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
The combination of direct and paired link graphs can boost repetitive genome assembly
Authors
Keywords
-
Journal
NUCLEIC ACIDS RESEARCH
Volume 45, Issue 6, Pages e43-e43
Publisher
Oxford University Press (OUP)
Online
2016-11-17
DOI
10.1093/nar/gkw1191
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- ScaffMatch: scaffolding algorithm based on maximum weight matching
- (2015) Igor Mandric et al. BIOINFORMATICS
- One chromosome, one contig: complete microbial genomes from long-read sequencing and assembly
- (2015) Sergey Koren et al. CURRENT OPINION IN MICROBIOLOGY
- Assembling large genomes with single-molecule sequencing and locality-sensitive hashing
- (2015) Konstantin Berlin et al. NATURE BIOTECHNOLOGY
- ExSPAnder: a universal repeat resolver for DNA fragment assembly
- (2014) A. D. Prjibelski et al. BIOINFORMATICS
- BESST - Efficient scaffolding of large fragmented assemblies
- (2014) Kristoffer Sahlin et al. BMC BIOINFORMATICS
- Extensive Error in the Number of Genes Inferred from Draft Genome Assemblies
- (2014) James F. Denton et al. PLoS Computational Biology
- A reference bacterial genome dataset generated on the MinION™ portable single-molecule nanopore sequencer
- (2014) Joshua Quick et al. GigaScience
- QUAST: quality assessment tool for genome assemblies
- (2013) Alexey Gurevich et al. BIOINFORMATICS
- GAGE-B: an evaluation of genome assemblers for bacterial organisms
- (2013) Tanja Magoc et al. BIOINFORMATICS
- Sequence assembly demystified
- (2013) Niranjan Nagarajan et al. NATURE REVIEWS GENETICS
- Candidate phylum TM6 genome recovered from a hospital sink biofilm provides genomic insights into this uncultivated phylum
- (2013) J. S. McLean et al. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA
- pIRS: Profile-based Illumina pair-end reads simulator
- (2012) Xuesong Hu et al. BIOINFORMATICS
- SCARPA: scaffolding reads with practical algorithms
- (2012) N. Donmez et al. BIOINFORMATICS
- SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing
- (2012) Anton Bankevich et al. JOURNAL OF COMPUTATIONAL BIOLOGY
- Fast gapped-read alignment with Bowtie 2
- (2012) Ben Langmead et al. NATURE METHODS
- Bambus 2: scaffolding metagenomes
- (2011) Sergey Koren et al. BIOINFORMATICS
- Comparison of the two major classes of assembly algorithms: overlap-layout-consensus and de-bruijn-graph
- (2011) Z. Li et al. Briefings in Functional Genomics
- Opera: Reconstructing Optimal Genomic Scaffolds with High-Throughput Paired-End Sequences
- (2011) Song Gao et al. JOURNAL OF COMPUTATIONAL BIOLOGY
- Scaffolding pre-assembled contigs using SSPACE
- (2010) Marten Boetzer et al. BIOINFORMATICS
- SOPRA: Scaffolding algorithm for paired reads via statistical optimization
- (2010) Adel Dayarian et al. BMC BIOINFORMATICS
- Assembly of large genomes using second-generation sequencing
- (2010) M. C. Schatz et al. GENOME RESEARCH
- Assembly algorithms for next-generation sequencing data
- (2010) Jason R. Miller et al. GENOMICS
- Fast and accurate short read alignment with Burrows-Wheeler transform
- (2009) H. Li et al. BIOINFORMATICS
- ABySS: A parallel assembler for short read sequence data
- (2009) J. T. Simpson et al. GENOME RESEARCH
- De novo assembly of human genomes with massively parallel short read sequencing
- (2009) R. Li et al. GENOME RESEARCH
- Ultrafast and memory-efficient alignment of short DNA sequences to the human genome
- (2009) Ben Langmead et al. GENOME BIOLOGY
- ALLPATHS: De novo assembly of whole-genome shotgun microreads
- (2008) J. Butler et al. GENOME RESEARCH
- Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
- (2008) D. R. Zerbino et al. GENOME RESEARCH
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationFind the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
Search