Ethan Jacob Moyer

Ethan Jacob Moyer

Auto-generated profile, based on publicly available information

Ethan Jacob Moyer

Center for Computational and Genomic Medicine, The Children’s Hospital of Philadelphia, PA 19104, USA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 July 2022 in Cell Genomics
Verified
Journal Article
Open access
WZWanding Zhou
Wanding Zhou
THToshinori Hinoue
Toshinori Hinoue
BBBret Barnes
Bret Barnes
OMOwen Mitchell
Owen Mitchell
WIWaleed Iqbal
Waleed Iqbal
PLPeter W. Laird
Peter W. Laird
We have developed a mouse DNA methylation array that contains 296,070 probes representing the diversity of mouse DNA methylation biology. We present a mouse methylation atlas as a rich reference resource of 1,239 DNA samples encompassing distinct tissues, strains, ages, sexes, and pathologies. We describe applications for comparative epigenomics, genomic imprinting, epigenetic inhibitors, patient-derived xenograft assessment, backcross tracing, and epigenetic clocks. We dissect DNA methylation processes associated with differentiation, aging, and tumorigenesis. Notably, we find that tissue-specific methylation signatures localize to binding sites for transcription factors controlling the corresponding tissue development. Age-associated hypermethylation is enriched at regions of Polycomb repression, while hypomethylation is enhanced at regions bound by cohesin complex members. ApcMin/+ polyp-associated hypermethylation affects enhancers regulating intestinal differentiation, while hypomethylation targets AP-1 binding sites. This Infinium Mouse Methylation BeadChip (version MM285) is widely accessible to the research community and will accelerate high-sample-throughput studies in this important model organism.

31 August 2022 in Informatics in Medicine Unlocked
Verified
Journal Article
Open access
STSatvik Tripathi
Satvik Tripathi
EMEthan Jacob Moyer
Ethan Jacob Moyer
AAAlisha Isabelle Augustin
Alisha Isabelle Augustin
AZAlex Zavalny
Alex Zavalny
SDSuhani Dheer
Suhani Dheer
EKEdward Kim
Edward Kim

24 October 2025 in Science Advances
Verified
Journal Article
Open access
DGDavid C. Goldberg
David C. Goldberg
HFHongxiang Fu
Hongxiang Fu
DADaniel Atkins
Daniel Atkins
EMEthan Moyer
Ethan Moyer
CLChin Nien Lee
Chin Nien Lee
WZWanding Zhou
Wanding Zhou
Decoding DNA methylomes for biological insights is critical in epigenetics research. We present KnowYourCG (KYCG), a data interpretation framework designed for functional DNA methylation analysis. Unlike existing tools that target genes or genomic intervals, KYCG features direct base-level screenings of diverse biological and technical influences, including sequence motifs, transcription factor binding, histone modifications, replication timing, cell-type–specific methylation, and trait associations. Through implementing efficient infrastructure that rapidly screens and investigates thousands of knowledgebases, KYCG addresses the challenges of data sparsity in various methylation datasets, including low-pass or single-cell DNA methylomes, 5-hydroxymethylation (5hmC) profiles, spatial DNA methylation maps, and array-based datasets for epigenome-wide association studies. Applying KYCG to these datasets provides valuable insights into cell differentiation, cancer origins, epigenome-trait associations, and technical issues such as array artifacts, single-cell batch effects, and Nanopore 5hmC detection accuracy. Our tool simplifies large-scale methylation analysis and integrates seamlessly with standard assay technologies.

18 July 2021
Verified
Conference Paper
Open access
YAYigit Alparslan
Yigit Alparslan
EMEthan Jacob Moyer
Ethan Jacob Moyer
IIIsamu Mclean Isozaki
Isamu Mclean Isozaki
DSDaniel Schwartz
Daniel Schwartz
ADAdam Dunlop
Adam Dunlop
EKEdward Kim
Edward Kim
In recent years, deep neural networks have had great success in machine learning and pattern recognition. Architecture size for a neural network contributes significantly to the success of neural networks. In this study, we optimize the selection process by investigating different search algorithms to find a neural network architecture size that yields the highest accuracy. We apply binary search on a very well-defined binary classification network search space and compare the results to those of linear search. We also propose how to relax some of the assumptions regarding the data set so that our solution can be generalized to any binary classification problem. We report a 100-fold running time improvement over the naive linear search when we apply the binary search method to our data sets in order to find the best architecture candidate. By finding the optimal architecture for any binary classification problem quickly, we hope that our research contributes to discovering intelligent algorithms for optimizing architecture selection in machine learning.

15 April 2022 in bioRxiv
Verified
Preprint
Open access
PDF file
STSatvik Tripathi
Satvik Tripathi
EMEthan Jacob Moyer
Ethan Jacob Moyer
AAAlisha Isabelle Augustin
Alisha Isabelle Augustin
AZAlex Zavalny
Alex Zavalny
SDSuhani Dheer
Suhani Dheer
EKEdward Kim
Edward Kim
A bstract: In this paper, we present our methodology that can be used for predicting gene mutation in patients with non-small cell lung cancer (NSCLC). There are three major types of gene mutations that a NSCLC patient’s gene structure can change to: epidermal growth factor receptor (EGFR), Kirsten rat sarcoma virus (KRAS), and Anaplastic lymphoma kinase (ALK). We worked with the clinical and genomics data for each patient as well CT scans. We preprocessed all of the data and then built a novel pipeline to integrate both the image and tabular data. We built a novel pipeline that used a fusion of Convolutional Neural Networks and Dense Neural Networks. Also, using a search approach, we pick an ensemble of deep learning models to classify the separate gene mutations. These models include EfficientNets, SENet, and ResNeXt WSL, among others. Our model achieved a high area under curve (AUC) score of 94% in detecting gene mutation.

16 January 2021 in arXiv
Verified
Preprint
Open access
PDF file
YAYigit Alparslan
Yigit Alparslan
EMEthan Jacob Moyer
Ethan Jacob Moyer
IIIsamu Mclean Isozaki
Isamu Mclean Isozaki
DSDaniel Schwartz
Daniel Schwartz
ADAdam Dunlop
Adam Dunlop
EKEdward Kim
Edward Kim
In recent years, deep neural networks have had great success in machine learning and pattern recognition. Architecture size for a neural network contributes significantly to the success of any neural network. In this study, we optimize the selection process by investigating different search algorithms to find a neural network architecture size that yields the highest accuracy. We apply binary search on a very well-defined binary classification network search space and compare the results to those of linear search. We also propose how to relax some of the assumptions regarding the dataset so that our solution can be generalized to any binary classification problem. We report a 100-fold running time improvement over the naive linear search when we apply the binary search method to our datasets in order to find the best architecture candidate. By finding the optimal architecture size for any binary classification problem quickly, we hope that our research contributes to discovering intelligent algorithms for optimizing architecture size selection in machine learning.