Demo Data from EDBT 2026 / reviewers in the wild / expert
Chi-Sheng Cheng
dblp:13/7969
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 1
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
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference |
0.1 | 1 | 2010 | WebPARE: web-computing for inferring genetic or transcriptional interactions · Bioinform. 2010 |
Bioinformatics and computational biology
gene expression analysis |
0.0 | 1 | 2010 | WebPARE: web-computing for inferring genetic or transcriptional interactions · Bioinform. 2010 |
Bioinformatics and computational biology › gene expression analysis
time course gene expression analysis |
0.0 | 1 | 2010 | WebPARE: web-computing for inferring genetic or transcriptional interactions · Bioinform. 2010 |
Methods — techniques the papers use, named apart from their topics
pattern recognition · 0.1nonlinear scoring · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | WebPARE: web-computing for inferring genetic or transcriptional interactionsabstractSUMMARY: Inferring genetic or transcriptional interactions, when done successfully, may provide insights into biological processes or biochemical pathways of interest. Unfortunately, most computational algorithms require a certain level of programming expertise. To provide a simple web interface for users to infer interactions from time course gene expression data, we present WebPARE, which is based on the pattern recognition algorithm (PARE). For expression data, in which each type of interaction (e.g. activator target) and the corresponding paired gene expression pattern are significantly associated, PARE uses a non-linear score to classify gene pairs of interest into a few subclasses of various time lags. In each subclass, PARE learns the parameters in the decision score using known interactions from biological experiments or published literature. Subsequently, the trained algorithm predicts interactions of a similar nature. Previously, PARE was shown to infer two sets of interactions in yeast successfully. Moreover, several predicted genetic interactions coincided with existing pathways; this indicates the potential of PARE in predicting partial pathway components. Given a list of gene pairs or genes of interest and expression data, WebPARE invokes PARE and outputs predicted interactions and their networks in directed graphs. Cheng-Long Chuang, Jia-Hong Wu, Chi-Sheng Cheng, Grace S. Shieh |
Bioinform. | 3 |