arXiv subjects

Hongyi Xin

Publications and source records attributed to Hongyi Xin.

7 recordsLinked to original sources

arXiv2026

Population-Scale Advancing Interface Modeling Reveals How Bacterial Swarms Encode Future Spatial Architecture

Motile bacteria shape microbial function by occupying space, yet how collective motion becomes population-scale architecture remains poorly resolved. Bacterial swarming is not merely surface motion, but a process by which motile populations commit to future macroscopic form. Here, in Enterobacter sp. SM3, a gut-associated swarmer linked to mucosal repair, we treat the advancing colony--environment interface as a morphodynamic state through which local motility becomes spatial order. We built SwarmEvo across thermal, hydration, and substrate-mechanical conditions and developed Morpher to resolve and propagate interface states. Counterintuitively, within the permissive assay range, condition labels only weakly separated future trajectories, whereas colony-specific interface geometry constrained later expansion, indicating that swarm fate is written into the interface rather than prescribed by condition identity. Boundary fidelity was decisive: a 0.67 percentage-point segmentation gap expanded into a 2.4--3.1 IoU-point forecasting loss. Preserving front displacement, protrusion continuity, and branch memory, Morpher predicted late-stage expansion with 95.42% mIoU, 10.61 px HD$_{95}$, and 3.93 px ASSD. These results identify the advancing interface as a state-bearing layer through which motility and environmental constraint are converted into future spatial form, enabling disease-relevant microbial organization to be read before endpoint architecture emerges.

cond-mat.soft↗

arXiv2025

PRESCRIBE: Predicting Single-Cell Responses with Bayesian Estimation

In single-cell perturbation prediction, a central task is to forecast the effects of perturbing a gene unseen in the training data. The efficacy of such predictions depends on two factors: (1) the similarity of the target gene to those covered in the training data, which informs model (epistemic) uncertainty, and (2) the quality of the corresponding training data, which reflects data (aleatoric) uncertainty. Both factors are critical for determining the reliability of a prediction, particularly as gene perturbation is an inherently stochastic biochemical process. In this paper, we propose PRESCRIBE (PREdicting Single-Cell Response wIth Bayesian Estimation), a multivariate deep evidential regression framework designed to measure both sources of uncertainty jointly. Our analysis demonstrates that PRESCRIBE effectively estimates a confidence score for each prediction, which strongly correlates with its empirical accuracy. This capability enables the filtering of untrustworthy results, and in our experiments, it achieves steady accuracy improvements of over 3% compared to comparable baselines.

cs.LG↗

arXiv2024

Simultaneously Infer Cell Pseudotime,Velocity Field and Gene Interaction from Multi-Branch scRNA-seq Data with scPN

Modeling cellular dynamics from single-cell RNA sequencing (scRNA-seq) data is critical for understanding cell development and underlying gene regulatory relationships. Many current methods rely on single-cell velocity to obtain pseudotime, which can lead to inconsistencies between pseudotime and velocity. It is challenging to simultaneously infer cell pseudotime and gene interaction networks, especially in multi-branch differentiation scenarios. We present single-cell Piecewise Network (scPN), a novel high-dimensional dynamical modeling approach that iteratively extracts temporal patterns and inter-gene relationships from scRNA-seq data. To tackle multi-branch differentiation challenges, scPN models gene regulatory dynamics using piecewise gene-gene interaction networks, offering an interpretable framework for deciphering complex gene regulation patterns over time. Results on synthetic data and multiple scRNA-seq datasets demonstrate the superior performance of scPN in reconstructing cellular dynamics and identifying key transcription factors involved in development compared to existing methods. To the best of our knowledge, scPN is the first attempt at modeling that can recover pseudotime, velocity fields, and gene interactions all at once on multi-branch datasets.

q-bio.MN↗

arXiv2020

GateKeeper: A New Hardware Architecture for Accelerating Pre-Alignment in DNA Short Read Mapping

Motivation: High throughput DNA sequencing (HTS) technologies generate an excessive number of small DNA segments -- called short reads -- that cause significant computational burden. To analyze the entire genome, each of the billions of short reads must be mapped to a reference genome based on the similarity between a read and "candidate" locations in that reference genome. The similarity measurement, called alignment, formulated as an approximate string matching problem, is the computational bottleneck because: (1) it is implemented using quadratic-time dynamic programming algorithms, and (2) the majority of candidate locations in the reference genome do not align with a given read due to high dissimilarity. Calculating the alignment of such incorrect candidate locations consumes an overwhelming majority of a modern read mapper's execution time. Therefore, it is crucial to develop a fast and effective filter that can detect incorrect candidate locations and eliminate them before invoking computationally costly alignment operations. Results: We propose GateKeeper, a new hardware accelerator that functions as a pre-alignment step that quickly filters out most incorrect candidate locations. GateKeeper is the first design to accelerate pre-alignment using Field-Programmable Gate Arrays (FPGAs), which can perform pre-alignment much faster than software. GateKeeper can be integrated with any mapper that performs sequence alignment for verification. When implemented on a single FPGA chip, GateKeeper maintains high accuracy (on average >96%) while providing up to 90-fold and 130-fold speedup over the state-of-the-art software pre-alignment techniques, Adjacency Filter and Shifted Hamming Distance (SHD), respectively. The addition of GateKeeper as a pre-alignment step can reduce the verification time of the mrFAST mapper by a factor of 10. Availability: https://github.com/BilkentCompGen/GateKeeper

q-bio.GN↗

arXiv2017

GRIM-Filter: Fast Seed Location Filtering in DNA Read Mapping Using Processing-in-Memory Technologies

Motivation: Seed location filtering is critical in DNA read mapping, a process where billions of DNA fragments (reads) sampled from a donor are mapped onto a reference genome to identify genomic variants of the donor. State-of-the-art read mappers 1) quickly generate possible mapping locations for seeds (i.e., smaller segments) within each read, 2) extract reference sequences at each of the mapping locations, and 3) check similarity between each read and its associated reference sequences with a computationally-expensive algorithm (i.e., sequence alignment) to determine the origin of the read. A seed location filter comes into play before alignment, discarding seed locations that alignment would deem a poor match. The ideal seed location filter would discard all poor match locations prior to alignment such that there is no wasted computation on unnecessary alignments. Results: We propose a novel seed location filtering algorithm, GRIM-Filter, optimized to exploit 3D-stacked memory systems that integrate computation within a logic layer stacked under memory layers, to perform processing-in-memory (PIM). GRIM-Filter quickly filters seed locations by 1) introducing a new representation of coarse-grained segments of the reference genome, and 2) using massively-parallel in-memory operations to identify read presence within each coarse-grained segment. Our evaluations show that for a sequence alignment error tolerance of 0.05, GRIM-Filter 1) reduces the false negative rate of filtering by 5.59x--6.41x, and 2) provides an end-to-end read mapper speedup of 1.81x--3.65x, compared to a state-of-the-art read mapper employing the best previous seed location filtering algorithm. Availability: The code is available online at: https://github.com/CMU-SAFARI/GRIM

q-bio.GN↗

arXiv2017

GRIM-filter: fast seed filtering in read mapping using emerging memory technologies

Motivation: Seed filtering is critical in DNA read mapping, a process where billions of DNA fragments (reads) sampled from a donor are mapped onto a reference genome to identify genomic variants of the donor. Read mappers 1) quickly generate possible mapping locations (i.e., seeds) for each read, 2) extract reference sequences at each of the mapping locations, and then 3) check similarity between each read and its associated reference sequences with a computationally expensive dynamic programming algorithm (alignment) to determine the origin of the read. Location filters come into play before alignment, discarding seed locations that alignment would have deemed a poor match. The ideal location filter would discard all poor matching locations prior to alignment such that there is no wasted computation on poor alignments. Results: We propose a novel filtering algorithm, GRIM-Filter, optimized to exploit emerging 3D-stacked memory systems that integrate computation within a stacked logic layer, enabling processing-in-memory (PIM). GRIM-Filter quickly filters locations by 1) introducing a new representation of coarse-grained segments of the reference genome and 2) using massively-parallel in-memory operations to identify read presence within each coarse-grained segment. Our evaluations show that for 5% error acceptance rates, GRIM-Filter eliminates 5.59x-6.41x more false negatives and exhibits end-to-end speedups of 1.81x-3.65x compared to mappers employing the best previous filtering algorithm.

q-bio.GN↗

arXiv2015

Optimal Seed Solver: Optimizing Seed Selection in Read Mapping

Motivation: Optimizing seed selection is an important problem in read mapping. The number of non-overlapping seeds a mapper selects determines the sensitivity of the mapper while the total frequency of all selected seeds determines the speed of the mapper. Modern seed-and-extend mappers usually select seeds with either an equal and fixed-length scheme or with an inflexible placement scheme, both of which limit the potential of the mapper to select less frequent seeds to speed up the mapping process. Therefore, it is crucial to develop a new algorithm that can adjust both the individual seed length and the seed placement, as well as derive less frequent seeds. Results: We present the Optimal Seed Solver (OSS), a dynamic programming algorithm that discovers the least frequently-occurring set of x seeds in an L-bp read in $O(x \times L)$ operations on average and in $O(x \times L^{2})$ operations in the worst case. We compared OSS against four state-of-the-art seed selection schemes and observed that OSS provides a 3-fold reduction of average seed frequency over the best previous seed selection optimizations.

cs.CE↗