• Publications
  • Influence
miRTarBase update 2018: a resource for experimentally validated microRNA-target interactions
We describe an updated database containing 422 517 curated MTIs from 4076 miRNAs and 23 054 target genes collected from over 8500 articles. Expand
miRTarBase 2016: updates to the experimentally validated miRNA-target interactions database
We present an update of the miRTarBase that provides information about experimentally validated miRNA-target interactions (MTIs) from 138 crosslinking and immunoprecipitation sequencing data sets. Expand
An expanded evaluation of protein function prediction methods shows an improvement in accuracy
We evaluated 126 methods from 56 research groups for their ability to predict biological functions using Gene Ontology and gene-disease associations using Human Phenotype Ontology. Expand
The measurement of user satisfaction with question answering systems
We developed a validated instrument to measure user satisfaction with QAS (USQAS). Expand
Linear Time Algorithms on Circular-Arc Graphs
  • W. Hsu, K. Tsai
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1 November 1991
In this paper, we present an extremely simple O(n) algorithm which simultaneously solves the following three problems (the unweighted version) on circular-arc graphs: the maximum independent set, the minimum clique cover, and the minimum dominating set problems, whereas the best previous bounds for the latter two problems were O(2) and O(3), respectively. Expand
On the maximum empty rectangle problem
We show that if the points of S are drawn randomly and independently from A , the problem can be solved in O( n (log n ) 2 ) expected time. Expand
Predicting RNA-binding sites of proteins using support vector machines and evolutionary information
We propose a method, RNAProB, which incorporates a new smoothed position-specific scoring matrix (PSSM) encoding scheme with a support vector machine model to predict RNA-binding sites in proteins. Expand
PC trees and circular-ones arrangements
A 0-1 matrix has the consecutive-ones property if its columns can be ordered so that the ones in every row are consecutive. Expand
On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
Given N products and a set of "basic data" for each product, e.g., production rate, demand rate, setup time, setup cost and holding cost, etc., the Economic Lot Scheduling Problem is to find aExpand
O(M*N) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
  • W. Hsu
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 June 1995
We characterize those circular-arc graphs which have unique restricted models and give an O(m \cdot n) algorithm for recognizing them. Expand