TL;DR
This paper introduces a novel energy-based algorithm for accurately detecting steps in noisy signals from molecular machines, improving speed and precision over existing methods.
Contribution
The paper presents a two-step energy-based algorithm combining convex denoising and graph optimization for step detection in molecular machine data, outperforming prior techniques.
Findings
EBS outperforms existing methods in speed and accuracy
Successfully detects backtracked intervals in experimental data
Effective in analyzing stepping behavior of DNA motors
Abstract
Analyzing the physical and chemical properties of single DNA based molecular machines such as polymerases and helicases often necessitates to track stepping motion on the length scale of base pairs. Although high resolution instruments have been developed that are capable of reaching that limit, individual steps are oftentimes hidden by experimental noise which complicates data processing. Here, we present an effective two-step algorithm which detects steps in a high bandwidth signal by minimizing an energy based model (Energy based step-finder, EBS). First, an efficient convex denoising scheme is applied which allows compression to tupels of amplitudes and plateau lengths. Second, a combinatorial optimization algorithm formulated on a graph is used to assign steps to the tupel data while accounting for prior information. Performance of the algorithm was tested on poissonian stepping…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
