Yu Hong

Mr. Yu Hong

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
12 July 2024 in G3: Genes, Genomes, Genetics
Verified
Journal Article
Open access
PDF file
YHYu Hong
Yu Hong
RCRebecca G Cheek
Rebecca G Cheek
SSSuhashi Nihara De Silva
Suhashi Nihara De Silva
KMKingshuk Mukherjee
Kingshuk Mukherjee
IYIsha Yooseph
Isha Yooseph
CBChristina Boucher
Christina Boucher
The genetic effective size (⁠ Ne⁠) is arguably one of the most important characteristics of a population as it impacts the rate of loss of genetic diversity. Methods that estimate Ne are important in population and conservation genetic studies as they quantify the risk of a population being inbred or lacking genetic diversity. Yet there are very few methods that can estimate the Ne from data from a single population and without extensive information about the genetics of the population, such as a linkage map, or a reference genome of the species of interest. We present ONeSAMP 3.0⁠, an algorithm for estimating Ne from single nucleotide polymorphism data collected from a single population sample using approximate Bayesian computation and local linear regression. We demonstrate the utility of this approach using simulated Wright–Fisher populations, and empirical data from five endangered Channel Island fox (Urocyon littoralis) populations to evaluate the performance of ONeSAMP 3.0 compared to a commonly used Ne estimator. Our results show that ONeSAMP 3.0 is broadly applicable to natural populations and is flexible enough that future versions could easily include summary statistics appropriate for a suite of biological and sampling conditions. ONeSAMP 3.0 is publicly available under the GNU General Public License at https://github.com/AaronHong1024/ONeSAMP_3.

1 August 2025 in Journal of Computational Biology
Verified
Journal Article
Closed access
YHYu Hong
Yu Hong
CBChristina Boucher
Christina Boucher
The growing volume of genomic data, driven by advances in sequencing technologies, demands efficient data compression solutions. Traditional algorithms, such as Lempel-Ziv77 (LZ77), have been fundamental in offering lossless compression, yet they often fall short when applied to the highly repetitive structures typical of genomic sequences. This review explores the evolution of LZ77 and its adaptations for genomic data compression, highlighting specialized algorithms designed to handle redundancy in large-scale sequencing datasets efficiently. Innovations in this field have enhanced compression ratios and processing efficiencies leveraging intrinsic redundancy within genomic datasets. We critically examine a spectrum of LZ77-based algorithms, including newer adaptations for external and semi-external memory settings, and contrast their efficacy in managing large-scale genomic data. We conducted experiments to evaluate the performance of several algorithms, including KKP2, RLE-LZ, SE-KKP, BGone, and PFP-LZ77, on both real-world datasets from the Pizza&Chili repetitive corpus, Salmonella genomes, and human chromosome 19 genomes. These results underscore the trade-offs between time and memory consumption between algorithms. This article aims to provide a comprehensive guide on the current landscape and future directions of data compression technologies, equipping bioinformaticians and other practitioners with insight to tackle the escalating data challenges in genomics and beyond.

22 August 2025 in Infection Control & Hospital Epidemiology
Verified
Journal Article
Closed access
PDF file
LOLyndsay M. O’HAra
Lyndsay M. O’HAra
MNMichelle Newman
Michelle Newman
ALAlison D. Lydecker
Alison D. Lydecker
GRGwen L. Robinson
Gwen L. Robinson
YHYu Hong
Yu Hong
MRMary-Claire Roghmann
Mary-Claire Roghmann
Objective: Assess the feasibility and effect of Enhanced Barrier Precautions (EBP) on the transmission of Staphylococcus aureus (SA) and carbapenem-resistant organisms (CRO) among residents in nursing home chronic ventilator units (NH-CVU). Design: Pre-post interventional study. Setting: Two community-based nursing homes with CVUs in Maryland. A total of 56 residents were enrolled in the baseline period and 64 residents were enrolled in the intervention period. Methods: During a 3-month baseline and intervention period, residents were swabbed monthly to estimate SA and CRO acquisition. During a 2-month training period, EBP was implemented for residents with chronic wounds, medical devices, or history of multidrug-resistant organism (MDRO) colonization. During the subsequent 3-month intervention period, healthcare personnel (HCP) wore gowns and gloves for high-contact care activities when residents were on EBP. Whole genome sequencing assessed resident-to-resident transmission. Results: At baseline, NH-CVU1 used gowns and gloves for all direct contact, while NH-CVU2 used EBP only for residents with a history of MDRO colonization. After training, the proportion of NH-CVU2 residents on EBP increased from 65% in the baseline period to 87% in the intervention period. Glove use was high (93–98%) in both NH-CVUs. Gown use increased from 39% to 77% in NH-CVU1 and from 26% to 72% in NH-CVU2. Resident-to-resident transmission of SA or CRO decreased by 25% in NH-CVU1 ( p = 0.60) and by 67% in NH-CVU2 ( p = 0.05). CRO transmission decreased by 33% in NH-CVU1 ( p = 0.54) and by 83% in NH-CVU2 ( p = 0.02). Conclusions: EBP is feasible and potentially decreases overall and CRO transmission in nursing home CVUs.

30 June 2026 in Bioinformatics
Verified
Journal Article
Closed access
YCYixin Chen
Yixin Chen
YHYunheng Han
Yunheng Han
AWAo Wang
Ao Wang
YHYu Hong
Yu Hong
ARAdam R Rivers
Adam R Rivers
CBChristina Boucher
Christina Boucher
Motivation: Multiplex PCR-based enrichment is widely used in viral genome sequencing and pathogen surveillance. However, designing large sets of primers that maximize genome coverage while minimizing primer–primer interactions remains a major computational challenge. Existing methods such as SADDLE and Olivar use heuristics to optimize a Badness score for primer dimers but lack theoretical guarantees on solution quality. Results: We introduce PRISM, a new framework that formulates multiplex primer design as a constrained submodular maximization problem. Our method defines an objective that balances genome coverage and dimer risk, and applies a local search algorithm with a constant-factor approximation guarantee. Evaluations on viral genome datasets demonstrate that PRISM consistently achieves lower Badness scores compared to PrimalScheme, Olivar, and primerJinn. These results highlight the scalability and theoretical rigor of submodular optimization in primer design. Availability: PRISM is open-source and available at https://github.com/yhhan19/PRISM-new. The experimental data, scripts, and results used in this paper are archived on Figshare at https://doi.org/10.6084/m9.figshare.32806499. Supplementary information: Supplementary information: Supplementary material, including proofs and figures, is available at Bioinformatics online and on Figshare at https://doi.org/10.6084/m9.figshare.32806499.

19 September 2024
Verified
Book Chapter
Closed access
PDF file
YHYu Hong
Yu Hong
CBChristina Boucher
Christina Boucher
Travis GagieTravis Gagie
Travis Gagie
YLYansong Li
Yansong Li
NZNorbert Zeh
Norbert Zeh

25 September 2024 in Preprints.org
Verified
Preprint
Open access
PDF file
YHYu Hong
Yu Hong
CBChristina Boucher
Christina Boucher
The burgeoning volume of genomic data, fueled by advances in sequencing technologies, demands efficient data compression solutions. Traditional algorithms like Lempel-Ziv77 (LZ77) have been foundational in offering lossless compression, yet they often fall short when applied to the highly repetitive structures typical of genomic sequences. This review delves into the evolution of LZ77 and its derivatives, exploring specialized algorithms such as prefix-free parsing, AVL grammars, and LZ-based methods tailored for genomic data. Innovations in this field have led to enhanced compression ratios and processing efficiencies by leveraging the intrinsic redundancy within genomic datasets. We critically examine a spectrum of LZ77-based algorithms, including newer adaptations for external and semi-external memory settings, and contrast their efficacy in managing large-scale genomic data. Additionally, we discuss the potential of these algorithms to facilitate the construction of data structures such as compressed suffix trees, crucial for genomic analyses. This paper aims to provide a comprehensive guide on the current landscape and future directions of data compression technologies, equipping researchers and practitioners with insights to tackle the escalating data challenges in genomics and beyond.