1
|
Nicolle A, Deng S, Ihme M, Kuzhagaliyeva N, Ibrahim EA, Farooq A. Mixtures Recomposition by Neural Nets: A Multidisciplinary Overview. J Chem Inf Model 2024; 64:597-620. [PMID: 38284618 DOI: 10.1021/acs.jcim.3c01633] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/30/2024]
Abstract
Artificial Neural Networks (ANNs) are transforming how we understand chemical mixtures, providing an expressive view of the chemical space and multiscale processes. Their hybridization with physical knowledge can bridge the gap between predictivity and understanding of the underlying processes. This overview explores recent progress in ANNs, particularly their potential in the 'recomposition' of chemical mixtures. Graph-based representations reveal patterns among mixture components, and deep learning models excel in capturing complexity and symmetries when compared to traditional Quantitative Structure-Property Relationship models. Key components, such as Hamiltonian networks and convolution operations, play a central role in representing multiscale mixtures. The integration of ANNs with Chemical Reaction Networks and Physics-Informed Neural Networks for inverse chemical kinetic problems is also examined. The combination of sensors with ANNs shows promise in optical and biomimetic applications. A common ground is identified in the context of statistical physics, where ANN-based methods iteratively adapt their models by blending their initial states with training data. The concept of mixture recomposition unveils a reciprocal inspiration between ANNs and reactive mixtures, highlighting learning behaviors influenced by the training environment.
Collapse
Affiliation(s)
- Andre Nicolle
- Aramco Fuel Research Center, Rueil-Malmaison 92852, France
| | - Sili Deng
- Massachusetts Institute of Technology, Cambridge 02139, Massachusetts, United States
| | - Matthias Ihme
- Stanford University, Stanford 94305, California, United States
| | | | - Emad Al Ibrahim
- King Abdullah University of Science and Technology, Thuwal 23955, Saudi Arabia
| | - Aamir Farooq
- King Abdullah University of Science and Technology, Thuwal 23955, Saudi Arabia
| |
Collapse
|
2
|
Jingjing MA. Three-input logic gate based on DNA strand displacement reaction. Sci Rep 2023; 13:15210. [PMID: 37709846 PMCID: PMC10502070 DOI: 10.1038/s41598-023-42383-9] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/26/2023] [Accepted: 09/09/2023] [Indexed: 09/16/2023] Open
Abstract
In this paper, three kinds of three-input logic gates are designed based on DNA strand displacement reaction, which are three-input OR logic gate, three-input AND logic gate, and three-input MAJORITY logic gate. The logic gates designed in this paper takes different DNA strands as input and fluorescence signals as output. The biochemical experimental results verify my designs. The results show that DNA strand displacement technology has important application value in DNA computing, especially in the construction of DNA molecular logic gates.
Collapse
Affiliation(s)
- M A Jingjing
- School of Statistics, Shanxi University of Finance and Economy, Taiyuan, 030000, China.
| |
Collapse
|
3
|
A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2022; 2022:1450756. [PMID: 36093485 PMCID: PMC9451995 DOI: 10.1155/2022/1450756] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 04/22/2022] [Revised: 07/21/2022] [Accepted: 07/22/2022] [Indexed: 11/17/2022]
Abstract
The quota traveling salesman problem (QTSP) is a variant of the traveling salesman problem (TSP), which is a classical optimization problem. In the QTSP, the salesman visits some of the n cities to meet a given sales quota Q while having minimized travel costs. In this paper, we develop a DNA algorithm based on Adleman-Lipton model to solve the quota traveling salesman problem. Its time complexity is O(n2+Q), which is a significant improvement over previous algorithms with exponential complexity. A coding scheme of element information is pointed out, and a reasonable biological algorithm is raised by using limited conditions, whose feasibility is verified by simulation experiments. The innovation of this study is to propose a polynomial time complexity algorithm to solve the QTSP. This advantage will become more obvious as the problem scale increases compared with the algorithm of exponential computational complexity. The proposed DNA algorithm also has the significant advantages of having a large storage capacity and consuming less energy during the operation. With the maturity of DNA manipulation technology, DNA computing, as one of the parallel biological computing methods, has the potential to solve more complex NP-hard problems.
Collapse
|
4
|
Paul T, Vainio S, Roning J. Detection of intra-family coronavirus genome sequences through graphical representation and artificial neural network. EXPERT SYSTEMS WITH APPLICATIONS 2022; 194:116559. [PMID: 35095217 PMCID: PMC8779865 DOI: 10.1016/j.eswa.2022.116559] [Citation(s) in RCA: 4] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 05/20/2021] [Revised: 12/29/2021] [Accepted: 01/16/2022] [Indexed: 05/06/2023]
Abstract
In this study, chaos game representation (CGR) is introduced for investigating the pattern of genome sequences. It is an image representation of the genome for the overall visualization of the sequence. The CGR representation is a mapping technique that assigns each sequence base into the respective position in the two-dimension plane to portray the DNA sequence. Importantly, CGR provides one to one mapping to nucleotides as well as sequence. A coordinate of the CGR plane can tell the corresponding base and its location in the original genome. Therefore, the whole nucleotide sequence (until the current nucleotide) can be restored from the one point of the CGR. In this study, CGR coupled with artificial neural network (ANN) is introduced as a new way to represent the genome and to classify intra-coronavirus sequences. A hierarchy clustering study is done to validate the approach and found to be more than 90% accurate while comparing the result with the phylogenetic tree of the corresponding genomes. Interestingly, the method makes the genome sequence significantly shorter (more than 99% compressed) saving the data space while preserving the genome features.
Collapse
Affiliation(s)
- Tirthankar Paul
- InfoTech Oulu, Faculty of Information Technology and Electrical Engineering, Biomimetics and Intelligent Systems Group (BISG), University of Oulu, Oulu, Finland
| | - Seppo Vainio
- Infotech Oulu and Kvantum Institute, Faculty of Biochemistry and Molecular Medicine, Disease Networks, University of Oulu, Oulu, Finland
| | - Juha Roning
- InfoTech Oulu, Faculty of Information Technology and Electrical Engineering, Biomimetics and Intelligent Systems Group (BISG), University of Oulu, Oulu, Finland
| |
Collapse
|
5
|
Sivangi KB, Dasari CM, Amilpur S, Bhukya R. NoAS-DS: Neural optimal architecture search for detection of diverse DNA signals. Neural Netw 2021; 147:63-71. [PMID: 34979461 DOI: 10.1016/j.neunet.2021.12.009] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/16/2021] [Revised: 11/22/2021] [Accepted: 12/17/2021] [Indexed: 01/05/2023]
Abstract
Neural network architectures are high-performing variable models that can solve many learning tasks. Designing architectures manually require substantial time and also prior knowledge and expertise to develop a high-accuracy model. Most of the architecture search methods are developed over the task of image classification resulting in the building of complex architectures intended for large data inputs such as images. Motivated by the applications of DNA computing in Neural Architecture Search (NAS), we propose NoAS-DS which is specifically built for the architecture search of sequence-based classification tasks. Furthermore, NoAS-DS is applied to the task of predicting binding sites. Unlike other methods that implement only Convolution layers, NoAS-DS, specifically combines Convolution and LSTM layers that helps in the process of automatic architecture building. This hybrid approach helped in achieving high accuracy results on TFBS and RBP datasets which outperformed other models in TF-DNA binding prediction tasks. The best architectures generated by the proposed model can be applied to other DNA datasets of similar nature using transfer learning technique that demonstrates its generalization capability. This greatly reduces the effort required to build new architectures for other prediction tasks.
Collapse
Affiliation(s)
| | | | - Santhosh Amilpur
- National Institute of Technology (NIT), Warangal, Telangana, 506004, India
| | - Raju Bhukya
- National Institute of Technology (NIT), Warangal, Telangana, 506004, India
| |
Collapse
|
6
|
Wu X, Wang Z, Wu T, Bao X. Solving the Family Traveling Salesperson Problem in the Adleman-Lipton model based on DNA computing. IEEE Trans Nanobioscience 2021; 21:75-85. [PMID: 34460379 DOI: 10.1109/tnb.2021.3109067] [Citation(s) in RCA: 12] [Impact Index Per Article: 4.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/05/2022]
Abstract
The Family Traveling Salesperson Problem (FTSP) is a variant of the Traveling Salesperson Problem (TSP), in which all vertices are divided into several different families, and the goal of the problem is to find a loop that concatenates a specified number of vertices with minimal loop overhead. As a Non-deterministic Polynomial Complete (NP-complete) problem, it is difficult to deal with it by the traditional computing. On the contrary, as a computer with strong parallel ability, the DNA computer has incomparable advantages over digital computers when dealing with NP problems. Based on this, a DNA algorithm is proposed to deal with FTSP based on the Adleman-Lipton model. In the algorithm, the solution of the problem can be obtained by executing several basic biological manipulations on DNA molecules with O(N2) computing complexity (N is the number of vertices in the problem without the origin). Through the simulation experiments on some benchmark instances, the results show that the parallel DNA algorithm has better performance than traditional computing. The effectiveness of the algorithm is verified by deducing the algorithm process in detail. Furthermore, the algorithm further proves that DNA computing, as one of the parallel computing methods, has the potential to solve more complex big data problems.
Collapse
|
7
|
Lee W, Yu M, Lim D, Kang T, Song Y. Programmable DNA-Based Boolean Logic Microfluidic Processing Unit. ACS NANO 2021; 15:11644-11654. [PMID: 34232017 DOI: 10.1021/acsnano.1c02153] [Citation(s) in RCA: 6] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/13/2023]
Abstract
As molecular computing materials, information-encoded deoxyribonucleic acid (DNA) strands provide a logical computing process by cascaded and parallel chain reactions. However, the reactions in DNA-based combinational logic computing are mostly achieved through a manual process by adding desired DNA molecules in a single microtube or a substrate. For DNA-based Boolean logic, using microfluidic chips can afford automated operation, programmable control, and seamless combinational logic operation, similar to electronic microprocessors. In this paper, we present a programmable DNA-based microfluidic processing unit (MPU) chip that can be controlled via a personal computer for performing DNA calculations. To fabricate this DNA-based MPU, polydimethylsiloxane was cast using double-sided molding techniques for alignment between the microfluidics and valve switch. For a uniform surface, molds fabricated using a three-dimensional printer were spin-coated by a polymer. For programming control, the valve switch arms were operated by servo motors. In the MPU controlled via a personal computer or smartphone application, the molecules with two input DNAs and a logic template DNA were reacted for the basic AND and OR operations. Furthermore, the DNA molecules reacted in a cascading manner for combinational AND and OR operations. Finally, we demonstrated a 2-to-1 multiplexer and the XOR operation with a three-step cascade reaction using the simple DNA-based MPU, which can perform Boolean logic operations (AND, OR, and NOT). Through logic combination, this DNA-based Boolean logic MPU, which can be operated using programming language, is expected to facilitate the development of complex functional circuits such as arithmetic logical units and neuromorphic circuits.
Collapse
Affiliation(s)
- Wonjin Lee
- Department of Nano-bioengineering, Incheon National University, Academy-to 119, Incheon, Korea, 22012
| | - Minsang Yu
- Department of Nano-bioengineering, Incheon National University, Academy-to 119, Incheon, Korea, 22012
| | - Doyeon Lim
- Department of Nano-bioengineering, Incheon National University, Academy-to 119, Incheon, Korea, 22012
| | - Taeseok Kang
- Department of Nano-bioengineering, Incheon National University, Academy-to 119, Incheon, Korea, 22012
| | - Youngjun Song
- Department of Nano-bioengineering, Incheon National University, Academy-to 119, Incheon, Korea, 22012
| |
Collapse
|
8
|
|