Joshua Hochuli

Joshua Hochuli

Auto-generated profile, based on publicly available information

Joshua Hochuli

UNC Chapel Hill

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
11 April 2017 in Journal of Chemical Information and Modeling
Verified
Journal Article
Closed access
MRMatthew Ragoza
Matthew Ragoza
JHJoshua Hochuli
Joshua Hochuli
EIElisa Idrobo
Elisa Idrobo
JSJocelyn Sunseri
Jocelyn Sunseri
DKDavid Koes
David Koes

3 September 2019 in Systematic Biology
Verified
Journal Article
Closed access
PDF file
ASANTON SUVOROV
ANTON SUVOROV
JHJoshua Hochuli
Joshua Hochuli
DSDaniel R Schrider
Daniel R Schrider
Reconstructing the phylogenetic relationships between species is one of the most formidable tasks in evolutionary biology. Multiple methods exist to reconstruct phylogenetic trees, each with their own strengths and weaknesses. Both simulation and empirical studies have identified several “zones” of parameter space where accuracy of some methods can plummet, even for four-taxon trees. Further, some methods can have undesirable statistical properties such as statistical inconsistency and/or the tendency to be positively misleading (i.e. assert strong support for the incorrect tree topology). Recently, deep learning techniques have made inroads on a number of both new and longstanding problems in biological research. In this study, we designed a deep convolutional neural network (CNN) to infer quartet topologies from multiple sequence alignments. This CNN can readily be trained to make inferences using both gapped and ungapped data. We show that our approach is highly accurate on simulated data, often outperforming traditional methods, and is remarkably robust to bias-inducing regions of parameter space such as the Felsenstein zone and the Farris zone. We also demonstrate that the confidence scores produced by our CNN can more accurately assess support for the chosen topology than bootstrap and posterior probability scores from traditional methods. Although numerous practical challenges remain, these findings suggest that the deep learning approaches such as ours have the potential to produce more accurate phylogenetic inferences.

1 September 2018 in Journal of Molecular Graphics and Modelling
Verified
Journal Article
Closed access
JHJoshua Hochuli
Joshua Hochuli
AHAlec Helbling
Alec Helbling
TSTamar Skaist
Tamar Skaist
MRMatthew Ragoza
Matthew Ragoza
DKDavid Koes
David Koes

16 March 2024
Verified
Book Chapter
Closed access
PDF file
KKKathryn E. Kirchoff
Kathryn E. Kirchoff
JWJames Wellnitz
James Wellnitz
JHJoshua E. Hochuli
Joshua E. Hochuli
TMTravis Maxfield
Travis Maxfield
KPKonstantin I. Popov
Konstantin I. Popov
ATAlexander Tropsha
Alexander Tropsha

12 February 2024 in arXiv
Verified
Preprint
Open access
PDF file
KKKathryn E. Kirchoff
Kathryn E. Kirchoff
JWJames Wellnitz
James Wellnitz
JHJoshua E. Hochuli
Joshua E. Hochuli
TMTravis Maxfield
Travis Maxfield
KPKonstantin I. Popov
Konstantin I. Popov
ATAlexander Tropsha
Alexander Tropsha
Nearest neighbor-based similarity searching is a common task in chemistry, with notable use cases in drug discovery. Yet, some of the most commonly used approaches for this task still leverage a brute-force approach. In practice this can be computationally costly and overly time-consuming, due in part to the sheer size of modern chemical databases. Previous computational advancements for this task have generally relied on improvements to hardware or dataset-specific tricks that lack generalizability. Approaches that leverage lower-complexity searching algorithms remain relatively underexplored. However, many of these algorithms are approximate solutions and/or struggle with typical high-dimensional chemical embeddings. Here we evaluate whether a combination of low-dimensional chemical embeddings and a k-d tree data structure can achieve fast nearest neighbor queries while maintaining performance on standard chemical similarity search benchmarks. We examine different dimensionality reductions of standard chemical embeddings as well as a learned, structurally-aware embedding -- SmallSA -- for this task. With this framework, searches on over one billion chemicals execute in less than a second on a single CPU core, five orders of magnitude faster than the brute-force approach. We also demonstrate that SmallSA achieves competitive performance on chemical similarity benchmarks.