ASU Scholarship Showcase

Swinging arms are a key functional component of multistep catalytic transformations in many naturally occurring multi-enzyme complexes. This arm is typically a prosthetic chemical group that is covalently attached to the enzyme complex via a flexible linker, allowing the direct transfer of substrate molecules between multiple active sites within the complex. Mimicking this method of substrate channelling outside the cellular environment requires precise control over the spatial parameters of the individual components within the assembled complex. DNA nanostructures can be used to organize functional molecules with nanoscale precision and can also provide nanomechanical control. Until now, protein–DNA assemblies have been used to organize cascades of enzymatic reactions by controlling the relative distance and orientation of enzymatic components or by facilitating the interface between enzymes/cofactors and electrode surfaces. Here, we show that a DNA nanostructure can be used to create a multi-enzyme complex in which an artificial swinging arm facilitates hydride transfer between two coupled dehydrogenases. By exploiting the programmability of DNA nanostructures, key parameters including position, stoichiometry and inter-enzyme distance can be manipulated for optimal activity.

We develop a general framework to analyze the controllability of multiplex networks using multiple-relation networks and multiple-layer networks with interlayer couplings as two classes of prototypical systems. In the former, networks associated with different physical variables share the same set of nodes and in the latter, diffusion processes take place. We find that, for a multiple-relation network, a layer exists that dominantly determines the controllability of the whole network and, for a multiple-layer network, a small fraction of the interconnections can enhance the controllability remarkably. Our theory is generally applicable to other types of multiplex networks as well, leading to significant insights into the control of complex network systems with diverse structures and interacting patterns.

A structurally and compositionally well-defined and spectrally tunable artificial light-harvesting system has been constructed in which multiple organic dyes attached to a three-arm-DNA nanostructure serve as an antenna conjugated to a photosynthetic reaction center isolated from Rhodobacter sphaeroides 2.4.1. The light energy absorbed by the dye molecules is transferred to the reaction center, where charge separation takes place. The average number of DNA three-arm junctions per reaction center was tuned from 0.75 to 2.35. This DNA-templated multichromophore system serves as a modular light-harvesting antenna that is capable of being optimized for its spectral properties, energy transfer efficiency, and photostability, allowing one to adjust both the size and spectrum of the resulting structures. This may serve as a useful test bed for developing nanostructured photonic systems.

Dynamical processes occurring on the edges in complex networks are relevant to a variety of real-world situations. Despite recent advances, a framework for edge controllability is still required for complex networks of arbitrary structure and interaction strength. Generalizing a previously introduced class of processes for edge dynamics, the switchboard dynamics, and exploit- ing the exact controllability theory, we develop a universal framework in which the controllability of any node is exclusively determined by its local weighted structure. This framework enables us to identify a unique set of critical nodes for control, to derive analytic formulas and articulate efficient algorithms to determine the exact upper and lower controllability bounds, and to evaluate strongly structural controllability of any given network. Applying our framework to a large number of model and real-world networks, we find that the interaction strength plays a more significant role in edge controllability than the network structure does, due to a vast range between the bounds determined mainly by the interaction strength. Moreover, transcriptional regulatory networks and electronic circuits are much more strongly structurally controllable (SSC) than other types of real-world networks, directed networks are more SSC than undirected networks, and sparse networks are typically more SSC than dense networks.

There is an increasing awareness that health care must move from post-symptomatic treatment to presymptomatic intervention. An ideal system would allow regular inexpensive monitoring of health status using circulating antibodies to report on health fluctuations. Recently, we demonstrated that peptide microarrays can do this through antibody signatures (immunosignatures). Unfortunately, printed microarrays are not scalable. Here we demonstrate a platform based on fabricating microarrays (~10 M peptides per slide, 330,000 peptides per assay) on silicon wafers using equipment common to semiconductor manufacturing. The potential of these microarrays for comprehensive health monitoring is verified through the simultaneous detection and classification of six different infectious diseases and six different cancers. Besides diagnostics, these high-density peptide chips have numerous other applications both in health care and elsewhere.

Recent works revealed that the energy required to control a complex network depends on the number of driving signals and the energy distribution follows an algebraic scaling law. If one implements control using a small number of drivers, e.g. as determined by the structural controllability theory, there is a high probability that the energy will diverge. We develop a physical theory to explain the scaling behaviour through identification of the fundamental structural elements, the longest control chains (LCCs), that dominate the control energy. Based on the LCCs, we articulate a strategy to drastically reduce the control energy (e.g. in a large number of real-world networks). Owing to their structural nature, the LCCs may shed light on energy issues associated with control of nonlinear dynamical networks.

Given a complex geospatial network with nodes distributed in a two-dimensional region of physical space, can the locations of the nodes be determined and their connection patterns be uncovered based solely on data? We consider the realistic situation where time series/signals can be collected from a single location. A key challenge is that the signals collected are necessarily time delayed, due to the varying physical distances from the nodes to the data collection centre. To meet this challenge, we develop a compressive-sensing-based approach enabling reconstruction of the full topology of the underlying geospatial network and more importantly, accurate estimate of the time delays. A standard triangularization algorithm can then be employed to find the physical locations of the nodes in the network. We further demonstrate successful detection of a hidden node (or a hidden source or threat), from which no signal can be obtained, through accurate detection of all its neighbouring nodes. As a geospatial network has the feature that a node tends to connect with geophysically nearby nodes, the localized region that contains the hidden node can be identified.

Locating sources of diffusion and spreading from minimum data is a significant problem in network science with great applied values to the society. However, a general theoretical framework dealing with optimal source localization is lacking. Combining the controllability theory for complex networks and compressive sensing, we develop a framework with high efficiency and robustness for optimal source localization in arbitrary weighted networks with arbitrary distribution of sources. We offer a minimum output analysis to quantify the source locatability through a minimal number of messenger nodes that produce sufficient measurement for fully locating the sources. When the minimum messenger nodes are discerned, the problem of optimal source localization becomes one of sparse signal reconstruction, which can be solved using compressive sensing. Application of our framework to model and empirical networks demonstrates that sources in homogeneous and denser networks are more readily to be located. A surprising finding is that, for a connected undirected network with random link weights and weak noise, a single messenger node is sufficient for locating any number of sources. The framework deepens our understanding of the network source localization problem and offers efficient tools with broad applications.

The relationship between sequence and binding properties of an aptamer for immunoglobulin E (IgE) was investigated using custom DNA microarrays. Single, double and some triple mutations of the aptamer sequence were created to evaluate the importance of specific base composition on aptamer binding. The majority of the positions in the aptamer sequence were found to be immutable, with changes at these positions resulting in more than a 100-fold decrease in binding affinity. Improvements in binding were observed by altering the stem region of the aptamer, suggesting that it plays a significant role in binding. Results obtained for the various mutations were used to estimate the information content and the probability of finding a functional aptamer sequence by selection from a random library. For the IgE-binding aptamer, this probability is on the order of 10^-10 to 10^-9. Results obtained for the double and triple mutations also show that there are no compensatory mutations within the space defined by those mutations. Apparently, at least for this particular aptamer, the functional sequence space can be represented as a rugged landscape with sharp peaks defined by highly constrained base compositions. This makes the rational optimization of aptamer sequences using step-wise mutagenesis approaches very challenging.

Evolutionary games model a common type of interactions in a variety of complex, networked, natural systems and social systems. Given such a system, uncovering the interacting structure of the underlying network is key to understanding its collective dynamics. Based on compressive sensing, we develop an efficient approach to reconstructing complex networks under game-based interactions from small amounts of data. The method is validated by using a variety of model networks and by conducting an actual experiment to reconstruct a social network. While most existing methods in this area assume oscillator networks that generate continuous-time data, our work successfully demonstrates that the extremely challenging problem of reverse engineering of complex networks can also be addressed even when the underlying dynamical processes are governed by realistic, evolutionary-game type of interactions in discrete time.