bioRxiv Science⌕ Search

Biology subjects

Kipen, J.

Publications and source records attributed to Kipen, J..

3 recordsLinked to original sources

Protein Abundance Inference via Expectation Maximization in Fluorosequencing

1Fluorosequencing produces millions of single-peptide reads, yet a principled strategy for converting these data into quantitative protein abundances has been lacking. We introduce a probabilistic framework that adapts expectation maximization to the fluorosequencing measurement process, estimating relative protein abundances with peptide inference results delivered by previously developed peptide-classification tools. The algorithm iteratively updates protein abundances, maximising the likelihood of the observed reads by obtaining more accurate protein abundance estimations. We first assess performance on simulated five-protein mixtures that reflect realistic labelling and system errors. A simple Python implementation processes one million reads in under ten seconds on a standard work-station and lowers the mean absolute error in relative abundance by more than an order of magnitude compared with a uniform-abundance guess, demonstrating robustness in protein inference for small-scale settings. Scalability is then evaluated with simulations of the complete human proteome (20 642 proteins). Ten million reads are processed in less than four hours on a NVIDIA DGX system using one Tesla V100 GPU, confirming that the method remains tractable at proteome scale. Using error rates characteristic of current fluorosequencing, the algorithm produces marginal improvements in relative abundance accuracy. However, when error rates were artificially lowered, estimation error decreased significantly. This result suggests that improvements in fluorosequencing chemistry could directly translate into substantially more accurate quantitative proteomics with this computational framework. Together, these results establish EM-based inference as a scalable model-driven bridge between peptide-level classification and protein-level quantification in fluorosequencing, laying computational groundwork for high-throughput single-molecule proteomics. Furthermore, the proposed protein inference framework can also be used as a refinement step within other inference methods, enhancing their protein abundance estimates. 2 Author summaryProteins carry out many of the functions inside our cells, but measuring how many copies of each protein are present remains a difficult task. The protein sequencing technology called fluorosequencing observes individual protein fragments one by one, producing millions of short "snapshots" in a single experiment. While this flood of data holds great promise, it is not yet clear how to turn the snapshots into reliable counts of the original proteins. In this study we developed a mathematical procedure, based on a classic "guess-and-improve" strategy called expectation maximization, that bridges this gap. Our program takes the computers best guesses for each fragment and repeatedly refines protein abundances until they best explain all of the measurements. Using realistic computer-generated data, we show that the method is both fast and accurate: it finishes in seconds for small mixtures and in only a few hours for the entire human set of proteins, both with accessible hardware. Because our approach can work with any future improvements in fragment interpretation, it lays the essential groundwork for bringing single-molecule protein sequencing into routine biological and medical use.

bioinformatics↗

Brownian motion data augmentation: a method to push neural network performance on nanopore sensors

1Nanopores are highly sensitive sensors that have achieved commercial success in DNA/RNA sequencing, with potential applications in protein sequencing and biomarker identification. Solid-state nanopores, in particular, face challenges such as instability and low signal-to-noise ratios (SNRs), which lead scientists to adopt data-driven methods for nanopore signal analysis, although data acquisition remains restrictive. In this paper, we augment training samples by simulating virtual Brownian motion based on dynamic models in the literature. We apply this method to a publicly available dataset of a classification task containing nanopore reads of DNA with encoded barcodes. A neural network named QuipuNet was previously published for this dataset, and we demonstrate that our augmentation method produces a noticeable increase in QuipuNets accuracy. Furthermore, we introduce a novel neural network named YupanaNet, which achieves greater accuracy (95.8%) than QuipuNet (94.6%) on the same dataset. YupanaNet benefits from both the enhanced generalization provided by Brownian motion data augmentation and the incorporation of novel architectures, including skip connections and a self-attention mechanism.

bioinformatics↗

Beam search decoder for enhancing sequence decoding speed in single-molecule peptide sequencing data

Next-generation single-molecule protein sequencing technologies have the potential to accelerate biomedical research significantly. These technologies offer sensitivity and scalability for proteomic analysis. One auspicious method is fluorosequencing, which involves: cutting naturalized proteins into peptides, attaching fluorophores to specific amino acids, and observing variations in light intensity as one amino acid is removed at a time. The original peptide is classified from the sequence of light-intensity reads, and proteins can subsequently be recognized with this information. The amino acid step removal is achieved by attaching the peptides to a wall on the C-terminal and using a process called Edman Degradation to remove an amino acid from the N-Terminal. Even though a framework (Whatprot) has been proposed for the peptide classification task, processing times remain restrictive due to the massively parallel data acquisicion system. In this paper, we propose a new beam search decoder with a novel state formulation that obtains much lower processing times with slightly higher accuracies than Whatprot. Furthermore, we explore how our novel state formulation may lead to even faster decoders in the future. Author summaryProteomic analyses are often carried on with mass spectrometry, but this method cannot identify low-abundance proteins. Single-molecule protein sequencing methods can overcome this issue, and fluorosequencing is one of these technologies. Fluorosequencing has attracted interest from investors, as evidenced by the recent funding of Erisyon, a company developing this technology. This technique contains a challenging classification task: determining the original peptide sequence from light-intensity observations obtained after several Edman cycles. A classifier based on a combination of k Nearest Neighbors (kNN) with Hidden Markov Models (HMM) had been shown to have close-to-optimal accuracy with tractable complexity. We propose in this paper a new algorithm that not only improves accuracy compared to state-of-the-art methods but also reduces computation time.

bioinformatics↗