A new algorithm for de novo genome assembly
Explore this paper's citation graph
Summary
A new overlap graph based genome assembler called Paired-End Genome ASsembly Using Short-sequences (PEGASUS) for paired-end short reads produced by NGS techniques, which exhibits comparable and in many cases better performance than the leading genome assemblers.
- Type
- article
- Published
- 2012-01-01
- Cited by
- 2
- References
- 54
- Access
- Open access
- OpenAlex
- https://openalex.org/W280975
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:81318085
Keywords
De Bruijn graph, Sequence assembly, Genome, Hybrid genome assembly, k-mer
References
- ALLPATHS: de novo assembly of whole-genome shotgun microreads.
- An efficient implementation of a scaling minimum-cost flow algorithm
- Large-scale genome sequence processing
- Exact and approximation algorithms for DNA sequence reconstruction
- A whole-genome assembly of Drosophila.
- A new method of sequencing DNA.
- Amplification of complex gene libraries by emulsion PCR
- Suffix arrays: a new method for on-line string searches
- Toward Simplifying and Accurately Formulating Fragment Assembly
- Linguistics of nucleotide sequences. II: Stationary words in genetic texts and the zonal structure of DNA.
- Real-time DNA sequencing using detection of pyrophosphate release.
- An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems
- Lightweight Data Indexing and Compression in External Memory
- The Human Genome Project: Lessons from Large-Scale Biology
- A New Algorithm for DNA Sequence Assembly
- Automated DNA sequencing of the human HPRT locus.
- De novo bacterial genome sequencing: millions of very short reads assembled on a desktop computer.
- Single-molecule sequencing of an individual human genome
- Maximum Likelihood Genome Assembly
- A new approach to fragment assembly in DNA sequencing
Cited by
Related papers
- De novo assembly methods for next generation sequencing data
- Paired de Bruijn Graphs: A Novel Approach for Incorporating Mate Pair Information into Genome Assemblers
- Empirical evaluation of methods for de novo genome assembly
- Efficient algorithms for sequence assembly
- De Bruijn Graph-Based Whole-Genomic Sequence Assembly Algorithms and Applications
- Clover: a clustering-oriented de novo assembler for Illumina sequences
- Effective Utilization of Paired Reads to Improve Length and Accuracy of Contigs in Genome Assembly
- Next generation sequencing under de novo genome assembly
- Assembly Algorithms for Next-Generation Sequencing Data
- Ray: Simultaneous Assembly of Reads from a Mix of High-Throughput Sequencing Technologies