Demo Data from EDBT 2026 / reviewers in the wild / expert
Nathan O. Siemers
dblp:55/5760
· DBLP profile ↗
4ranked-venue papers
0as first author
0since 2021 · last 2011
0000-0003-2773-0081ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 4
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 · 90% Medical and health informatics · 10% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › biostatistics
dose-response analysis |
0.1 | 1 | 2011 | SDRS - an algorithm for analyzing large-scale dose-response data · Bioinform. 2011 |
Bioinformatics and computational biology › network bioinformatics › biological network analysis
gene co-expression network analysis |
0.1 | 1 | 2007 | Construction of a reference gene association network from multiple profiling data: application to data analysis · Bioinform. 2007 |
Bioinformatics and computational biology
gene expression analysis |
0.1 | 1 | 2007 | Construction of a reference gene association network from multiple profiling data: application to data analysis · Bioinform. 2007 |
Bioinformatics and computational biology
genomics |
0.1 | 1 | 2007 | Construction of a reference gene association network from multiple profiling data: application to data analysis · Bioinform. 2007 |
Methods — techniques the papers use, named apart from their topics
sigmoidal curve fitting · 0.1grid search · 0.1non-parametric approach · 0.1graph partitioning · 0.1false discovery rate · 0.1MANOVA · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | SDRS - an algorithm for analyzing large-scale dose-response dataabstractSUMMARY: Dose-response information is critical to understanding drug effects, yet analytical methods for dose-response assays cannot cope with the dimensionality of large-scale screening data such as the microarray profiling data. To overcome this limitation, we developed and implemented the Sigmoidal Dose Response Search (SDRS) algorithm, a grid search-based method designed to handle large-scale dose-response data. This method not only calculates the pharmacological parameters for every assay, but also provides built-in statistic that enables downstream systematic analyses, such as characterizing dose response at the transcriptome level. AVAILABILITY: Bio::SDRS is freely available from CPAN (www.cpan.org). CONTACTS: [email protected]; [email protected] SUPPLEMENTARY INFORMATION: Supplementary data is available at Bioinformatics online. Rui-Ru Ji, Nathan O. Siemers, Liang Schweizer, Robert E. Bruccoleri |
Bioinform. | 2 |
| 2009 | Transcriptional Profiling of the Dose Response: A More Powerful Approach for Characterizing Drug ActivitiesabstractThe dose response curve is the gold standard for measuring the effect of a drug treatment, but is rarely used in genomic scale transcriptional profiling due to perceived obstacles of cost and analysis. One barrier to examining transcriptional dose responses is that existing methods for microarray data analysis can identify patterns, but provide no quantitative pharmacological information. We developed analytical methods that identify transcripts responsive to dose, calculate classical pharmacological parameters such as the EC50, and enable an in-depth analysis of coordinated dose-dependent treatment effects. The approach was applied to a transcriptional profiling study that evaluated four kinase inhibitors (imatinib, nilotinib, dasatinib and PD0325901) across a six-logarithm dose range, using 12 arrays per compound. The transcript responses proved a powerful means to characterize and compare the compounds: the distribution of EC50 values for the transcriptome was linked to specific targets, dose-dependent effects on cellular processes were identified using automated pathway analysis, and a connection was seen between EC50s in standard cellular assays and transcriptional EC50s. Our approach greatly enriches the information that can be obtained from standard transcriptional profiling technology. Moreover, these methods are automated, robust to non-optimized assays, and could be applied to other sources of quantitative data. Rui-Ru Ji, Heshani de Silva, Yisheng Jin, Robert E. Bruccoleri, Aiqing He, Paul S. Kayne, Isaac Neuhaus, Karl-Heinz Ott, Becky Penhallow, Mark I. Cockett, Michael G. Neubauer 0002, Nathan O. Siemers, Petra Ross-MacDonald |
PLoS Comput. Biol. | 14 |
| 2007 | Construction of a reference gene association network from multiple profiling data: application to data analysisabstractMOTIVATION: Gene expression profiling is an important tool for gaining insight into biology. Novel strategies are required to analyze the growing archives of microarray data and extract useful information from them. One area of interest is in the construction of gene association networks from collections of profiling data. Various approaches have been proposed to construct gene networks using profiling data, and these networks have been used in functional inference as well as in data visualization. Here, we investigated a non-parametric approach to translate profiling data into a gene network. We explored the characteristics and utility of the resulting network and investigated the use of network information in analysis of variance models and hypothesis testing. RESULTS: Our work is composed of two parts: gene network construction and partitioning and hypothesis testing using sub-networks as groups. In the first part, multiple independently collected microarray datasets from the Gene Expression Omnibus data repository were analyzed to identify probe pairs that are positively co-regulated across the samples. A co-expression network was constructed based on a reciprocal ranking criteria and a false discovery rate analysis. We named this network Reference Gene Association (RGA) network. Then, the network was partitioned into densely connected sub-networks of probes using a multilevel graph partitioning algorithm. In the second part, we proposed a new, MANOVA-based approach that can take individual probe expression values as input and perform hypothesis testing at the sub-network level. We applied this MANOVA methodology to two published studies and our analysis indicated that the methodology is both effective and sensitive for identifying transcriptional sub-networks or pathways that are perturbed across treatments. Duygu Ucar, Isaac Neuhaus, Petra Ross-MacDonald, Charles Tilford, Srinivasan Parthasarathy 0001, Nathan O. Siemers, Rui-Ru Ji |
Bioinform. | 6 |
| 2007 | Nearest Neighbor Networks: clustering expression data based on gene neighborhoodsabstractBACKGROUND: The availability of microarrays measuring thousands of genes simultaneously across hundreds of biological conditions represents an opportunity to understand both individual biological pathways and the integrated workings of the cell. However, translating this amount of data into biological insight remains a daunting task. An important initial step in the analysis of microarray data is clustering of genes with similar behavior. A number of classical techniques are commonly used to perform this task, particularly hierarchical and K-means clustering, and many novel approaches have been suggested recently. While these approaches are useful, they are not without drawbacks; these methods can find clusters in purely random data, and even clusters enriched for biological functions can be skewed towards a small number of processes (e.g. ribosomes). RESULTS: We developed Nearest Neighbor Networks (NNN), a graph-based algorithm to generate clusters of genes with similar expression profiles. This method produces clusters based on overlapping cliques within an interaction network generated from mutual nearest neighborhoods. This focus on nearest neighbors rather than on absolute distance measures allows us to capture clusters with high connectivity even when they are spatially separated, and requiring mutual nearest neighbors allows genes with no sufficiently similar partners to remain unclustered. We compared the clusters generated by NNN with those generated by eight other clustering methods. NNN was particularly successful at generating functionally coherent clusters with high precision, and these clusters generally represented a much broader selection of biological processes than those recovered by other methods. CONCLUSION: The Nearest Neighbor Networks algorithm is a valuable clustering method that effectively groups genes that are likely to be functionally related. It is particularly attractive due to its simplicity, its success in the analysis of large datasets, and its ability to span a wide range of biological functions with high precision. Curtis Huttenhower, Avi I. Flamholz, Jessica N. Landis, Sauhard Sahi, Chad L. Myers, Kellen L. Olszewski, Matthew A. Hibbs, Nathan O. Siemers, Olga G. Troyanskaya, Hilary A. Coller |
BMC Bioinform. | 8 |