Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chang-Jin Song

dblp:00/10152 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
error correction
0.412019
FLAS: fast and high-throughput algorithm for PacBio long-read self-correction · Bioinform. 2019
Bioinformatics and computational biology › sequence analysis
long-read sequencing
0.412019
FLAS: fast and high-throughput algorithm for PacBio long-read self-correction · Bioinform. 2019
Bioinformatics and computational biology
self-correction
0.412019
FLAS: fast and high-throughput algorithm for PacBio long-read self-correction · Bioinform. 2019
Bioinformatics and computational biology
sequence analysis
0.412019
FLAS: fast and high-throughput algorithm for PacBio long-read self-correction · Bioinform. 2019
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly
0.312018
ReMILO: reference assisted misassembly detection algorithm using short and long reads · Bioinform. 2018
Bioinformatics and computational biology
genomics
0.312018
ReMILO: reference assisted misassembly detection algorithm using short and long reads · Bioinform. 2018
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
misassembly detection
0.312018
ReMILO: reference assisted misassembly detection algorithm using short and long reads · Bioinform. 2018
Bioinformatics and computational biology › sequence analysis › sequence assembly
contig assembly
0.112019
FLAS: fast and high-throughput algorithm for PacBio long-read self-correction · Bioinform. 2019
Bioinformatics and computational biology › sequence analysis
sequence assembly
0.112019
FLAS: fast and high-throughput algorithm for PacBio long-read self-correction · Bioinform. 2019

Methods — techniques the papers use, named apart from their topics

wrapper algorithm · 0.4read alignment · 0.4short read alignment · 0.3long-read alignment · 0.3de bruijn graph · 0.3
YearPublicationVenuePosition
2019 FLAS: fast and high-throughput algorithm for PacBio long-read self-correction
abstract
MOTIVATION: The third generation PacBio long reads have greatly facilitated sequencing projects with very large read lengths, but they contain about 15% sequencing errors and need error correction. For the projects with long reads only, it is challenging to make correction with fast speed, and also challenging to correct a sufficient amount of read bases, i.e. to achieve high-throughput self-correction. MECAT is currently among the fastest self-correction algorithms, but its throughput is relatively small (Xiao et al., 2017). RESULTS: Here, we introduce FLAS, a wrapper algorithm of MECAT, to achieve high-throughput long-read self-correction while keeping MECAT's fast speed. FLAS finds additional alignments from MECAT prealigned long reads to improve the correction throughput, and removes misalignments for accuracy. In addition, FLAS also uses the corrected long-read regions to correct the uncorrected ones to further improve the throughput. In our performance tests on Escherichia coli, Saccharomyces cerevisiae, Arabidopsis thaliana and human long reads, FLAS can achieve 22.0-50.6% larger throughput than MECAT. FLAS is 2-13× faster compared to the self-correction algorithms other than MECAT, and its throughput is also 9.8-281.8% larger. The FLAS corrected long reads can be assembled into contigs of 13.1-29.8% larger N50 sizes than MECAT. AVAILABILITY AND IMPLEMENTATION: The FLAS software can be downloaded for free from this site: https://github.com/baoe/flas. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Ergude Bao, Chang-Jin Song
Bioinform.3
2018 ReMILO: reference assisted misassembly detection algorithm using short and long reads
abstract
Motivation: Contigs assembled from the second generation sequencing short reads may contain misassemblies, and thus complicate downstream analysis or even lead to incorrect analysis results. Fortunately, with more and more sequenced species available, it becomes possible to use the reference genome of a closely related species to detect misassemblies. In addition, long reads of the third generation sequencing technology have been more and more widely used, and can also help detect misassemblies. Results: Here, we introduce ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called red-black multipositional de Bruijn graph to detect misassemblies. In addition, ReMILO also aligns the contigs to long reads and find their differences from the long reads to detect more misassemblies. In our performance test on short read assemblies of human chromosome 14 data, ReMILO can detect 41.8-77.9% extensive misassemblies and 33.6-54.5% local misassemblies. On hybrid short and long read assemblies of S.pastorianus data, ReMILO can also detect 60.6-70.9% extensive misassemblies and 28.6-54.0% local misassemblies. Availability and implementation: The ReMILO software can be downloaded for free under Artistic License 2.0 from this site: https://github.com/songc001/remilo. Contact: [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online.
Ergude Bao, Chang-Jin Song, Lingxiao Lan
Bioinform.2