EDBT 2026 Demo / reviewers in the wild / expert
Valerie Storms
dblp:74/7236
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3
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 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence analysis › motif discovery
regulatory motif discovery |
0.1 | 1 | 2012 | MotifSuite: workflow for probabilistic motif detection and assessment · Bioinform. 2012 |
Bioinformatics and computational biology › sequence analysis
motif discovery |
0.0 | 1 | 2012 | MotifSuite: workflow for probabilistic motif detection and assessment · Bioinform. 2012 |
Methods — techniques the papers use, named apart from their topics
probabilistic motif detection · 0.1motifsampler · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | MotifSuite: workflow for probabilistic motif detection and assessmentabstractMOTIVATION: Probabilistic motif detection requires a multi-step approach going from the actual de novo regulatory motif finding up to a tedious assessment of the predicted motifs. MotifSuite, a user-friendly web interface streamlines this analysis flow. Its core consists of two post-processing procedures that allow prioritizing the motif detection output. The tools offered by MotifSuite are built around the well-established motif detection tool MotifSampler and can also be used in combination with any other probabilistic motif detection tool. Elaborate guidelines on each of its applications have been provided. AVAILABILITY: http://homes.esat.kuleuven.be/bioi_marchal/MotifSuite/Index.htm Marleen Claeys, Valerie Storms, Hong Sun 0002, Tom Michoel, Kathleen Marchal |
Bioinform. | 2 |
| 2011 | Query-based biclustering of gene expression data using Probabilistic Relational ModelsabstractBACKGROUND: With the availability of large scale expression compendia it is now possible to view own findings in the light of what is already available and retrieve genes with an expression profile similar to a set of genes of interest (i.e., a query or seed set) for a subset of conditions. To that end, a query-based strategy is needed that maximally exploits the coexpression behaviour of the seed genes to guide the biclustering, but that at the same time is robust against the presence of noisy genes in the seed set as seed genes are often assumed, but not guaranteed to be coexpressed in the queried compendium. Therefore, we developed ProBic, a query-based biclustering strategy based on Probabilistic Relational Models (PRMs) that exploits the use of prior distributions to extract the information contained within the seed set. RESULTS: We applied ProBic on a large scale Escherichia coli compendium to extend partially described regulons with potentially novel members. We compared ProBic's performance with previously published query-based biclustering algorithms, namely ISA and QDB, from the perspective of bicluster expression quality, robustness of the outcome against noisy seed sets and biological relevance.This comparison learns that ProBic is able to retrieve biologically relevant, high quality biclusters that retain their seed genes and that it is particularly strong in handling noisy seeds. CONCLUSIONS: ProBic is a query-based biclustering algorithm developed in a flexible framework, designed to detect biologically relevant, high quality biclusters that retain relevant seed genes even in the presence of noise or when dealing with low quality seed sets. Lore Cloots, Tim Van den Bulcke, Riet De Smet, Valerie Storms, Pieter Meysman, Kristof Engelen, Kathleen Marchal |
BMC Bioinform. | 6 |
| 2009 | ModuleDigger: an itemset mining framework for the detection of cis-regulatory modulesabstractBACKGROUND: The detection of cis-regulatory modules (CRMs) that mediate transcriptional responses in eukaryotes remains a key challenge in the postgenomic era. A CRM is characterized by a set of co-occurring transcription factor binding sites (TFBS). In silico methods have been developed to search for CRMs by determining the combination of TFBS that are statistically overrepresented in a certain geneset. Most of these methods solve this combinatorial problem by relying on computational intensive optimization methods. As a result their usage is limited to finding CRMs in small datasets (containing a few genes only) and using binding sites for a restricted number of transcription factors (TFs) out of which the optimal module will be selected. RESULTS: We present an itemset mining based strategy for computationally detecting cis-regulatory modules (CRMs) in a set of genes. We tested our method by applying it on a large benchmark data set, derived from a ChIP-Chip analysis and compared its performance with other well known cis-regulatory module detection tools. CONCLUSION: We show that by exploiting the computational efficiency of an itemset mining approach and combining it with a well-designed statistical scoring scheme, we were able to prioritize the biologically valid CRMs in a large set of coregulated genes using binding sites for a large number of potential TFs as input. Hong Sun 0002, Tijl De Bie, Valerie Storms, Qiang Fu 0009, Thomas Dhollander, Karen Lemmens, Annemieke Verstuyf, Bart De Moor, Kathleen Marchal |
BMC Bioinform. | 3 |