Dengfeng Guan

Dengfeng Guan

Auto-generated profile, based on publicly available information

Dengfeng Guan

Institute of Zoology, Chinese Academy of Sciences

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 April 2021 in Nature
Verified
Journal Article
Open access
PDF file
ARArang Rhie
Arang Rhie
SMShane A. McCarthy
Shane A. McCarthy
OFOlivier Fedrigo
Olivier Fedrigo
JDJoana Damas
Joana Damas
GFGiulio Formenti
Giulio Formenti
EJErich D. Jarvis
Erich D. Jarvis
High-quality and complete reference genome assemblies are fundamental for the application of genomics to biology, disease, and biodiversity conservation. However, such assemblies are available for only a few non-microbial species1–4. To address this issue, the international Genome 10K (G10K) consortium5,6 has worked over a five-year period to evaluate and develop cost-effective methods for assembling highly accurate and nearly complete reference genomes. Here we present lessons learned from generating assemblies for 16 species that represent six major vertebrate lineages. We confirm that long-read sequencing technologies are essential for maximizing genome quality, and that unresolved complex repeats and haplotype heterozygosity are major sources of assembly error when not handled correctly. Our assemblies correct substantial errors, add missing sequence in some of the best historical reference genomes, and reveal biological discoveries. These include the identification of many false gene duplications, increases in gene sizes, chromosome rearrangements that are specific to lineages, a repeated independent chromosome breakpoint in bat genomes, and a canonical GC-rich pattern in protein-coding genes and their regulatory regions. Adopting these lessons, we have embarked on the Vertebrate Genomes Project (VGP), an international effort to generate high-quality, complete reference genomes for all of the roughly 70,000 extant vertebrate species and to help to enable a new era of discovery across the life sciences.

23 January 2020 in Bioinformatics
Verified
Journal Article
Open access
PDF file
DGDengfeng Guan
Dengfeng Guan
SMShane A McCarthy
Shane A McCarthy
JWJonathan Wood
Jonathan Wood
KHKerstin Howe
Kerstin Howe
YWYadong Wang
Yadong Wang
RDRichard Durbin
Richard Durbin
Rapid development in long-read sequencing and scaffolding technologies is accelerating the production of reference-quality assemblies for large eukaryotic genomes. However, haplotype divergence in regions of high heterozygosity often results in assemblers creating two copies rather than one copy of a region, leading to breaks in contiguity and compromising downstream steps such as gene annotation. Several tools have been developed to resolve this problem. However, they either focus only on removing contained duplicate regions, also known as haplotigs, or fail to use all the relevant information and hence make errors. Here we present a novel tool, purge_dups, that uses sequence similarity and read depth to automatically identify and remove both haplotigs and heterozygous overlaps. In comparison with current tools, we demonstrate that purge_dups can reduce heterozygous duplication and increase assembly continuity while maintaining completeness of the primary assembly. Moreover, purge_dups is fully automatic and can easily be integrated into assembly pipelines. The source code is written in C and is available at https://github.com/dfguan/purge_dups. Supplementary data are available at Bioinformatics online.

23 May 2020 in bioRxiv
Verified
Preprint
Open access
PDF file
ARArang Rhie
Arang Rhie
SMShane A. McCarthy
Shane A. McCarthy
OFOlivier Fedrigo
Olivier Fedrigo
JDJoana Damas
Joana Damas
GFGiulio Formenti
Giulio Formenti
EJErich D. Jarvis
Erich D. Jarvis
High-quality and complete reference genome assemblies are fundamental for the application of genomics to biology, disease, and biodiversity conservation. However, such assemblies are only available for a few non-microbial species 1–4 . To address this issue, the international Genome 10K (G10K) consortium 5,6 has worked over a five-year period to evaluate and develop cost-effective methods for assembling the most accurate and complete reference genomes to date. Here we summarize these developments, introduce a set of quality standards, and present lessons learned from sequencing and assembling 16 species representing major vertebrate lineages (mammals, birds, reptiles, amphibians, teleost fishes and cartilaginous fishes). We confirm that long-read sequencing technologies are essential for maximizing genome quality and that unresolved complex repeats and haplotype heterozygosity are major sources of error in assemblies. Our new assemblies identify and correct substantial errors in some of the best historical reference genomes. Adopting these lessons, we have embarked on the Vertebrate Genomes Project (VGP), an effort to generate high-quality, complete reference genomes for all ~70,000 extant vertebrate species and help enable a new era of discovery across the life sciences.

14 November 2015 in Bioinformatics
Verified
Journal Article
Open access
BLBo Liu
Bo Liu
DGDengfeng Guan
Dengfeng Guan
MTMingxiang Teng
Mingxiang Teng
YWYadong Wang
Yadong Wang
Motivation: Single Molecule Real-Time (SMRT) sequencing has been widely applied in cutting-edge genomic studies. However, it is still an expensive task to align the noisy long SMRT reads to reference genome by state-of-the-art aligners, which is becoming a bottleneck in applications with SMRT sequencing. Novel approach is on demand for improving the efficiency and effectiveness of SMRT read alignment. Results: We propose Regional Hashing-based Alignment Tool (rHAT), a seed-and-extension-based read alignment approach specifically designed for noisy long reads. rHAT indexes reference genome by regional hash table (RHT), a hash table-based index which describes the short tokens within local windows of reference genome. In the seeding phase, rHAT utilizes RHT for efficiently calculating the occurrences of short token matches between partial read and local genomic windows to find highly possible candidate sites. In the extension phase, a sparse dynamic programming-based heuristic approach is used for reducing the cost of aligning read to the candidate sites. By benchmarking on the real and simulated datasets from various prokaryote and eukaryote genomes, we demonstrated that rHAT can effectively align SMRT reads with outstanding throughput. Availability and implementation: rHAT is implemented in C++; the source code is available at https://github.com/HIT-Bioinformatics/rHAT. Contact:ydwang@hit.edu.cn Supplementary information: Supplementary data are available at Bioinformatics online.

14 August 2019 in bioRxiv
Verified
Preprint
Open access
DGDengfeng Guan
Dengfeng Guan
SMShane A. McCarthy
Shane A. McCarthy
JWJonathan Wood
Jonathan Wood
KHKerstin Howe
Kerstin Howe
YWYadong Wang
Yadong Wang
RDRichard Durbin
Richard Durbin
Motivation: Rapid development in long read sequencing and scaffolding technologies is accelerating the production of reference-quality assemblies for large eukaryotic genomes. However, haplotype divergence in regions of high heterozygosity often results in assemblers creating two copies rather than one copy of a region, leading to breaks in contiguity and compromising downstream steps such as gene annotation. Several tools have been developed to resolve this problem. However, they either only focus on removing contained duplicate regions, also known as haplotigs, or fail to use all the relevant information and hence make errors. Results: Here we present a novel tool “purge_dups” that uses sequence similarity and read depth to automatically identify and remove both haplotigs and heterozygous overlaps. In comparison with the current standard, purge_haplotigs, we demonstrate that purge_dups can reduce heterozygous duplication and increase assembly continuity while maintaining completeness of the primary assembly. Moreover, purge_dups is fully automatic and can be easy integrated into assembly pipelines. Availability: The source code is written in C and is available at https://github.com/dfguan/purge_dups . Contact: ydwang@hit.edu.cn , rd109@cam.ac.uk

1 December 2018
Verified
Conference Paper
Closed access
DGDengfeng Guan
Dengfeng Guan
BLBo Liu
Bo Liu
YWYadong Wang
Yadong Wang
One of the core problems in metagenomics is the classification of shotgun sequencing reads to identify species present in samples. Many supervised classification tools have been developed recently, but they either consume large memory or large computation time. Herein we propose a new classification method, de Bruijn Graph-based Species Identifier (deSPI), which takes advantage of de Bruijn graph and FM-index data structures and a hierarchical top-down strategy to do classification. The experimental results suggest that deSPI uses much less memory than Clark and Kraken and classifies reads much faster than Centrifuge and Kaiju, while maintaining a comparable sensitivity and accuracy.