Xiangke Liao

Xiangke Liao

Auto-generated profile, based on publicly available information

Xiangke Liao

College of Computer Science and Technology, National University of Defense Technology, Changsha, China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 December 2012 in GigaScience
Verified
Journal Article
Open access
PDF file
RLRuibang Luo
Ruibang Luo
BLBinghang Liu
Binghang Liu
YXYinlong Xie
Yinlong Xie
ZLZhenyu Li
Zhenyu Li
WHWeihua Huang
Weihua Huang
JWJun Wang
Jun Wang
Background: There is a rapidly increasing amount of de novo genome assembly using next-generation sequencing (NGS) short reads; however, several big challenges remain to be overcome in order for this to be efficient and accurate. SOAPdenovo has been successfully applied to assemble many published genomes, but it still needs improvement in continuity, accuracy and coverage, especially in repeat regions. Findings: To overcome these challenges, we have developed its successor, SOAPdenovo2, which has the advantage of a new algorithm design that reduces memory consumption in graph construction, resolves more repeat regions in contig assembly, increases coverage and length in scaffold construction, improves gap closing, and optimizes for large genome. Conclusions: Benchmark using the Assemblathon1 and GAGE datasets showed that SOAPdenovo2 greatly surpasses its predecessor SOAPdenovo and is competitive to other assemblers on both assembly length and accuracy. We also provide an updated assembly version of the 2008 Asian (YH) genome using SOAPdenovo2. Here, the contig and scaffold N50 of the YH genome were ~20.9 kbp and ~22 Mbp, respectively, which is 3-fold and 50-fold longer than the first published version. The genome coverage increased from 81.16% to 93.91%, and memory consumption was ~2/3 lower during the point of largest memory consumption.

14 February 2013 in Genome Biology
Verified
Journal Article
Open access
PDF file
WJWenlong Jia
Wenlong Jia
KQKunlong Qiu
Kunlong Qiu
MHMinghui He
Minghui He
PSPengfei Song
Pengfei Song
QZQuan Zhou
Quan Zhou
GGGuangwu Guo
Guangwu Guo
We have developed a new method, SOAPfuse, to identify fusion transcripts from paired-end RNA-Seq data. SOAPfuse applies an improved partial exhaustion algorithm to construct a library of fusion junction sequences, which can be used to efficiently identify fusion events, and employs a series of filters to nominate high-confidence fusion transcripts. Compared with other released tools, SOAPfuse achieves higher detection efficiency and consumed less computing resources. We applied SOAPfuse to RNA-Seq data from two bladder cancer cell lines, and confirmed 15 fusion transcripts, including several novel events common to both cell lines. SOAPfuse is available at http://soap.genomics.org.cn/soapfuse.html.

26 May 2014 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
XLXiangke Liao
Xiangke Liao
LXLiquan Xiao
Liquan Xiao
CYCanqun Yang
Canqun Yang
YLYutong Lu
Yutong Lu

12 May 2011 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
XYXue-Jun Yang
Xue-Jun Yang
XLXiang-Ke Liao
Xiang-Ke Liao
KLKai Lu
Kai Lu
QHQing-Feng Hu
Qing-Feng Hu
JSJun-Qiang Song
Jun-Qiang Song
JSJinshu Su
Jinshu Su

20 April 2017 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
MDMingxing Duan
Mingxing Duan
KLKenli Li
Kenli Li
XLXiangke Liao
Xiangke Liao
KLKeqin Li
Keqin Li
As data sets become larger and more complicated, an extreme learning machine (ELM) that runs in a traditional serial environment cannot realize its ability to be fast and effective. Although a parallel ELM (PELM) based on MapReduce to process large-scale data shows more efficient learning speed than identical ELM algorithms in a serial environment, some operations, such as intermediate results stored on disks and multiple copies for each task, are indispensable, and these operations create a large amount of extra overhead and degrade the learning speed and efficiency of the PELMs. In this paper, an efficient ELM based on the Spark framework (SELM), which includes three parallel subalgorithms, is proposed for big data classification. By partitioning the corresponding data sets reasonably, the hidden layer output matrix calculation algorithm, matrix Û decomposition algorithm, and matrix V decomposition algorithm perform most of the computations locally. At the same time, they retain the intermediate results in distributed memory and cache the diagonal matrix as broadcast variables instead of several copies for each task to reduce a large amount of the costs, and these actions strengthen the learning ability of the SELM. Finally, we implement our SELM algorithm to classify large data sets. Extensive experiments have been conducted to validate the effectiveness of the proposed algorithms. As shown, our SELM achieves an 8.71× speedup on a cluster with ten nodes, and reaches a 13.79× speedup with 15 nodes, an 18.74× speedup with 20 nodes, a 23.79× speedup with 25 nodes, a 28.89× speedup with 30 nodes, and a 33.81× speedup with 35 nodes.

17 October 2018 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
YYYatao Yang
Yatao Yang
ZZZibin Zheng
Zibin Zheng
XNXiangdong Niu
Xiangdong Niu
MTMingdong Tang
Mingdong Tang
LYLu Yu-Tong
Lu Yu-Tong
XLXiangke Liao
Xiangke Liao
With the prevalence of web services, a large number of similar web services are provided by different providers. To select the optimal service among these service candidates, Quality of Service (QoS), representing the non-functional characteristics, plays an important role. To obtain the QoS values of web services, a number of web service QoS prediction methods have been proposed. Collaborative web service QoS prediction is one of the most popular approaches. Based on the historical QoS data, collaborative QoS prediction methods employ memory-based collaborative filtering (CF), model-based CF, or their hybrids to predict QoS values. However, these methods usually only consider the QoS information of similar users and services, neglecting the correlation between them. To enhance the prediction accuracy, we propose a novel method to predict QoS values based on factorization machine, which leverages not only QoS information of users and services but also the user and service neighbor's information. To evaluate our approach, we conduct experiments on a large-scale real-world dataset with 1,974,675 web service invocations. The experiment results show that our approach achieves higher prediction accuracy than other QoS prediction methods.