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

Gholamali Rahnavard

dblp:23/7729 · also Ali Rahnavard · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
3since 2021 · last 2022
0000-0002-9710-0248ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 3 since 2021Systems, architecture and hardware · 1 · 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%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › statistical genetics
association testing
0.612022
High-sensitivity pattern discovery in large, paired multiomic datasets · Bioinform. 2022
Bioinformatics and computational biology
multi-omics
0.612022
High-sensitivity pattern discovery in large, paired multiomic datasets · Bioinform. 2022
Bioinformatics and computational biology › network bioinformatics › biological network analysis
community detection
0.512021
Omics community detection using multi-resolution clustering · Bioinform. 2021
Bioinformatics and computational biology
omics data analysis
0.512021
Omics community detection using multi-resolution clustering · Bioinform. 2021

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

hierarchical hypothesis testing · 0.6similarity measurement · 0.5clustering · 0.5
YearPublicationVenuePosition
2022 High-sensitivity pattern discovery in large, paired multiomic datasets
abstract
MOTIVATION: Modern biological screens yield enormous numbers of measurements, and identifying and interpreting statistically significant associations among features are essential. In experiments featuring multiple high-dimensional datasets collected from the same set of samples, it is useful to identify groups of associated features between the datasets in a way that provides high statistical power and false discovery rate (FDR) control. RESULTS: Here, we present a novel hierarchical framework, HAllA (Hierarchical All-against-All association testing), for structured association discovery between paired high-dimensional datasets. HAllA efficiently integrates hierarchical hypothesis testing with FDR correction to reveal significant linear and non-linear block-wise relationships among continuous and/or categorical data. We optimized and evaluated HAllA using heterogeneous synthetic datasets of known association structure, where HAllA outperformed all-against-all and other block-testing approaches across a range of common similarity measures. We then applied HAllA to a series of real-world multiomics datasets, revealing new associations between gene expression and host immune activity, the microbiome and host transcriptome, metabolomic profiling and human health phenotypes. AVAILABILITY AND IMPLEMENTATION: An open-source implementation of HAllA is freely available at http://huttenhower.sph.harvard.edu/halla along with documentation, demo datasets and a user group. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Andrew R. Ghazi, Kathleen Sucipto, Gholamali Rahnavard, Eric A. Franzosa, Lauren J. McIver, Jason Lloyd-Price, Emma H. Schwager, George Weingart, Yo Sup Moon, Xochitl C. Morgan, Levi Waldron, Curtis Huttenhower
Bioinform.3
2021 Omics community detection using multi-resolution clustering
abstract
MOTIVATION: The discovery of biologically interpretable and clinically actionable communities in heterogeneous omics data is a necessary first step toward deriving mechanistic insights into complex biological phenomena. Here, we present a novel clustering approach, omeClust, for community detection in omics profiles by simultaneously incorporating similarities among measurements and the overall complex structure of the data. RESULTS: We show that omeClust outperforms published methods in inferring the true community structure as measured by both sensitivity and misclassification rate on simulated datasets. We further validated omeClust in diverse, multiple omics datasets, revealing new communities and functionally related groups in microbial strains, cell line gene expression patterns and fetal genomic variation. We also derived enrichment scores attributable to putatively meaningful biological factors in these datasets that can serve as hypothesis generators facilitating new sets of testable hypotheses. AVAILABILITY AND IMPLEMENTATION: omeClust is open-source software, and the implementation is available online at http://github.com/omicsEye/omeClust. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Gholamali Rahnavard, Suvo Chatterjee, Bahar Sayoldin, Keith A. Crandall, Fasil Tekola-Ayele, Himel Mallick
Bioinform.1
2021 Multivariable association discovery in population-scale meta-omics studies
abstract
It is challenging to associate features such as human health outcomes, diet, environmental conditions, or other metadata to microbial community measurements, due in part to their quantitative properties. Microbiome multi-omics are typically noisy, sparse (zero-inflated), high-dimensional, extremely non-normal, and often in the form of count or compositional measurements. Here we introduce an optimized combination of novel and established methodology to assess multivariable association of microbial community features with complex metadata in population-scale observational studies. Our approach, MaAsLin 2 (Microbiome Multivariable Associations with Linear Models), uses generalized linear and mixed models to accommodate a wide variety of modern epidemiological studies, including cross-sectional and longitudinal designs, as well as a variety of data types (e.g., counts and relative abundances) with or without covariates and repeated measurements. To construct this method, we conducted a large-scale evaluation of a broad range of scenarios under which straightforward identification of meta-omics associations can be challenging. These simulation studies reveal that MaAsLin 2's linear model preserves statistical power in the presence of repeated measures and multiple covariates, while accounting for the nuances of meta-omics features and controlling false discovery. We also applied MaAsLin 2 to a microbial multi-omics dataset from the Integrative Human Microbiome (HMP2) project which, in addition to reproducing established results, revealed a unique, integrated landscape of inflammatory bowel diseases (IBD) across multiple time points and omics profiles.
Himel Mallick, Gholamali Rahnavard, Lauren J. McIver, Yancong Zhang, Long H. Nguyen, Timothy L. Tickle, George Weingart, Boyu Ren, Emma H. Schwager, Suvo Chatterjee, Kelsey N. Thompson, Jeremy E. Wilkinson, Ayshwarya Subramanian, Yiren Lu 0003, Levi Waldron, Joseph N. Paulson, Eric A. Franzosa, Héctor Corrada Bravo, Curtis Huttenhower
PLoS Comput. Biol.2
2011 Parallel Greedy Genetic Algorithm for Job Scheduling in Cluster Enviornments
abstract
Recently, many scientific researchers and applications work on large amounts of data or use high performance computing resources. A high performance cluster is developed to handle massively parallel processes. To manage the resources for dynamic requests with optimal usage, we have to maximize the utilization rate of clusters. In this paper we provide a parallel genetic algorithm to schedule the jobs for different classes of clusters. The greedy approach is used to create an initial population for the genetic algorithm. We applied the master/slave method in parallelism to manage the schedulers and improve the performance of the main scheduler. Analyzing the complexity of the algorithm shows that it can be more efficient than similar algorithms.
Gholamali Rahnavard, Jharrod Lafon, Hadi Sharifi
CLUSTER1