Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Robert Castelo

dblp:12/4494 · DBLP profile ↗
← Back
15ranked-venue papers
4as first author
1since 2021 · last 2025
0000-0003-2229-4508ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 6 · 1 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author

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%
Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 94% Learning theory · 6%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genomics
genome analysis
0.312018
GenomicScores: seamless access to genomewide position-specific scores from R and Bioconductor · Bioinform. 2018
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.122006
A Robust Procedure For Gaussian Graphical Model Search From Microarray Data With p Larger Than n · J. Mach. Learn. Res. 2006
On Inclusion-Driven Learning of Bayesian Networks · J. Mach. Learn. Res. 2003
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
gaussian graphical model
0.112006
A Robust Procedure For Gaussian Graphical Model Search From Microarray Data With p Larger Than n · J. Mach. Learn. Res. 2006
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
structure learning
0.112006
A Robust Procedure For Gaussian Graphical Model Search From Microarray Data With p Larger Than n · J. Mach. Learn. Res. 2006
Bioinformatics and computational biology
gene expression analysis
0.112006
A Robust Procedure For Gaussian Graphical Model Search From Microarray Data With p Larger Than n · J. Mach. Learn. Res. 2006
Bioinformatics and computational biology › gene expression analysis
microarray data analysis
0.112006
A Robust Procedure For Gaussian Graphical Model Search From Microarray Data With p Larger Than n · J. Mach. Learn. Res. 2006
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian network
0.012003
On Inclusion-Driven Learning of Bayesian Networks · J. Mach. Learn. Res. 2003
Machine learning › Learning theory
high-dimensional statistics
0.012006
A Robust Procedure For Gaussian Graphical Model Search From Microarray Data With p Larger Than n · J. Mach. Learn. Res. 2006

Methods — techniques the papers use, named apart from their topics

data storage and retrieval · 0.3non-rejection rate · 0.1limited-order partial correlation · 0.1structure learning · 0.0
YearPublicationVenuePosition
2025 Learning and teaching biological data science in the Bioconductor community
abstract
Modern biological research is increasingly data-intensive, leading to a growing demand for effective training in biological data science. In this article, we provide an overview of key resources and best practices available within the Bioconductor project-an open-source software community focused on omics data analysis. This guide serves as a valuable reference for both learners and educators in the field.
Jenny Drnevich, Frederick Tan, Fabricio Almeida-Silva, Robert Castelo, Aedín C. Culhane, Sean R. Davis, Maria A. Doyle, Ludwig Geistlinger, Andrew R. Ghazi, Susan P. Holmes, Leo Lahti, Alexandru Mahmoud, Kozo Nishida, Marcel Ramos, Kevin C. Rue-Albrecht, David J. H. Shih, Laurent Gatto, Charlotte Soneson
PLoS Comput. Biol.4
2018 GenomicScores: seamless access to genomewide position-specific scores from R and Bioconductor
abstract
Summary: Genomewide position-specific scores, such as those estimating conservation, constraint, fitness or mutation tolerance, are ubiquitous in current genome analyses. The diversity of sources and formats of these scores, as well as their size, increase the burden to use them. We present GenomicScores, a Bioconductor package that provides efficient storage and seamless access of genomewide position-specific scores from R, facilitating their use in genome analysis workflows. Availability and implementation: GenomicScores is implemented in R and available at https://bioconductor.org/packages/GenomicScores under the open source 'Artistic-2.0' license. Supplementary information: Supplementary data are available at Bioinformatics online.
Pau Puigdevall, Robert Castelo
Bioinform.2
2016 Public data and open source tools for multi-assay genomic investigation of disease
abstract
Molecular interrogation of a biological sample through DNA sequencing, RNA and microRNA profiling, proteomics and other assays, has the potential to provide a systems level approach to predicting treatment response and disease progression, and to developing precision therapies. Large publicly funded projects have generated extensive and freely available multi-assay data resources; however, bioinformatic and statistical methods for the analysis of such experiments are still nascent. We review multi-assay genomic data resources in the areas of clinical oncology, pharmacogenomics and other perturbation experiments, population genomics and regulatory genomics and other areas, and tools for data acquisition. Finally, we review bioinformatic tools that are explicitly geared toward integrative genomic data visualization and analysis. This review provides starting points for accessing publicly available data and tools to support development of needed integrative methods.
Lavanya Kannan, Marcel Ramos, Angela Re, Nehme Hachem, Zhaleh Safikhani, Deena M. A. Gendoo, Sean R. Davis, David Gomez-Cabrero, Robert Castelo, Kasper D. Hansen, Vincent Carey, Martin Morgan, Aedín C. Culhane, Benjamin Haibe-Kains, Levi Waldron
Briefings Bioinform.9
2013 A flexible count data model to fit the wide diversity of expression profiles arising from extensively replicated RNA-seq experiments
abstract
BACKGROUND: High-throughput RNA sequencing (RNA-seq) offers unprecedented power to capture the real dynamics of gene expression. Experimental designs with extensive biological replication present a unique opportunity to exploit this feature and distinguish expression profiles with higher resolution. RNA-seq data analysis methods so far have been mostly applied to data sets with few replicates and their default settings try to provide the best performance under this constraint. These methods are based on two well-known count data distributions: the Poisson and the negative binomial. The way to properly calibrate them with large RNA-seq data sets is not trivial for the non-expert bioinformatics user. RESULTS: Here we show that expression profiles produced by extensively-replicated RNA-seq experiments lead to a rich diversity of count data distributions beyond the Poisson and the negative binomial, such as Poisson-Inverse Gaussian or Pólya-Aeppli, which can be captured by a more general family of count data distributions called the Poisson-Tweedie. The flexibility of the Poisson-Tweedie family enables a direct fitting of emerging features of large expression profiles, such as heavy-tails or zero-inflation, without the need to alter a single configuration parameter. We provide a software package for R called tweeDEseq implementing a new test for differential expression based on the Poisson-Tweedie family. Using simulations on synthetic and real RNA-seq data we show that tweeDEseq yields P-values that are equally or more accurate than competing methods under different configuration parameters. By surveying the tiny fraction of sex-specific gene expression changes in human lymphoblastoid cell lines, we also show that tweeDEseq accurately detects differentially expressed genes in a real large RNA-seq data set with improved performance and reproducibility over the previously compared methodologies. Finally, we compared the results with those obtained from microarrays in order to check for reproducibility. CONCLUSIONS: RNA-seq data with many replicates leads to a handful of count data distributions which can be accurately estimated with the statistical model illustrated in this paper. This method provides a better fit to the underlying biological variability; this may be critical when comparing groups of RNA-seq samples with markedly different count data distributions. The tweeDEseq package forms part of the Bioconductor project and it is available for download at http://www.bioconductor.org.
Mikel Esnaola, Pedro Puig, Robert Castelo, Juan R. González
BMC Bioinform.4
2013 GSVA: gene set variation analysis for microarray and RNA-Seq data
abstract
BACKGROUND: Gene set enrichment (GSE) analysis is a popular framework for condensing information from gene expression profiles into a pathway or signature summary. The strengths of this approach over single gene analysis include noise and dimension reduction, as well as greater biological interpretability. As molecular profiling experiments move beyond simple case-control studies, robust and flexible GSE methodologies are needed that can model pathway activity within highly heterogeneous data sets. RESULTS: To address this challenge, we introduce Gene Set Variation Analysis (GSVA), a GSE method that estimates variation of pathway activity over a sample population in an unsupervised manner. We demonstrate the robustness of GSVA in a comparison with current state of the art sample-wise enrichment methods. Further, we provide examples of its utility in differential pathway activity and survival analysis. Lastly, we show how GSVA works analogously with data from both microarray and RNA-seq experiments. CONCLUSIONS: GSVA provides increased power to detect subtle pathway activity changes over a sample population in comparison to corresponding methods. While GSE methods are generally regarded as end points of a bioinformatic analysis, GSVA constitutes a starting point to build pathway-centric models of biology. Moreover, GSVA contributes to the current need of GSE methods for RNA-seq data. GSVA is an open source software package for R which forms part of the Bioconductor project and can be downloaded at http://www.bioconductor.org.
Sonja Hänzelmann, Robert Castelo, Justin Guinney
BMC Bioinform.2
2012 Learning undirected graphical models from multiple datasets with the generalized non-rejection rate
Alberto Roverato, Robert Castelo
Int. J. Approx. Reason.2
2011 Learning mixed graphical models from data with p larger than n
Inma Tur, Robert Castelo
UAI2
2006 A Robust Procedure For Gaussian Graphical Model Search From Microarray Data With p Larger Than n
abstract
Learning of large-scale networks of interactions from microarray data is an important and challenging problem in bioinformatics. A widely used approach is to assume that the available data constitute a random sample from a multivariate distribution belonging to a Gaussian graphical model. As a consequence, the prime objects of inference are full-order partial correlations which are partial correlations between two variables given the remaining ones. In the context of microarray data the number of variables exceed the sample size and this precludes the application of traditional structure learning procedures because a sampling version of full-order partial correlations does not exist. In this paper we consider limited-order partial correlations, these are partial correlations computed on marginal distributions of manageable size, and provide a set of rules that allow one to assess the usefulness of these quantities to derive the independence structure of the underlying Gaussian graphical model. Furthermore, we introduce a novel structure learning procedure based on a quantity, obtained from limited-order partial correlations, that we call the non-rejection rate. The applicability and usefulness of the procedure are demonstrated by both simulated and real data.
Robert Castelo, Alberto Roverato
J. Mach. Learn. Res.1
2005 Gene finding in the chicken genome
abstract
BACKGROUND: Despite the continuous production of genome sequence for a number of organisms, reliable, comprehensive, and cost effective gene prediction remains problematic. This is particularly true for genomes for which there is not a large collection of known gene sequences, such as the recently published chicken genome. We used the chicken sequence to test comparative and homology-based gene-finding methods followed by experimental validation as an effective genome annotation method. RESULTS: We performed experimental evaluation by RT-PCR of three different computational gene finders, Ensembl, SGP2 and TWINSCAN, applied to the chicken genome. A Venn diagram was computed and each component of it was evaluated. The results showed that de novo comparative methods can identify up to about 700 chicken genes with no previous evidence of expression, and can correctly extend about 40% of homology-based predictions at the 5' end. CONCLUSIONS: De novo comparative gene prediction followed by experimental verification is effective at enhancing the annotation of the newly sequenced genomes provided by standard homology-based methods.
Eduardo Eyras, Alexandre Reymond, Robert Castelo, Jacqueline M. Bye, Francisco Camara, Paul Flicek, Elizabeth J. Huckle, Genis Parra, David D. Shteynberg, Carine Wyss, Jane Rogers, Stylianos E. Antonarakis, Ewan Birney, Roderic Guigó, Michael R. Brent
BMC Bioinform.3
2003 On Inclusion-Driven Learning of Bayesian Networks
Robert Castelo, Tomas Kocka
J. Mach. Learn. Res.1
2003 Improving Markov Chain Monte Carlo Model Search for Data Mining
Paolo Giudici, Robert Castelo
Mach. Learn.2
2001 MAMBO: Discovering Association Rules Based on Conditional Independencies
Robert Castelo, A. J. Feelders, Arno Siebes
IDA1
2001 Improved learning of Bayesian networks
Tomas Kocka, Robert Castelo
UAI2
2001 Association Models for Web Mining
Paolo Giudici, Robert Castelo
Data Min. Knowl. Discov.2
2000 Priors on network structures. Biasing the search for Bayesian networks
Robert Castelo, Arno Siebes
Int. J. Approx. Reason.1