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

Yinlong Xie

dblp:121/5071 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author

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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › transcriptomics › transcript assembly
de novo transcriptome assembly
0.212014
SOAPdenovo-Trans: de novo transcriptome assembly with short RNA-Seq reads · Bioinform. 2014
Bioinformatics and computational biology › sequence analysis › sequence assembly
transcriptome assembly
0.212014
SOAPdenovo-Trans: de novo transcriptome assembly with short RNA-Seq reads · Bioinform. 2014
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly
0.112012
COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly · Bioinform. 2012
Bioinformatics and computational biology
next-generation sequencing
0.012012
COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly · Bioinform. 2012
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
short read assembly
0.012012
COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly · Bioinform. 2012

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

de bruijn graph assembly · 0.2k-mer frequency analysis · 0.1
YearPublicationVenuePosition
2014 SOAPdenovo-Trans: de novo transcriptome assembly with short RNA-Seq reads
abstract
MOTIVATION: Transcriptome sequencing has long been the favored method for quickly and inexpensively obtaining a large number of gene sequences from an organism with no reference genome. Owing to the rapid increase in throughputs and decrease in costs of next- generation sequencing, RNA-Seq in particular has become the method of choice. However, the very short reads (e.g. 2 × 90 bp paired ends) from next generation sequencing makes de novo assembly to recover complete or full-length transcript sequences an algorithmic challenge. RESULTS: Here, we present SOAPdenovo-Trans, a de novo transcriptome assembler designed specifically for RNA-Seq. We evaluated its performance on transcriptome datasets from rice and mouse. Using as our benchmarks the known transcripts from these well-annotated genomes (sequenced a decade ago), we assessed how SOAPdenovo-Trans and two other popular transcriptome assemblers handled such practical issues as alternative splicing and variable expression levels. Our conclusion is that SOAPdenovo-Trans provides higher contiguity, lower redundancy and faster execution. AVAILABILITY AND IMPLEMENTATION: Source code and user manual are available at http://sourceforge.net/projects/soapdenovotrans/.
Yinlong Xie, Gengxiong Wu, Jingbo Tang, Ruibang Luo, Jordan Patterson, Shanlin Liu, Weihua Huang, Guangzhu He, Shengchang Gu, Shengkang Li, Tak Wah Lam, Yingrui Li, Gane Ka-Shu Wong, Jun Wang 0004
Bioinform.1
2012 COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly
abstract
MOTIVATION: The boost of next-generation sequencing technologies provides us with an unprecedented opportunity for elucidating genetic mysteries, yet the short-read length hinders us from better assembling the genome from scratch. New protocols now exist that can generate overlapping pair-end reads. By joining the 3' ends of each read pair, one is able to construct longer reads for assembling. However, effectively joining two overlapped pair-end reads remains a challenging task. RESULT: In this article, we present an efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30× simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE connected over 99% of reads with 98.8% accuracy, which is, respectively, 10 and 2% higher than the recently published tool FLASH. When COPE is applied to real reads for genome assembly, the resulting contigs are found to have fewer errors and give a 14-fold improvement in the N50 measurement when compared with the contigs produced using unconnected reads. AVAILABILITY AND IMPLEMENTATION: COPE is implemented in C++ and is freely available as open-source code at ftp://ftp.genomics.org.cn/pub/cope. CONTACT: [email protected] or [email protected]
Binghang Liu, Jianying Yuan, Siu-Ming Yiu, Yinlong Xie, Yujian Shi, Yingrui Li, Tak Wah Lam, Ruibang Luo
Bioinform.5