Demo Data from EDBT 2026 / reviewers in the wild / expert
Robert L. Bass
dblp:50/6613
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2008
—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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence analysis › motif discovery
de novo motif discovery |
0.1 | 1 | 2008 | fdrMotif: identifying cis-elements by an EM algorithm coupled with false discovery rate control · Bioinform. 2008 |
Bioinformatics and computational biology › sequence analysis › motif discovery
sequence motif detection |
0.1 | 1 | 2008 | fdrMotif: identifying cis-elements by an EM algorithm coupled with false discovery rate control · Bioinform. 2008 |
Bioinformatics and computational biology › sequence analysis › motif discovery
regulatory motif discovery |
0.1 | 1 | 2007 | GAPWM: a genetic algorithm method for optimizing a position weight matrix · Bioinform. 2007 |
Bioinformatics and computational biology › gene regulation
transcription factor binding site prediction |
0.0 | 1 | 2007 | GAPWM: a genetic algorithm method for optimizing a position weight matrix · Bioinform. 2007 |
Methods — techniques the papers use, named apart from their topics
position weight matrix · 0.1false discovery rate control · 0.1expectation-maximization · 0.1genetic algorithm · 0.1ROC curve maximization · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | fdrMotif: identifying cis-elements by an EM algorithm coupled with false discovery rate controlabstractMOTIVATION: Most de novo motif identification methods optimize the motif model first and then separately test the statistical significance of the motif score. In the first stage, a motif abundance parameter needs to be specified or modeled. In the second stage, a Z-score or P-value is used as the test statistic. Error rates under multiple comparisons are not fully considered. METHODOLOGY: We propose a simple but novel approach, fdrMotif, that selects as many binding sites as possible while controlling a user-specified false discovery rate (FDR). Unlike existing iterative methods, fdrMotif combines model optimization [e.g. position weight matrix (PWM)] and significance testing at each step. By monitoring the proportion of binding sites selected in many sets of background sequences, fdrMotif controls the FDR in the original data. The model is then updated using an expectation (E)- and maximization (M)-like procedure. We propose a new normalization procedure in the E-step for updating the model. This process is repeated until either the model converges or the number of iterations exceeds a maximum. RESULTS: Simulation studies suggest that our normalization procedure assigns larger weights to the binding sites than do two other commonly used normalization procedures. Furthermore, fdrMotif requires only a user-specified FDR and an initial PWM. When tested on 542 high confidence experimental p53 binding loci, fdrMotif identified 569 p53 binding sites in 505 (93.2%) sequences. In comparison, MEME identified more binding sites but in fewer ChIP sequences than fdrMotif. When tested on 500 sets of simulated 'ChIP' sequences with embedded known p53 binding sites, fdrMotif, compared to MEME, has higher sensitivity with similar positive predictive value. Furthermore, fdrMotif is robust to noise: it selected nearly identical binding sites in data adulterated with 50% added background sequences and the unadulterated data. We suggest that fdrMotif represents an improvement over MEME. AVAILABILITY: C code can be found at: http://www.niehs.nih.gov/research/resources/software/fdrMotif/. Leping Li, Robert L. Bass |
Bioinform. | 2 |
| 2007 | GAPWM: a genetic algorithm method for optimizing a position weight matrixabstractMOTIVATION: Position weight matrices (PMWs) are simple models commonly used in motif-finding algorithms to identify short functional elements, such as cis-regulatory motifs, on genes. When few experimentally verified motifs are available, estimation of the PWM may be poor. The resultant PWM may not reliably discriminate a true motif from a false one. While experimentally identifying such motifs remains time-consuming and expensive, low-resolution binding data from techniques such as ChIP-on-chip and ChIP-PET have become available. We propose a novel but simple method to improve a poorly estimated PWM using ChIP data. METHODOLOGY: Starting from an existing PWM, a set of ChIP sequences, and a set of background sequences, our method, GAPWM, derives an improved PWM via a genetic algorithm that maximizes the area under the receiver operating characteristic (ROC) curve. GAPWM can easily incorporate prior information such as base conservation. We tested our method on two PMWs (Oct4/Sox2 and p53) using three recently published ChIP data sets (human Oct4, mouse Oct4 and human p53). RESULTS: GAPWM substantially increased the sensitivity/specificity of a poorly estimated PWM and further improved the quality of a good PWM. Furthermore, it still functioned when the starting PWM contained a major error. The ROC performance of GAPWM compared favorably with that of MEME and others. With increasing availability of ChIP data, our method provides an alternative for obtaining high-quality PWMs for genome-wide identification of transcription factor binding sites. AVAILABILITY: The C source code and all data used in this report are available at http://dir.niehs.nih.gov/dirbb/gapwm. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Leping Li, Robert L. Bass |
Bioinform. | 3 |