Anthony A. Philippakis

dblp:98/6298 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
2since 2021 · last 2022
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 8 · 2 first-author · 2 since 2021

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
3 papers
Bioinformatics and computational biology · 56% Computational science and engineering · 44%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › statistical genetics › rare variant analysis
rare variant association testing
0.612022
STAAR workflow: a cloud-based workflow for scalable and reproducible rare variant analysis · Bioinform. 2022
Computational science and engineering › computational reproducibility
reproducible workflow
0.612022
STAAR workflow: a cloud-based workflow for scalable and reproducible rare variant analysis · Bioinform. 2022
Bioinformatics and computational biology › gene regulation
transcription factor binding
0.112009
Predicting the binding preference of transcription factors to individual DNA k-mers · Bioinform. 2009
Bioinformatics and computational biology
microarray design
0.112007
Design of Compact, Universal DNA Microarrays for Protein Binding Microarray Experiments · RECOMB 2007

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

WDL · 0.6STAAR · 0.6statistical inference · 0.1nearest neighbour · 0.1
YearPublicationVenuePosition
2022 Assessing the Robustness and Internal Consistency of the Pooled Cohort Equations
Uri Kartoun, Shaan Khurshid, BC Kwon, Aniruddh P. Patel, Akl Fahed, Puneet Batra, Anthony A. Philippakis, Steven A. Lubitz, Amit V. Khera, Patrick T. Ellinor, Vibha Anand, Kenney Ng
AMIA7
2022 STAAR workflow: a cloud-based workflow for scalable and reproducible rare variant analysis
abstract
SUMMARY: We developed the variant-Set Test for Association using Annotation infoRmation (STAAR) workflow description language (WDL) workflow to facilitate the analysis of rare variants in whole genome sequencing association studies. The open-access STAAR workflow written in the WDL allows a user to perform rare variant testing for both gene-centric and genetic region approaches, enabling genome-wide, candidate and conditional analyses. It incorporates functional annotations into the workflow as introduced in the STAAR method in order to boost the rare variant analysis power. This tool was specifically developed and optimized to be implemented on cloud-based platforms such as BioData Catalyst Powered by Terra. It provides easy-to-use functionality for rare variant analysis that can be incorporated into an exhaustive whole genome sequencing analysis pipeline. AVAILABILITY AND IMPLEMENTATION: The workflow is freely available from https://dockstore.org/workflows/github.com/sheilagaynor/STAAR_workflow. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Sheila M. Gaynor, Kenneth E. Westerman, Lea L. Ackovic, Xihao Li, Zilin Li, Alisa Manning, Anthony A. Philippakis, Xihong Lin
Bioinform.7
2020 The All of Us Research Program Researcher Workbench Phenotype Library: Five Disease Implementations
Izabelle P. Humes, Roxana Loperena-Cortes, Melissa A. Basford, Kelsey R. Mayo, Joseph DiPaolo, David J. Schlueter, Wei-Qi Wei, Robert J. Carroll, David Glazer, Paul A. Harris, Anthony A. Philippakis, Dan M. Roden, Andrea H. Ramirez
AMIA12
2020 The All of Us Research Program Researcher Workbench: Cloud based access and analytics to advance precision medicine
Andrea H. Ramirez, Kelsey R. Mayo, Robert J. Carroll, Karthik Muthuraman, Melissa A. Basford, David Glazer, Paul A. Harris, Anthony A. Philippakis, Dan M. Roden
AMIA8
2017 The All of Us Research Program Researcher Portal: Innovative access to Unprecendented Data
Andrea H. Ramirez, Anthony A. Philippakis, Gonçalo R. Abecasis, Paul A. Harris, Joshua C. Denny
AMIA2
2009 Predicting the binding preference of transcription factors to individual DNA k-mers
abstract
MOTIVATION: Recognition of specific DNA sequences is a central mechanism by which transcription factors (TFs) control gene expression. Many TF-binding preferences, however, are unknown or poorly characterized, in part due to the difficulty associated with determining their specificity experimentally, and an incomplete understanding of the mechanisms governing sequence specificity. New techniques that estimate the affinity of TFs to all possible k-mers provide a new opportunity to study DNA-protein interaction mechanisms, and may facilitate inference of binding preferences for members of a given TF family when such information is available for other family members. RESULTS: We employed a new dataset consisting of the relative preferences of mouse homeodomains for all eight-base DNA sequences in order to ask how well we can predict the binding profiles of homeodomains when only their protein sequences are given. We evaluated a panel of standard statistical inference techniques, as well as variations of the protein features considered. Nearest neighbour among functionally important residues emerged among the most effective methods. Our results underscore the complexity of TF-DNA recognition, and suggest a rational approach for future analyses of TF families.
Trevis M. Alleyne, Lourdes Peña Castillo, Gwenael Badis, Shaheynoor Talukder, Michael F. Berger, Andrew R. Gehrke, Anthony A. Philippakis, Martha L. Bulyk, Quaid Morris, Timothy R. Hughes
Bioinform.7
2007 Design of Compact, Universal DNA Microarrays for Protein Binding Microarray Experiments
Anthony A. Philippakis, Aaron M. Qureshi, Michael F. Berger, Martha L. Bulyk
RECOMB1
2006 Expression-Guided In Silico Evaluation of Candidate Cis Regulatory Codes for Drosophila Muscle Founder Cells
abstract
While combinatorial models of transcriptional regulation can be inferred for metazoan systems from a priori biological knowledge, validation requires extensive and time-consuming experimental work. Thus, there is a need for computational methods that can evaluate hypothesized cis regulatory codes before the difficult task of experimental verification is undertaken. We have developed a novel computational framework (termed "CodeFinder") that integrates transcription factor binding site and gene expression information to evaluate whether a hypothesized transcriptional regulatory model (TRM; i.e., a set of co-regulating transcription factors) is likely to target a given set of co-expressed genes. Our basic approach is to simultaneously predict cis regulatory modules (CRMs) associated with a given gene set and quantify the enrichment for combinatorial subsets of transcription factor binding site motifs comprising the hypothesized TRM within these predicted CRMs. As a model system, we have examined a TRM experimentally demonstrated to drive the expression of two genes in a sub-population of cells in the developing Drosophila mesoderm, the somatic muscle founder cells. This TRM was previously hypothesized to be a general mode of regulation for genes expressed in this cell population. In contrast, the present analyses suggest that a modified form of this cis regulatory code applies to only a subset of founder cell genes, those whose gene expression responds to specific genetic perturbations in a similar manner to the gene on which the original model was based. We have confirmed this hypothesis by experimentally discovering six (out of 12 tested) new CRMs driving expression in the embryonic mesoderm, four of which drive expression in founder cells.
Anthony A. Philippakis, Brian W. Busser, Stephen S. Gisselbrecht, Fangxue Sherry He, Beatriz Estrada, Alan M. Michelson, Martha L. Bulyk
PLoS Comput. Biol.1