Paper List
-
STAR-GO: Improving Protein Function Prediction by Learning to Hierarchically Integrate Ontology-Informed Semantic Embeddings
This paper addresses the core challenge of generalizing protein function prediction to unseen or newly introduced Gene Ontology (GO) terms by overcomi...
-
Incorporating indel channels into average-case analysis of seed-chain-extend
This paper addresses the core pain point of bridging the theoretical gap for the widely used seed-chain-extend heuristic by providing the first rigoro...
-
Competition, stability, and functionality in excitatory-inhibitory neural circuits
This paper addresses the core challenge of extending interpretable energy-based frameworks to biologically realistic asymmetric neural networks, where...
-
Enhancing Clinical Note Generation with ICD-10, Clinical Ontology Knowledge Graphs, and Chain-of-Thought Prompting Using GPT-4
This paper addresses the core challenge of generating accurate and clinically relevant patient notes from sparse inputs (ICD codes and basic demograph...
-
Learning From Limited Data and Feedback for Cell Culture Process Monitoring: A Comparative Study
This paper addresses the core challenge of developing accurate real-time bioprocess monitoring soft sensors under severe data constraints: limited his...
-
Cell-cell communication inference and analysis: biological mechanisms, computational approaches, and future opportunities
This review addresses the critical need for a systematic framework to navigate the rapidly expanding landscape of computational methods for inferring ...
-
Generating a Contact Matrix for Aged Care Settings in Australia: an agent-based model study
This study addresses the critical gap in understanding heterogeneous contact patterns within aged care facilities, where existing population-level con...
-
Emergent Spatiotemporal Dynamics in Large-Scale Brain Networks with Next Generation Neural Mass Models
This work addresses the core challenge of understanding how complex, brain-wide spatiotemporal patterns emerge from the interaction of biophysically d...
Scalable DNA Ternary Full Adder Enabled by a Competitive Blocking Circuit
Institute of Computational Science and Technology, Guangzhou University, China | School of Computer Science and Technology, Wuhan University of Science and Technology, China | School of Computer Science and Technology, Dalian University of Technology, China | School of Computing Science, Peking University, China
30秒速读
IN SHORT: This paper addresses the core bottleneck of carry information attenuation and limited computational scale in DNA binary adders by introducing a scalable ternary architecture.
核心创新
- Methodology Proposes a novel Competitive Blocking (CB) circuit that leverages differential reaction kinetics (k2 ≫ k1, k3) to dynamically select and block reaction pathways for precise carry information management.
- Methodology Introduces a ternary (base-3) adder architecture, moving beyond binary systems, which inherently reduces the frequency of carry propagation and increases single-bit information density.
- Methodology Implements a Dynamic Concentration Adjustment (CA) strategy, applying chemical equilibrium principles to optimize reactant ratios and signal transmission, enabling significant bit-width extension.
主要结论
- The CB circuit reliably performs ternary full-adder logic, with experimental validation showing successful 10-bit addition operations.
- The integrated CA strategy enables the adder to scale to 17-bit addition, representing a massive increase in computational scale.
- The architecture achieves a 'scale/strand' metric improvement of 2,405,552x compared to a recent state-of-the-art binary DNA adder capable of only 4 consecutive carries.
摘要: DNA adder circuits are programmable reaction networks that process DNA molecular inputs to compute a sum and serve as essential components for digital computation. Currently, DNA adders primarily focus on binary addition. While efforts extend the operational bit-width by minimizing the number of DNA strands and developing carry-transmission mechanisms, challenges such as the susceptibility of carrying information to attenuation and the limited expressive capacity of the binary system impose significant constraints on computational scale. This paper proposes a scalable ternary adder architecture by introducing an innovative competitive blocking (CB) circuit. The architecture employs a dual cooperative optimization strategy that significantly enhances single-bit computational capacity and incorporates a dynamic concentration adjustment (CA) to effectively broaden the computational bit-width. Consequently, a significant increase in molecular computing scale is achieved compared to previous binary adders. Biochemical experimental results indicate that the CB circuit effectively outputs the ternary full-adder bit and successfully performs 10-bit addition. Furthermore, by implementing the CA strategy, this adder can be further extended to support 17-bit addition. This research provides a novel methodological foundation for advancing DNA computing technologies and offers promising potential for scalable digital computing applications.