Finding optimal interaction interface alignments between biological complexes

KAUST Repository

Cui, Xuefeng; Naveed, Hammad; Gao, Xin

2015-01-01

Motivation: Biological molecules perform their functions through interactions with other molecules. Structure alignment of interaction interfaces between biological complexes is an indispensable step in detecting their structural similarities, which

Distributed interference alignment iterative algorithms in symmetric wireless network

Directory of Open Access Journals (Sweden)

YANG Jingwen

2015-02-01

Full Text Available Interference alignment is a novel interference alignment way,which is widely noted all of the world.Interference alignment overlaps interference in the same signal space at receiving terminal by precoding so as to thoroughly eliminate the influence of interference impacted on expected signals,thus making the desire user achieve the maximum degree of freedom.In this paper we research three typical algorithms for realizing interference alignment,including minimizing the leakage interference,maximizing Signal to Interference plus Noise Ratio (SINR and minimizing mean square error(MSE.All of these algorithms utilize the reciprocity of wireless network,and iterate the precoders between original network and the reverse network so as to achieve interference alignment.We use the uplink transmit rate to analyze the performance of these three algorithms.Numerical simulation results show the advantages of these algorithms.which is the foundation for the further study in the future.The feasibility and future of interference alignment are also discussed at last.

Characterizing the topology of probabilistic biological networks.

Science.gov (United States)

Todor, Andrei; Dobra, Alin; Kahveci, Tamer

2013-01-01

Biological interactions are often uncertain events, that may or may not take place with some probability. This uncertainty leads to a massive number of alternative interaction topologies for each such network. The existing studies analyze the degree distribution of biological networks by assuming that all the given interactions take place under all circumstances. This strong and often incorrect assumption can lead to misleading results. In this paper, we address this problem and develop a sound mathematical basis to characterize networks in the presence of uncertain interactions. Using our mathematical representation, we develop a method that can accurately describe the degree distribution of such networks. We also take one more step and extend our method to accurately compute the joint-degree distributions of node pairs connected by edges. The number of possible network topologies grows exponentially with the number of uncertain interactions. However, the mathematical model we develop allows us to compute these degree distributions in polynomial time in the number of interactions. Our method works quickly even for entire protein-protein interaction (PPI) networks. It also helps us find an adequate mathematical model using MLE. We perform a comparative study of node-degree and joint-degree distributions in two types of biological networks: the classical deterministic networks and the more flexible probabilistic networks. Our results confirm that power-law and log-normal models best describe degree distributions for both probabilistic and deterministic networks. Moreover, the inverse correlation of degrees of neighboring nodes shows that, in probabilistic networks, nodes with large number of interactions prefer to interact with those with small number of interactions more frequently than expected. We also show that probabilistic networks are more robust for node-degree distribution computation than the deterministic ones. all the data sets used, the software

Value Systems Alignment Analysis in Collaborative Networked Organizations Management

OpenAIRE

Patricia Macedo; Luis Camarinha-Matos

2017-01-01

The assessment of value systems alignment can play an important role in the formation and evolution of collaborative networks, contributing to reduce potential risks of collaboration. For this purpose, an assessment tool is proposed as part of a collaborative networks information system, supporting both the formation and evolution of long-term strategic alliances and goal-oriented networks. An implementation approach for value system alignment analysis is described, which is intended to assis...

Alignment of global supply networks based on strategic groups of supply chains

Directory of Open Access Journals (Sweden)

Nikos G. Moraitakis

2017-09-01

Full Text Available Background: From a supply chain perspective, often big differences exist between global raw material suppliers’ approaches to supply their respective local markets. The progressing complexity of large centrally managed global supply networks and their often-unknown upstream ramifications increase the likelihood of undetected bottlenecks and inefficiencies. It is therefore necessary to develop an approach to strategically master the upstream complexity of such networks from a holistic supply chain perspective in order to align regional competitive priorities and supply chain structures. The objective of this research is hence to develop an approach for the supply-chain-based alignment of complex global supply networks. Method: We review existing literature from the fields of supply chain and network management, strategic sourcing, and strategic management. Based on the literature review and theoretical and practical considerations we deduce a conceptual approach to consider upstream supply chain structures in supply network alignment initiatives. Results: On the basis of these considerations and current empirical literature we transfer strategic group theory to the supply network management context. The proposed approach introduces strategic groups of supply chains as a segmentation criterion for complex global supply networks which enables the network-wide alignment of competitive priorities. Conclusion: Supply-chain-based segmentation of global supply network structures can effectively reduce the complexity, firms face when aiming to strategically align their supply chains on a holistic level. The results of this research are applicable for certain types of global supply networks and can be used for network alignment and strategy development. The approach can furthermore generate insights useable for negotiation support with suppliers.

Business-IT alignment in PSS value networks : a capability-based framework

NARCIS (Netherlands)

Bagheri, S.; Kusters, R.J.; Trienekens, J.J.M.; Camarinha-Matos, L.M.; Afsarmanesh, H.

2014-01-01

Advanced information technology (IT) is regarded as a foundation for the operation of product-service system (PSS) value networks. This requires alignment between IT and PSS business strategy. Business‐IT alignment (BIA) in a value network can raise the ability of partners to collaborate effectively

Value Systems Alignment Analysis in Collaborative Networked Organizations Management

Directory of Open Access Journals (Sweden)

Patricia Macedo

2017-11-01

Full Text Available The assessment of value systems alignment can play an important role in the formation and evolution of collaborative networks, contributing to reduce potential risks of collaboration. For this purpose, an assessment tool is proposed as part of a collaborative networks information system, supporting both the formation and evolution of long-term strategic alliances and goal-oriented networks. An implementation approach for value system alignment analysis is described, which is intended to assist managers in virtual and networked organizations management. The implementation of the assessment and analysis methods is supported by a set of software services integrated in the information system that supports the management of the networked organizations. A case study in the solar energy sector was conducted, and the data collected through this study allow us to confirm the practical applicability of the proposed methods and the software services.

Fast grid layout algorithm for biological networks with sweep calculation.

Science.gov (United States)

Kojima, Kaname; Nagasaki, Masao; Miyano, Satoru

2008-06-15

Properly drawn biological networks are of great help in the comprehension of their characteristics. The quality of the layouts for retrieved biological networks is critical for pathway databases. However, since it is unrealistic to manually draw biological networks for every retrieval, automatic drawing algorithms are essential. Grid layout algorithms handle various biological properties such as aligning vertices having the same attributes and complicated positional constraints according to their subcellular localizations; thus, they succeed in providing biologically comprehensible layouts. However, existing grid layout algorithms are not suitable for real-time drawing, which is one of requisites for applications to pathway databases, due to their high-computational cost. In addition, they do not consider edge directions and their resulting layouts lack traceability for biochemical reactions and gene regulations, which are the most important features in biological networks. We devise a new calculation method termed sweep calculation and reduce the time complexity of the current grid layout algorithms through its encoding and decoding processes. We conduct practical experiments by using 95 pathway models of various sizes from TRANSPATH and show that our new grid layout algorithm is much faster than existing grid layout algorithms. For the cost function, we introduce a new component that penalizes undesirable edge directions to avoid the lack of traceability in pathways due to the differences in direction between in-edges and out-edges of each vertex. Java implementations of our layout algorithms are available in Cell Illustrator. masao@ims.u-tokyo.ac.jp Supplementary data are available at Bioinformatics online.

Waferscale assembly of Field-Aligned nanotube Networks (FANs)

DEFF Research Database (Denmark)

Dimaki, Maria; Bøggild, Peter

2006-01-01

We demonstrate the integration of nanotube networks on 512 individual devices on a full 4-inch wafer in less than 60 seconds with a roughly 80% yield using dielectrophoresis. We present here investigations of the morphology and electrical resistance of such field aligned networks for different fr...

NN-align. An artificial neural network-based alignment algorithm for MHC class II peptide binding prediction

DEFF Research Database (Denmark)

Nielsen, Morten; Lund, Ole

2009-01-01

this binding event. RESULTS: Here, we present a novel artificial neural network-based method, NN-align that allows for simultaneous identification of the MHC class II binding core and binding affinity. NN-align is trained using a novel training algorithm that allows for correction of bias in the training data...

Dominating biological networks.

Directory of Open Access Journals (Sweden)

Tijana Milenković

Full Text Available Proteins are essential macromolecules of life that carry out most cellular processes. Since proteins aggregate to perform function, and since protein-protein interaction (PPI networks model these aggregations, one would expect to uncover new biology from PPI network topology. Hence, using PPI networks to predict protein function and role of protein pathways in disease has received attention. A debate remains open about whether network properties of "biologically central (BC" genes (i.e., their protein products, such as those involved in aging, cancer, infectious diseases, or signaling and drug-targeted pathways, exhibit some topological centrality compared to the rest of the proteins in the human PPI network.To help resolve this debate, we design new network-based approaches and apply them to get new insight into biological function and disease. We hypothesize that BC genes have a topologically central (TC role in the human PPI network. We propose two different concepts of topological centrality. We design a new centrality measure to capture complex wirings of proteins in the network that identifies as TC those proteins that reside in dense extended network neighborhoods. Also, we use the notion of domination and find dominating sets (DSs in the PPI network, i.e., sets of proteins such that every protein is either in the DS or is a neighbor of the DS. Clearly, a DS has a TC role, as it enables efficient communication between different network parts. We find statistically significant enrichment in BC genes of TC nodes and outperform the existing methods indicating that genes involved in key biological processes occupy topologically complex and dense regions of the network and correspond to its "spine" that connects all other network parts and can thus pass cellular signals efficiently throughout the network. To our knowledge, this is the first study that explores domination in the context of PPI networks.

Network biology: Describing biological systems by complex networks. Comment on "Network science of biological systems at different scales: A review" by M. Gosak et al.

Science.gov (United States)

Jalili, Mahdi

2018-03-01

I enjoyed reading Gosak et al. review on analysing biological systems from network science perspective [1]. Network science, first started within Physics community, is now a mature multidisciplinary field of science with many applications ranging from Ecology to biology, medicine, social sciences, engineering and computer science. Gosak et al. discussed how biological systems can be modelled and described by complex network theory which is an important application of network science. Although there has been considerable progress in network biology over the past two decades, this is just the beginning and network science has a great deal to offer to biology and medical sciences.

Synthetic biological networks

International Nuclear Information System (INIS)

Archer, Eric; Süel, Gürol M

2013-01-01

Despite their obvious relationship and overlap, the field of physics is blessed with many insightful laws, while such laws are sadly absent in biology. Here we aim to discuss how the rise of a more recent field known as synthetic biology may allow us to more directly test hypotheses regarding the possible design principles of natural biological networks and systems. In particular, this review focuses on synthetic gene regulatory networks engineered to perform specific functions or exhibit particular dynamic behaviors. Advances in synthetic biology may set the stage to uncover the relationship of potential biological principles to those developed in physics. (review article)

Value-Based Business-IT Alignment in Networked Constellations of Enterprises

NARCIS (Netherlands)

Gordijn, Jaap; van Eck, Pascal; Cox, K.; Dubois, E.; Pigneur, Y.; Bleistein, S.J.; Verner, J.; Davis, A.M.; Wieringa, Roelf J.

Business-ICT alignment is the problem of matching ICTservices with the requirements of the business. In businesses of any significant size, business-ICT alignment is a hard problem, which is currently not solved completely. With the advent of networked constellations of enterprises, the problem gets

Neural-network-directed alignment of optical systems using the laser-beam spatial filter as an example

Science.gov (United States)

Decker, Arthur J.; Krasowski, Michael J.; Weiland, Kenneth E.

1993-01-01

This report describes an effort at NASA Lewis Research Center to use artificial neural networks to automate the alignment and control of optical measurement systems. Specifically, it addresses the use of commercially available neural network software and hardware to direct alignments of the common laser-beam-smoothing spatial filter. The report presents a general approach for designing alignment records and combining these into training sets to teach optical alignment functions to neural networks and discusses the use of these training sets to train several types of neural networks. Neural network configurations used include the adaptive resonance network, the back-propagation-trained network, and the counter-propagation network. This work shows that neural networks can be used to produce robust sequencers. These sequencers can learn by example to execute the step-by-step procedures of optical alignment and also can learn adaptively to correct for environmentally induced misalignment. The long-range objective is to use neural networks to automate the alignment and operation of optical measurement systems in remote, harsh, or dangerous aerospace environments. This work also shows that when neural networks are trained by a human operator, training sets should be recorded, training should be executed, and testing should be done in a manner that does not depend on intellectual judgments of the human operator.

An extensive assessment of network alignment algorithms for comparison of brain connectomes.

Science.gov (United States)

Milano, Marianna; Guzzi, Pietro Hiram; Tymofieva, Olga; Xu, Duan; Hess, Christofer; Veltri, Pierangelo; Cannataro, Mario

2017-06-06

Recently the study of the complex system of connections in neural systems, i.e. the connectome, has gained a central role in neurosciences. The modeling and analysis of connectomes are therefore a growing area. Here we focus on the representation of connectomes by using graph theory formalisms. Macroscopic human brain connectomes are usually derived from neuroimages; the analyzed brains are co-registered in the image domain and brought to a common anatomical space. An atlas is then applied in order to define anatomically meaningful regions that will serve as the nodes of the network - this process is referred to as parcellation. The atlas-based parcellations present some known limitations in cases of early brain development and abnormal anatomy. Consequently, it has been recently proposed to perform atlas-free random brain parcellation into nodes and align brains in the network space instead of the anatomical image space, as a way to deal with the unknown correspondences of the parcels. Such process requires modeling of the brain using graph theory and the subsequent comparison of the structure of graphs. The latter step may be modeled as a network alignment (NA) problem. In this work, we first define the problem formally, then we test six existing state of the art of network aligners on diffusion MRI-derived brain networks. We compare the performances of algorithms by assessing six topological measures. We also evaluated the robustness of algorithms to alterations of the dataset. The results confirm that NA algorithms may be applied in cases of atlas-free parcellation for a fully network-driven comparison of connectomes. The analysis shows MAGNA++ is the best global alignment algorithm. The paper presented a new analysis methodology that uses network alignment for validating atlas-free parcellation brain connectomes. The methodology has been experimented on several brain datasets.

CUFID-query: accurate network querying through random walk based network flow estimation.

Science.gov (United States)

Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

2017-12-28

Functional modules in biological networks consist of numerous biomolecules and their complicated interactions. Recent studies have shown that biomolecules in a functional module tend to have similar interaction patterns and that such modules are often conserved across biological networks of different species. As a result, such conserved functional modules can be identified through comparative analysis of biological networks. In this work, we propose a novel network querying algorithm based on the CUFID (Comparative network analysis Using the steady-state network Flow to IDentify orthologous proteins) framework combined with an efficient seed-and-extension approach. The proposed algorithm, CUFID-query, can accurately detect conserved functional modules as small subnetworks in the target network that are expected to perform similar functions to the given query functional module. The CUFID framework was recently developed for probabilistic pairwise global comparison of biological networks, and it has been applied to pairwise global network alignment, where the framework was shown to yield accurate network alignment results. In the proposed CUFID-query algorithm, we adopt the CUFID framework and extend it for local network alignment, specifically to solve network querying problems. First, in the seed selection phase, the proposed method utilizes the CUFID framework to compare the query and the target networks and to predict the probabilistic node-to-node correspondence between the networks. Next, the algorithm selects and greedily extends the seed in the target network by iteratively adding nodes that have frequent interactions with other nodes in the seed network, in a way that the conductance of the extended network is maximally reduced. Finally, CUFID-query removes irrelevant nodes from the querying results based on the personalized PageRank vector for the induced network that includes the fully extended network and its neighboring nodes. Through extensive

Mapping biological systems to network systems

CERN Document Server

Rathore, Heena

2016-01-01

The book presents the challenges inherent in the paradigm shift of network systems from static to highly dynamic distributed systems – it proposes solutions that the symbiotic nature of biological systems can provide into altering networking systems to adapt to these changes. The author discuss how biological systems – which have the inherent capabilities of evolving, self-organizing, self-repairing and flourishing with time – are inspiring researchers to take opportunities from the biology domain and map them with the problems faced in network domain. The book revolves around the central idea of bio-inspired systems -- it begins by exploring why biology and computer network research are such a natural match. This is followed by presenting a broad overview of biologically inspired research in network systems -- it is classified by the biological field that inspired each topic and by the area of networking in which that topic lies. Each case elucidates how biological concepts have been most successfully ...

A direct method for computing extreme value (Gumbel) parameters for gapped biological sequence alignments.

Science.gov (United States)

Quinn, Terrance; Sinkala, Zachariah

2014-01-01

We develop a general method for computing extreme value distribution (Gumbel, 1958) parameters for gapped alignments. Our approach uses mixture distribution theory to obtain associated BLOSUM matrices for gapped alignments, which in turn are used for determining significance of gapped alignment scores for pairs of biological sequences. We compare our results with parameters already obtained in the literature.

Comparing biological networks via graph compression

Directory of Open Access Journals (Sweden)

Hayashida Morihiro

2010-09-01

Full Text Available Abstract Background Comparison of various kinds of biological data is one of the main problems in bioinformatics and systems biology. Data compression methods have been applied to comparison of large sequence data and protein structure data. Since it is still difficult to compare global structures of large biological networks, it is reasonable to try to apply data compression methods to comparison of biological networks. In existing compression methods, the uniqueness of compression results is not guaranteed because there is some ambiguity in selection of overlapping edges. Results This paper proposes novel efficient methods, CompressEdge and CompressVertices, for comparing large biological networks. In the proposed methods, an original network structure is compressed by iteratively contracting identical edges and sets of connected edges. Then, the similarity of two networks is measured by a compression ratio of the concatenated networks. The proposed methods are applied to comparison of metabolic networks of several organisms, H. sapiens, M. musculus, A. thaliana, D. melanogaster, C. elegans, E. coli, S. cerevisiae, and B. subtilis, and are compared with an existing method. These results suggest that our methods can efficiently measure the similarities between metabolic networks. Conclusions Our proposed algorithms, which compress node-labeled networks, are useful for measuring the similarity of large biological networks.

Impact of carbon nanotube length on electron transport in aligned carbon nanotube networks

International Nuclear Information System (INIS)

Lee, Jeonyoon; Stein, Itai Y.; Devoe, Mackenzie E.; Lewis, Diana J.; Lachman, Noa; Buschhorn, Samuel T.; Wardle, Brian L.; Kessler, Seth S.

2015-01-01

Here, we quantify the electron transport properties of aligned carbon nanotube (CNT) networks as a function of the CNT length, where the electrical conductivities may be tuned by up to 10× with anisotropies exceeding 40%. Testing at elevated temperatures demonstrates that the aligned CNT networks have a negative temperature coefficient of resistance, and application of the fluctuation induced tunneling model leads to an activation energy of ≈14 meV for electron tunneling at the CNT-CNT junctions. Since the tunneling activation energy is shown to be independent of both CNT length and orientation, the variation in electron transport is attributed to the number of CNT-CNT junctions an electron must tunnel through during its percolated path, which is proportional to the morphology of the aligned CNT network

Impact of carbon nanotube length on electron transport in aligned carbon nanotube networks

Energy Technology Data Exchange (ETDEWEB)

Lee, Jeonyoon; Stein, Itai Y. [Department of Mechanical Engineering, Massachusetts Institute of Technology, 77 Massachusetts Ave., Cambridge, Massachusetts 02139 (United States); Devoe, Mackenzie E. [Department of Materials Science and Engineering, Massachusetts Institute of Technology, 77 Massachusetts Ave., Cambridge, Massachusetts 02139 (United States); Lewis, Diana J.; Lachman, Noa; Buschhorn, Samuel T.; Wardle, Brian L., E-mail: wardle@mit.edu [Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, 77 Massachusetts Ave., Cambridge, Massachusetts 02139 (United States); Kessler, Seth S. [Metis Design Corporation, 205 Portland St., Boston, Massachusetts 02114 (United States)

2015-02-02

Here, we quantify the electron transport properties of aligned carbon nanotube (CNT) networks as a function of the CNT length, where the electrical conductivities may be tuned by up to 10× with anisotropies exceeding 40%. Testing at elevated temperatures demonstrates that the aligned CNT networks have a negative temperature coefficient of resistance, and application of the fluctuation induced tunneling model leads to an activation energy of ≈14 meV for electron tunneling at the CNT-CNT junctions. Since the tunneling activation energy is shown to be independent of both CNT length and orientation, the variation in electron transport is attributed to the number of CNT-CNT junctions an electron must tunnel through during its percolated path, which is proportional to the morphology of the aligned CNT network.

Modular analysis of biological networks.

Science.gov (United States)

Kaltenbach, Hans-Michael; Stelling, Jörg

2012-01-01

The analysis of complex biological networks has traditionally relied on decomposition into smaller, semi-autonomous units such as individual signaling pathways. With the increased scope of systems biology (models), rational approaches to modularization have become an important topic. With increasing acceptance of de facto modularity in biology, widely different definitions of what constitutes a module have sparked controversies. Here, we therefore review prominent classes of modular approaches based on formal network representations. Despite some promising research directions, several important theoretical challenges remain open on the way to formal, function-centered modular decompositions for dynamic biological networks.

A Simulated Annealing Algorithm for Maximum Common Edge Subgraph Detection in Biological Networks

DEFF Research Database (Denmark)

Larsen, Simon; Alkærsig, Frederik G.; Ditzel, Henrik

2016-01-01

Network alignment is a challenging computational problem that identifies node or edge mappings between two or more networks, with the aim to unravel common patterns among them. Pairwise network alignment is already intractable, making multiple network comparison even more difficult. Here, we intr...

Two-Stream Transformer Networks for Video-based Face Alignment.

Science.gov (United States)

Liu, Hao; Lu, Jiwen; Feng, Jianjiang; Zhou, Jie

2017-08-01

In this paper, we propose a two-stream transformer networks (TSTN) approach for video-based face alignment. Unlike conventional image-based face alignment approaches which cannot explicitly model the temporal dependency in videos and motivated by the fact that consistent movements of facial landmarks usually occur across consecutive frames, our TSTN aims to capture the complementary information of both the spatial appearance on still frames and the temporal consistency information across frames. To achieve this, we develop a two-stream architecture, which decomposes the video-based face alignment into spatial and temporal streams accordingly. Specifically, the spatial stream aims to transform the facial image to the landmark positions by preserving the holistic facial shape structure. Accordingly, the temporal stream encodes the video input as active appearance codes, where the temporal consistency information across frames is captured to help shape refinements. Experimental results on the benchmarking video-based face alignment datasets show very competitive performance of our method in comparisons to the state-of-the-arts.

Identification of important nodes in directed biological networks: a network motif approach.

Directory of Open Access Journals (Sweden)

Pei Wang

Full Text Available Identification of important nodes in complex networks has attracted an increasing attention over the last decade. Various measures have been proposed to characterize the importance of nodes in complex networks, such as the degree, betweenness and PageRank. Different measures consider different aspects of complex networks. Although there are numerous results reported on undirected complex networks, few results have been reported on directed biological networks. Based on network motifs and principal component analysis (PCA, this paper aims at introducing a new measure to characterize node importance in directed biological networks. Investigations on five real-world biological networks indicate that the proposed method can robustly identify actually important nodes in different networks, such as finding command interneurons, global regulators and non-hub but evolutionary conserved actually important nodes in biological networks. Receiver Operating Characteristic (ROC curves for the five networks indicate remarkable prediction accuracy of the proposed measure. The proposed index provides an alternative complex network metric. Potential implications of the related investigations include identifying network control and regulation targets, biological networks modeling and analysis, as well as networked medicine.

Review of Biological Network Data and Its Applications

Directory of Open Access Journals (Sweden)

Donghyeon Yu

2013-12-01

Full Text Available Studying biological networks, such as protein-protein interactions, is key to understanding complex biological activities. Various types of large-scale biological datasets have been collected and analyzed with high-throughput technologies, including DNA microarray, next-generation sequencing, and the two-hybrid screening system, for this purpose. In this review, we focus on network-based approaches that help in understanding biological systems and identifying biological functions. Accordingly, this paper covers two major topics in network biology: reconstruction of gene regulatory networks and network-based applications, including protein function prediction, disease gene prioritization, and network-based genome-wide association study.

Querying Large Biological Network Datasets

Science.gov (United States)

Gulsoy, Gunhan

2013-01-01

New experimental methods has resulted in increasing amount of genetic interaction data to be generated every day. Biological networks are used to store genetic interaction data gathered. Increasing amount of data available requires fast large scale analysis methods. Therefore, we address the problem of querying large biological network datasets.…

Causal biological network database: a comprehensive platform of causal biological network models focused on the pulmonary and vascular systems.

Science.gov (United States)

Boué, Stéphanie; Talikka, Marja; Westra, Jurjen Willem; Hayes, William; Di Fabio, Anselmo; Park, Jennifer; Schlage, Walter K; Sewer, Alain; Fields, Brett; Ansari, Sam; Martin, Florian; Veljkovic, Emilija; Kenney, Renee; Peitsch, Manuel C; Hoeng, Julia

2015-01-01

With the wealth of publications and data available, powerful and transparent computational approaches are required to represent measured data and scientific knowledge in a computable and searchable format. We developed a set of biological network models, scripted in the Biological Expression Language, that reflect causal signaling pathways across a wide range of biological processes, including cell fate, cell stress, cell proliferation, inflammation, tissue repair and angiogenesis in the pulmonary and cardiovascular context. This comprehensive collection of networks is now freely available to the scientific community in a centralized web-based repository, the Causal Biological Network database, which is composed of over 120 manually curated and well annotated biological network models and can be accessed at http://causalbionet.com. The website accesses a MongoDB, which stores all versions of the networks as JSON objects and allows users to search for genes, proteins, biological processes, small molecules and keywords in the network descriptions to retrieve biological networks of interest. The content of the networks can be visualized and browsed. Nodes and edges can be filtered and all supporting evidence for the edges can be browsed and is linked to the original articles in PubMed. Moreover, networks may be downloaded for further visualization and evaluation. Database URL: http://causalbionet.com © The Author(s) 2015. Published by Oxford University Press.

Network Analyses in Systems Biology: New Strategies for Dealing with Biological Complexity

DEFF Research Database (Denmark)

Green, Sara; Serban, Maria; Scholl, Raphael

2018-01-01

of biological networks using tools from graph theory to the application of dynamical systems theory to understand the behavior of complex biological systems. We show how network approaches support and extend traditional mechanistic strategies but also offer novel strategies for dealing with biological...... strategies? When and how can network and mechanistic approaches interact in productive ways? In this paper we address these questions by focusing on how biological networks are represented and analyzed in a diverse class of case studies. Our examples span from the investigation of organizational properties...

Biological transportation networks: Modeling and simulation

KAUST Repository

Albi, Giacomo

2015-09-15

We present a model for biological network formation originally introduced by Cai and Hu [Adaptation and optimization of biological transport networks, Phys. Rev. Lett. 111 (2013) 138701]. The modeling of fluid transportation (e.g., leaf venation and angiogenesis) and ion transportation networks (e.g., neural networks) is explained in detail and basic analytical features like the gradient flow structure of the fluid transportation network model and the impact of the model parameters on the geometry and topology of network formation are analyzed. We also present a numerical finite-element based discretization scheme and discuss sample cases of network formation simulations.

BiologicalNetworks 2.0 - an integrative view of genome biology data

Directory of Open Access Journals (Sweden)

Ponomarenko Julia

2010-12-01

Full Text Available Abstract Background A significant problem in the study of mechanisms of an organism's development is the elucidation of interrelated factors which are making an impact on the different levels of the organism, such as genes, biological molecules, cells, and cell systems. Numerous sources of heterogeneous data which exist for these subsystems are still not integrated sufficiently enough to give researchers a straightforward opportunity to analyze them together in the same frame of study. Systematic application of data integration methods is also hampered by a multitude of such factors as the orthogonal nature of the integrated data and naming problems. Results Here we report on a new version of BiologicalNetworks, a research environment for the integral visualization and analysis of heterogeneous biological data. BiologicalNetworks can be queried for properties of thousands of different types of biological entities (genes/proteins, promoters, COGs, pathways, binding sites, and other and their relations (interactions, co-expression, co-citations, and other. The system includes the build-pathways infrastructure for molecular interactions/relations and module discovery in high-throughput experiments. Also implemented in BiologicalNetworks are the Integrated Genome Viewer and Comparative Genomics Browser applications, which allow for the search and analysis of gene regulatory regions and their conservation in multiple species in conjunction with molecular pathways/networks, experimental data and functional annotations. Conclusions The new release of BiologicalNetworks together with its back-end database introduces extensive functionality for a more efficient integrated multi-level analysis of microarray, sequence, regulatory, and other data. BiologicalNetworks is freely available at http://www.biologicalnetworks.org.

Biological transportation networks: Modeling and simulation

KAUST Repository

Albi, Giacomo; Artina, Marco; Foransier, Massimo; Markowich, Peter A.

2015-01-01

We present a model for biological network formation originally introduced by Cai and Hu [Adaptation and optimization of biological transport networks, Phys. Rev. Lett. 111 (2013) 138701]. The modeling of fluid transportation (e.g., leaf venation

Communication on the structure of biological networks

Indian Academy of Sciences (India)

Introduction. Over the past few years, network science has drawn attention from a large number of ... The qualitative properties of biological networks cannot ... Here, we study the underlying undirected structure of empirical biological networks.

The Latin American Biological Dosimetry Network (LBDNet)

International Nuclear Information System (INIS)

Garcia, O.; Lamadrid, A.I.; Gonzalez, J.E.; Romero, I.; Mandina, T.; Di Giorgio, M.; Radl, A.; Taja, M.R.; Sapienza, C.E.; Deminge, M.M.; Fernandez Rearte, J.; Stuck Oliveira, M.; Valdivia, P.; Guerrero-Carbajal, C.; Arceo Maldonado, C.; Cortina Ramirez, G.E.; Espinoza, M.; Martinez-Lopez, W.; Di Tomasso, M.

2016-01-01

Biological Dosimetry is a necessary support for national radiation protection programmes and emergency response schemes. The Latin American Biological Dosimetry Network (LBDNet) was formally founded in 2007 to provide early biological dosimetry assistance in case of radiation emergencies in the Latin American Region. Here are presented the main topics considered in the foundational document of the network, which comprise: mission, partners, concept of operation, including the mechanism to request support for biological dosimetry assistance in the region, and the network capabilities. The process for network activation and the role of the coordinating laboratory during biological dosimetry emergency response is also presented. This information is preceded by historical remarks on biological dosimetry cooperation in Latin America. A summary of the main experimental and practical results already obtained by the LBDNet is also included. (authors)

Measuring the evolutionary rewiring of biological networks.

Directory of Open Access Journals (Sweden)

Chong Shou

Full Text Available We have accumulated a large amount of biological network data and expect even more to come. Soon, we anticipate being able to compare many different biological networks as we commonly do for molecular sequences. It has long been believed that many of these networks change, or "rewire", at different rates. It is therefore important to develop a framework to quantify the differences between networks in a unified fashion. We developed such a formalism based on analogy to simple models of sequence evolution, and used it to conduct a systematic study of network rewiring on all the currently available biological networks. We found that, similar to sequences, biological networks show a decreased rate of change at large time divergences, because of saturation in potential substitutions. However, different types of biological networks consistently rewire at different rates. Using comparative genomics and proteomics data, we found a consistent ordering of the rewiring rates: transcription regulatory, phosphorylation regulatory, genetic interaction, miRNA regulatory, protein interaction, and metabolic pathway network, from fast to slow. This ordering was found in all comparisons we did of matched networks between organisms. To gain further intuition on network rewiring, we compared our observed rewirings with those obtained from simulation. We also investigated how readily our formalism could be mapped to other network contexts; in particular, we showed how it could be applied to analyze changes in a range of "commonplace" networks such as family trees, co-authorships and linux-kernel function dependencies.

On the Interplay between the Evolvability and Network Robustness in an Evolutionary Biological Network: A Systems Biology Approach

Science.gov (United States)

Chen, Bor-Sen; Lin, Ying-Po

2011-01-01

In the evolutionary process, the random transmission and mutation of genes provide biological diversities for natural selection. In order to preserve functional phenotypes between generations, gene networks need to evolve robustly under the influence of random perturbations. Therefore, the robustness of the phenotype, in the evolutionary process, exerts a selection force on gene networks to keep network functions. However, gene networks need to adjust, by variations in genetic content, to generate phenotypes for new challenges in the network’s evolution, ie, the evolvability. Hence, there should be some interplay between the evolvability and network robustness in evolutionary gene networks. In this study, the interplay between the evolvability and network robustness of a gene network and a biochemical network is discussed from a nonlinear stochastic system point of view. It was found that if the genetic robustness plus environmental robustness is less than the network robustness, the phenotype of the biological network is robust in evolution. The tradeoff between the genetic robustness and environmental robustness in evolution is discussed from the stochastic stability robustness and sensitivity of the nonlinear stochastic biological network, which may be relevant to the statistical tradeoff between bias and variance, the so-called bias/variance dilemma. Further, the tradeoff could be considered as an antagonistic pleiotropic action of a gene network and discussed from the systems biology perspective. PMID:22084563

SYNCHRONIZATION OF HETEROGENEOUS OSCILLATORS UNDER NETWORK MODIFICATIONS: PERTURBATION AND OPTIMIZATION OF THE SYNCHRONY ALIGNMENT FUNCTION

Science.gov (United States)

Taylor, Dane; Skardal, Per Sebastian; Sun, Jie

2016-01-01

Synchronization is central to many complex systems in engineering physics (e.g., the power-grid, Josephson junction circuits, and electro-chemical oscillators) and biology (e.g., neuronal, circadian, and cardiac rhythms). Despite these widespread applications—for which proper functionality depends sensitively on the extent of synchronization—there remains a lack of understanding for how systems can best evolve and adapt to enhance or inhibit synchronization. We study how network modifications affect the synchronization properties of network-coupled dynamical systems that have heterogeneous node dynamics (e.g., phase oscillators with non-identical frequencies), which is often the case for real-world systems. Our approach relies on a synchrony alignment function (SAF) that quantifies the interplay between heterogeneity of the network and of the oscillators and provides an objective measure for a system’s ability to synchronize. We conduct a spectral perturbation analysis of the SAF for structural network modifications including the addition and removal of edges, which subsequently ranks the edges according to their importance to synchronization. Based on this analysis, we develop gradient-descent algorithms to efficiently solve optimization problems that aim to maximize phase synchronization via network modifications. We support these and other results with numerical experiments. PMID:27872501

High-speed all-optical DNA local sequence alignment based on a three-dimensional artificial neural network.

Science.gov (United States)

Maleki, Ehsan; Babashah, Hossein; Koohi, Somayyeh; Kavehvash, Zahra

2017-07-01

This paper presents an optical processing approach for exploring a large number of genome sequences. Specifically, we propose an optical correlator for global alignment and an extended moiré matching technique for local analysis of spatially coded DNA, whose output is fed to a novel three-dimensional artificial neural network for local DNA alignment. All-optical implementation of the proposed 3D artificial neural network is developed and its accuracy is verified in Zemax. Thanks to its parallel processing capability, the proposed structure performs local alignment of 4 million sequences of 150 base pairs in a few seconds, which is much faster than its electrical counterparts, such as the basic local alignment search tool.

Mining biological networks from full-text articles.

Science.gov (United States)

Czarnecki, Jan; Shepherd, Adrian J

2014-01-01

The study of biological networks is playing an increasingly important role in the life sciences. Many different kinds of biological system can be modelled as networks; perhaps the most important examples are protein-protein interaction (PPI) networks, metabolic pathways, gene regulatory networks, and signalling networks. Although much useful information is easily accessible in publicly databases, a lot of extra relevant data lies scattered in numerous published papers. Hence there is a pressing need for automated text-mining methods capable of extracting such information from full-text articles. Here we present practical guidelines for constructing a text-mining pipeline from existing code and software components capable of extracting PPI networks from full-text articles. This approach can be adapted to tackle other types of biological network.

OWL Reasoning Framework over Big Biological Knowledge Network

Science.gov (United States)

Chen, Huajun; Chen, Xi; Gu, Peiqin; Wu, Zhaohui; Yu, Tong

2014-01-01

Recently, huge amounts of data are generated in the domain of biology. Embedded with domain knowledge from different disciplines, the isolated biological resources are implicitly connected. Thus it has shaped a big network of versatile biological knowledge. Faced with such massive, disparate, and interlinked biological data, providing an efficient way to model, integrate, and analyze the big biological network becomes a challenge. In this paper, we present a general OWL (web ontology language) reasoning framework to study the implicit relationships among biological entities. A comprehensive biological ontology across traditional Chinese medicine (TCM) and western medicine (WM) is used to create a conceptual model for the biological network. Then corresponding biological data is integrated into a biological knowledge network as the data model. Based on the conceptual model and data model, a scalable OWL reasoning method is utilized to infer the potential associations between biological entities from the biological network. In our experiment, we focus on the association discovery between TCM and WM. The derived associations are quite useful for biologists to promote the development of novel drugs and TCM modernization. The experimental results show that the system achieves high efficiency, accuracy, scalability, and effectivity. PMID:24877076

Parallel algorithms for large-scale biological sequence alignment on Xeon-Phi based clusters.

Science.gov (United States)

Lan, Haidong; Chan, Yuandong; Xu, Kai; Schmidt, Bertil; Peng, Shaoliang; Liu, Weiguo

2016-07-19

Computing alignments between two or more sequences are common operations frequently performed in computational molecular biology. The continuing growth of biological sequence databases establishes the need for their efficient parallel implementation on modern accelerators. This paper presents new approaches to high performance biological sequence database scanning with the Smith-Waterman algorithm and the first stage of progressive multiple sequence alignment based on the ClustalW heuristic on a Xeon Phi-based compute cluster. Our approach uses a three-level parallelization scheme to take full advantage of the compute power available on this type of architecture; i.e. cluster-level data parallelism, thread-level coarse-grained parallelism, and vector-level fine-grained parallelism. Furthermore, we re-organize the sequence datasets and use Xeon Phi shuffle operations to improve I/O efficiency. Evaluations show that our method achieves a peak overall performance up to 220 GCUPS for scanning real protein sequence databanks on a single node consisting of two Intel E5-2620 CPUs and two Intel Xeon Phi 7110P cards. It also exhibits good scalability in terms of sequence length and size, and number of compute nodes for both database scanning and multiple sequence alignment. Furthermore, the achieved performance is highly competitive in comparison to optimized Xeon Phi and GPU implementations. Our implementation is available at https://github.com/turbo0628/LSDBS-mpi .

Exploring biological network structure with clustered random networks

Directory of Open Access Journals (Sweden)

Bansal Shweta

2009-12-01

Full Text Available Abstract Background Complex biological systems are often modeled as networks of interacting units. Networks of biochemical interactions among proteins, epidemiological contacts among hosts, and trophic interactions in ecosystems, to name a few, have provided useful insights into the dynamical processes that shape and traverse these systems. The degrees of nodes (numbers of interactions and the extent of clustering (the tendency for a set of three nodes to be interconnected are two of many well-studied network properties that can fundamentally shape a system. Disentangling the interdependent effects of the various network properties, however, can be difficult. Simple network models can help us quantify the structure of empirical networked systems and understand the impact of various topological properties on dynamics. Results Here we develop and implement a new Markov chain simulation algorithm to generate simple, connected random graphs that have a specified degree sequence and level of clustering, but are random in all other respects. The implementation of the algorithm (ClustRNet: Clustered Random Networks provides the generation of random graphs optimized according to a local or global, and relative or absolute measure of clustering. We compare our algorithm to other similar methods and show that ours more successfully produces desired network characteristics. Finding appropriate null models is crucial in bioinformatics research, and is often difficult, particularly for biological networks. As we demonstrate, the networks generated by ClustRNet can serve as random controls when investigating the impacts of complex network features beyond the byproduct of degree and clustering in empirical networks. Conclusion ClustRNet generates ensembles of graphs of specified edge structure and clustering. These graphs allow for systematic study of the impacts of connectivity and redundancies on network function and dynamics. This process is a key step in

Injectable Anisotropic Nanocomposite Hydrogels Direct in Situ Growth and Alignment of Myotubes

International Nuclear Information System (INIS)

De France, Kevin J.; Yager, Kevin G.; Chan, Katelyn J. W.; Corbett, Brandon; Cranston, Emily D.; Hoare, Todd

2017-01-01

Here, while injectable in situ cross-linking hydrogels have attracted increasing attention as minimally invasive tissue scaffolds and controlled delivery systems, their inherently disorganized and isotropic network structure limits their utility in engineering oriented biological tissues. Traditional methods to prepare anisotropic hydrogels are not easily translatable to injectable systems given the need for external equipment to direct anisotropic gel fabrication and/or the required use of temperatures or solvents incompatible with biological systems. Herein, we report a new class of injectable nanocomposite hydrogels based on hydrazone cross-linked poly(oligoethylene glycol methacrylate) and magnetically aligned cellulose nanocrystals (CNCs) capable of encapsulating skeletal muscle myoblasts and promoting their differentiation into highly oriented myotubes in situ. CNC alignment occurs on the same time scale as network gelation and remains fixed after the removal of the magnetic field, enabling concurrent CNC orientation and hydrogel injection. The aligned hydrogels show mechanical and swelling profiles that can be rationally modulated by the degree of CNC alignment and can direct myotube alignment both in two- and three-dimensions following coinjection of the myoblasts with the gel precursor components. As such, these hydrogels represent a critical advancement in anisotropic biomimetic scaffolds that can be generated noninvasively in vivo following simple injection.

Hierarchical thinking in network biology: the unbiased modularization of biochemical networks.

Science.gov (United States)

Papin, Jason A; Reed, Jennifer L; Palsson, Bernhard O

2004-12-01

As reconstructed biochemical reaction networks continue to grow in size and scope, there is a growing need to describe the functional modules within them. Such modules facilitate the study of biological processes by deconstructing complex biological networks into conceptually simple entities. The definition of network modules is often based on intuitive reasoning. As an alternative, methods are being developed for defining biochemical network modules in an unbiased fashion. These unbiased network modules are mathematically derived from the structure of the whole network under consideration.

Network Reconstruction of Dynamic Biological Systems

OpenAIRE

Asadi, Behrang

2013-01-01

Inference of network topology from experimental data is a central endeavor in biology, since knowledge of the underlying signaling mechanisms a requirement for understanding biological phenomena. As one of the most important tools in bioinformatics area, development of methods to reconstruct biological networks has attracted remarkable attention in the current decade. Integration of different data types can lead to remarkable improvements in our ability to identify the connectivity of differe...

BioNSi: A Discrete Biological Network Simulator Tool.

Science.gov (United States)

Rubinstein, Amir; Bracha, Noga; Rudner, Liat; Zucker, Noga; Sloin, Hadas E; Chor, Benny

2016-08-05

Modeling and simulation of biological networks is an effective and widely used research methodology. The Biological Network Simulator (BioNSi) is a tool for modeling biological networks and simulating their discrete-time dynamics, implemented as a Cytoscape App. BioNSi includes a visual representation of the network that enables researchers to construct, set the parameters, and observe network behavior under various conditions. To construct a network instance in BioNSi, only partial, qualitative biological data suffices. The tool is aimed for use by experimental biologists and requires no prior computational or mathematical expertise. BioNSi is freely available at http://bionsi.wix.com/bionsi , where a complete user guide and a step-by-step manual can also be found.

The Latin American Biological Dosimetry Network (LBDNet).

Science.gov (United States)

García, O; Di Giorgio, M; Radl, A; Taja, M R; Sapienza, C E; Deminge, M M; Fernández Rearte, J; Stuck Oliveira, M; Valdivia, P; Lamadrid, A I; González, J E; Romero, I; Mandina, T; Guerrero-Carbajal, C; ArceoMaldonado, C; Cortina Ramírez, G E; Espinoza, M; Martínez-López, W; Di Tomasso, M

2016-09-01

Biological Dosimetry is a necessary support for national radiation protection programmes and emergency response schemes. The Latin American Biological Dosimetry Network (LBDNet) was formally founded in 2007 to provide early biological dosimetry assistance in case of radiation emergencies in the Latin American Region. Here are presented the main topics considered in the foundational document of the network, which comprise: mission, partners, concept of operation, including the mechanism to request support for biological dosimetry assistance in the region, and the network capabilities. The process for network activation and the role of the coordinating laboratory during biological dosimetry emergency response is also presented. This information is preceded by historical remarks on biological dosimetry cooperation in Latin America. A summary of the main experimental and practical results already obtained by the LBDNet is also included. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

A generic algorithm for layout of biological networks.

Science.gov (United States)

Schreiber, Falk; Dwyer, Tim; Marriott, Kim; Wybrow, Michael

2009-11-12

Biological networks are widely used to represent processes in biological systems and to capture interactions and dependencies between biological entities. Their size and complexity is steadily increasing due to the ongoing growth of knowledge in the life sciences. To aid understanding of biological networks several algorithms for laying out and graphically representing networks and network analysis results have been developed. However, current algorithms are specialized to particular layout styles and therefore different algorithms are required for each kind of network and/or style of layout. This increases implementation effort and means that new algorithms must be developed for new layout styles. Furthermore, additional effort is necessary to compose different layout conventions in the same diagram. Also the user cannot usually customize the placement of nodes to tailor the layout to their particular need or task and there is little support for interactive network exploration. We present a novel algorithm to visualize different biological networks and network analysis results in meaningful ways depending on network types and analysis outcome. Our method is based on constrained graph layout and we demonstrate how it can handle the drawing conventions used in biological networks. The presented algorithm offers the ability to produce many of the fundamental popular drawing styles while allowing the exibility of constraints to further tailor these layouts.

An efficient grid layout algorithm for biological networks utilizing various biological attributes

Directory of Open Access Journals (Sweden)

Kato Mitsuru

2007-03-01

Full Text Available Abstract Background Clearly visualized biopathways provide a great help in understanding biological systems. However, manual drawing of large-scale biopathways is time consuming. We proposed a grid layout algorithm that can handle gene-regulatory networks and signal transduction pathways by considering edge-edge crossing, node-edge crossing, distance measure between nodes, and subcellular localization information from Gene Ontology. Consequently, the layout algorithm succeeded in drastically reducing these crossings in the apoptosis model. However, for larger-scale networks, we encountered three problems: (i the initial layout is often very far from any local optimum because nodes are initially placed at random, (ii from a biological viewpoint, human layouts still exceed automatic layouts in understanding because except subcellular localization, it does not fully utilize biological information of pathways, and (iii it employs a local search strategy in which the neighborhood is obtained by moving one node at each step, and automatic layouts suggest that simultaneous movements of multiple nodes are necessary for better layouts, while such extension may face worsening the time complexity. Results We propose a new grid layout algorithm. To address problem (i, we devised a new force-directed algorithm whose output is suitable as the initial layout. For (ii, we considered that an appropriate alignment of nodes having the same biological attribute is one of the most important factors of the comprehension, and we defined a new score function that gives an advantage to such configurations. For solving problem (iii, we developed a search strategy that considers swapping nodes as well as moving a node, while keeping the order of the time complexity. Though a naïve implementation increases by one order, the time complexity, we solved this difficulty by devising a method that caches differences between scores of a layout and its possible updates

Multi-subject Manifold Alignment of Functional Network Structures via Joint Diagonalization.

Science.gov (United States)

Nenning, Karl-Heinz; Kollndorfer, Kathrin; Schöpf, Veronika; Prayer, Daniela; Langs, Georg

2015-01-01

Functional magnetic resonance imaging group studies rely on the ability to establish correspondence across individuals. This enables location specific comparison of functional brain characteristics. Registration is often based on morphology and does not take variability of functional localization into account. This can lead to a loss of specificity, or confounds when studying diseases. In this paper we propose multi-subject functional registration by manifold alignment via coupled joint diagonalization. The functional network structure of each subject is encoded in a diffusion map, where functional relationships are decoupled from spatial position. Two-step manifold alignment estimates initial correspondences between functionally equivalent regions. Then, coupled joint diagonalization establishes common eigenbases across all individuals, and refines the functional correspondences. We evaluate our approach on fMRI data acquired during a language paradigm. Experiments demonstrate the benefits in matching accuracy achieved by coupled joint diagonalization compared to previously proposed functional alignment approaches, or alignment based on structural correspondences.

Knowledge-fused differential dependency network models for detecting significant rewiring in biological networks.

Science.gov (United States)

Tian, Ye; Zhang, Bai; Hoffman, Eric P; Clarke, Robert; Zhang, Zhen; Shih, Ie-Ming; Xuan, Jianhua; Herrington, David M; Wang, Yue

2014-07-24

Modeling biological networks serves as both a major goal and an effective tool of systems biology in studying mechanisms that orchestrate the activities of gene products in cells. Biological networks are context-specific and dynamic in nature. To systematically characterize the selectively activated regulatory components and mechanisms, modeling tools must be able to effectively distinguish significant rewiring from random background fluctuations. While differential networks cannot be constructed by existing knowledge alone, novel incorporation of prior knowledge into data-driven approaches can improve the robustness and biological relevance of network inference. However, the major unresolved roadblocks include: big solution space but a small sample size; highly complex networks; imperfect prior knowledge; missing significance assessment; and heuristic structural parameter learning. To address these challenges, we formulated the inference of differential dependency networks that incorporate both conditional data and prior knowledge as a convex optimization problem, and developed an efficient learning algorithm to jointly infer the conserved biological network and the significant rewiring across different conditions. We used a novel sampling scheme to estimate the expected error rate due to "random" knowledge. Based on that scheme, we developed a strategy that fully exploits the benefit of this data-knowledge integrated approach. We demonstrated and validated the principle and performance of our method using synthetic datasets. We then applied our method to yeast cell line and breast cancer microarray data and obtained biologically plausible results. The open-source R software package and the experimental data are freely available at http://www.cbil.ece.vt.edu/software.htm. Experiments on both synthetic and real data demonstrate the effectiveness of the knowledge-fused differential dependency network in revealing the statistically significant rewiring in biological

Proposal for an alignment method of the CLIC linear accelerator - From geodesic networks to the active pre-alignment

International Nuclear Information System (INIS)

Touze, T.

2011-01-01

The compact linear collider (CLIC) is the particle accelerator project proposed by the european organization for nuclear research (CERN) for high energy physics after the large hadron collider (LHC). Because of the nano-metric scale of the CLIC leptons beams, the emittance growth budget is very tight. It induces alignment tolerances on the positions of the CLIC components that have never been achieved before. The last step of the CLIC alignment will be done according to the beam itself. It falls within the competence of the physicists. However, in order to implement the beam-based feedback, a challenging pre-alignment is required: 10 μm at 3σ along a 200 m sliding window. For such a precision, the proposed solution must be compatible with a feedback between the measurement and repositioning systems. The CLIC pre-alignment will have to be active. This thesis does not demonstrate the feasibility of the CLIC active pre-alignment but shows the way to the last developments that have to be done for that purpose. A method is proposed. Based on the management of the Helmert transformations between Euclidean coordinate systems, from the geodetic networks to the metrological measurements, this method is likely to solve the CLIC pre-alignment problem. Large scale facilities have been built and Monte-Carlo simulations have been made in order to validate the mathematical modeling of the measurement systems and of the alignment references. When this is done, it will be possible to extrapolate the modeling to the entire CLIC length. It will be the last step towards the demonstration of the CLIC pre-alignment feasibility. (author)

Reconstruction of biological networks based on life science data integration.

Science.gov (United States)

Kormeier, Benjamin; Hippe, Klaus; Arrigo, Patrizio; Töpel, Thoralf; Janowski, Sebastian; Hofestädt, Ralf

2010-10-27

For the implementation of the virtual cell, the fundamental question is how to model and simulate complex biological networks. Therefore, based on relevant molecular database and information systems, biological data integration is an essential step in constructing biological networks. In this paper, we will motivate the applications BioDWH--an integration toolkit for building life science data warehouses, CardioVINEdb--a information system for biological data in cardiovascular-disease and VANESA--a network editor for modeling and simulation of biological networks. Based on this integration process, the system supports the generation of biological network models. A case study of a cardiovascular-disease related gene-regulated biological network is also presented.

Controllability and observability of Boolean networks arising from biology

Science.gov (United States)

Li, Rui; Yang, Meng; Chu, Tianguang

2015-02-01

Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.

Networks in Cell Biology

Science.gov (United States)

Buchanan, Mark; Caldarelli, Guido; De Los Rios, Paolo; Rao, Francesco; Vendruscolo, Michele

2010-05-01

Introduction; 1. Network views of the cell Paolo De Los Rios and Michele Vendruscolo; 2. Transcriptional regulatory networks Sarath Chandra Janga and M. Madan Babu; 3. Transcription factors and gene regulatory networks Matteo Brilli, Elissa Calistri and Pietro Lió; 4. Experimental methods for protein interaction identification Peter Uetz, Björn Titz, Seesandra V. Rajagopala and Gerard Cagney; 5. Modeling protein interaction networks Francesco Rao; 6. Dynamics and evolution of metabolic networks Daniel Segré; 7. Hierarchical modularity in biological networks: the case of metabolic networks Erzsébet Ravasz Regan; 8. Signalling networks Gian Paolo Rossini; Appendix 1. Complex networks: from local to global properties D. Garlaschelli and G. Caldarelli; Appendix 2. Modelling the local structure of networks D. Garlaschelli and G. Caldarelli; Appendix 3. Higher-order topological properties S. Ahnert, T. Fink and G. Caldarelli; Appendix 4. Elementary mathematical concepts A. Gabrielli and G. Caldarelli; References.

Reconstruction of biological networks based on life science data integration

Directory of Open Access Journals (Sweden)

Kormeier Benjamin

2010-06-01

Full Text Available For the implementation of the virtual cell, the fundamental question is how to model and simulate complex biological networks. Therefore, based on relevant molecular database and information systems, biological data integration is an essential step in constructing biological networks. In this paper, we will motivate the applications BioDWH - an integration toolkit for building life science data warehouses, CardioVINEdb - a information system for biological data in cardiovascular-disease and VANESA- a network editor for modeling and simulation of biological networks. Based on this integration process, the system supports the generation of biological network models. A case study of a cardiovascular-disease related gene-regulated biological network is also presented.

Power Laws, Scale-Free Networks and Genome Biology

CERN Document Server

Koonin, Eugene V; Karev, Georgy P

2006-01-01

Power Laws, Scale-free Networks and Genome Biology deals with crucial aspects of the theoretical foundations of systems biology, namely power law distributions and scale-free networks which have emerged as the hallmarks of biological organization in the post-genomic era. The chapters in the book not only describe the interesting mathematical properties of biological networks but moves beyond phenomenology, toward models of evolution capable of explaining the emergence of these features. The collection of chapters, contributed by both physicists and biologists, strives to address the problems in this field in a rigorous but not excessively mathematical manner and to represent different viewpoints, which is crucial in this emerging discipline. Each chapter includes, in addition to technical descriptions of properties of biological networks and evolutionary models, a more general and accessible introduction to the respective problems. Most chapters emphasize the potential of theoretical systems biology for disco...

Design principles in biological networks

Science.gov (United States)

Goyal, Sidhartha

Much of biology emerges from networks of interactions. Even in a single bacterium such as Escherichia coli, there are hundreds of coexisting gene and protein networks. Although biological networks are the outcome of evolution, various physical and biological constraints limit their functional capacity. The focus of this thesis is to understand how functional constraints such as optimal growth in mircoorganisms and information flow in signaling pathways shape the metabolic network of bacterium E. coli and the quorum sensing network of marine bacterium Vibrio harveyi, respectively. Metabolic networks convert basic elemental sources into complex building-blocks eventually leading to cell's growth. Therefore, typically, metabolic pathways are often coupled both by the use of a common substrate and by stoichiometric utilization of their products for cell growth. We showed that such a coupled network with product-feedback inhibition may exhibit limit-cycle oscillations which arise via a Hopf bifurcation. Furthermore, we analyzed several representative metabolic modules and find that, in all cases, simple product-feedback inhibition allows nearly optimal growth, in agreement with the predicted growth-rate by the flux-balance analysis (FBA). Bacteria have fascinating and diverse social lives. They display coordinated group behaviors regulated by quorum sensing (QS) systems. The QS circuit of V. harveyi integrates and funnels different ecological information through a common phosphorelay cascade to a set of small regulatory RNAs (sRNAs) that enables collective behavior. We analyzed the signaling properties and information flow in the QS circuit, which provides a model for information flow in signaling networks more generally. A comparative study of post-transcriptional and conventional transcriptional regulation suggest a niche for sRNAs in allowing cells to transition quickly yet reliably between distinct states. Furthermore, we develop a new framework for analyzing signal

MEDYAN: Mechanochemical Simulations of Contraction and Polarity Alignment in Actomyosin Networks.

Directory of Open Access Journals (Sweden)

Konstantin Popov

2016-04-01

Full Text Available Active matter systems, and in particular the cell cytoskeleton, exhibit complex mechanochemical dynamics that are still not well understood. While prior computational models of cytoskeletal dynamics have lead to many conceptual insights, an important niche still needs to be filled with a high-resolution structural modeling framework, which includes a minimally-complete set of cytoskeletal chemistries, stochastically treats reaction and diffusion processes in three spatial dimensions, accurately and efficiently describes mechanical deformations of the filamentous network under stresses generated by molecular motors, and deeply couples mechanics and chemistry at high spatial resolution. To address this need, we propose a novel reactive coarse-grained force field, as well as a publicly available software package, named the Mechanochemical Dynamics of Active Networks (MEDYAN, for simulating active network evolution and dynamics (available at www.medyan.org. This model can be used to study the non-linear, far from equilibrium processes in active matter systems, in particular, comprised of interacting semi-flexible polymers embedded in a solution with complex reaction-diffusion processes. In this work, we applied MEDYAN to investigate a contractile actomyosin network consisting of actin filaments, alpha-actinin cross-linking proteins, and non-muscle myosin IIA mini-filaments. We found that these systems undergo a switch-like transition in simulations from a random network to ordered, bundled structures when cross-linker concentration is increased above a threshold value, inducing contraction driven by myosin II mini-filaments. Our simulations also show how myosin II mini-filaments, in tandem with cross-linkers, can produce a range of actin filament polarity distributions and alignment, which is crucially dependent on the rate of actin filament turnover and the actin filament's resulting super-diffusive behavior in the actomyosin-cross-linker system

Integration of genomic information with biological networks using Cytoscape.

Science.gov (United States)

Bauer-Mehren, Anna

2013-01-01

Cytoscape is an open-source software for visualizing, analyzing, and modeling biological networks. This chapter explains how to use Cytoscape to analyze the functional effect of sequence variations in the context of biological networks such as protein-protein interaction networks and signaling pathways. The chapter is divided into five parts: (1) obtaining information about the functional effect of sequence variation in a Cytoscape readable format, (2) loading and displaying different types of biological networks in Cytoscape, (3) integrating the genomic information (SNPs and mutations) with the biological networks, and (4) analyzing the effect of the genomic perturbation onto the network structure using Cytoscape built-in functions. Finally, we briefly outline how the integrated data can help in building mathematical network models for analyzing the effect of the sequence variation onto the dynamics of the biological system. Each part is illustrated by step-by-step instructions on an example use case and visualized by many screenshots and figures.

The effect of network biology on drug toxicology

DEFF Research Database (Denmark)

Gautier, Laurent; Taboureau, Olivier; Audouze, Karine Marie Laure

2013-01-01

Introduction: The high failure rate of drug candidates due to toxicity, during clinical trials, is a critical issue in drug discovery. Network biology has become a promising approach, in this regard, using the increasingly large amount of biological and chemical data available and combining...... it with bioinformatics. With this approach, the assessment of chemical safety can be done across multiple scales of complexity from molecular to cellular and system levels in human health. Network biology can be used at several levels of complexity. Areas covered: This review describes the strengths and limitations...... of network biology. The authors specifically assess this approach across different biological scales when it is applied to toxicity. Expert opinion: There has been much progress made with the amount of data that is generated by various omics technologies. With this large amount of useful data, network...

Aligning the unalignable: bacteriophage whole genome alignments.

Science.gov (United States)

Bérard, Sèverine; Chateau, Annie; Pompidor, Nicolas; Guertin, Paul; Bergeron, Anne; Swenson, Krister M

2016-01-13

In recent years, many studies focused on the description and comparison of large sets of related bacteriophage genomes. Due to the peculiar mosaic structure of these genomes, few informative approaches for comparing whole genomes exist: dot plots diagrams give a mostly qualitative assessment of the similarity/dissimilarity between two or more genomes, and clustering techniques are used to classify genomes. Multiple alignments are conspicuously absent from this scene. Indeed, whole genome aligners interpret lack of similarity between sequences as an indication of rearrangements, insertions, or losses. This behavior makes them ill-prepared to align bacteriophage genomes, where even closely related strains can accomplish the same biological function with highly dissimilar sequences. In this paper, we propose a multiple alignment strategy that exploits functional collinearity shared by related strains of bacteriophages, and uses partial orders to capture mosaicism of sets of genomes. As classical alignments do, the computed alignments can be used to predict that genes have the same biological function, even in the absence of detectable similarity. The Alpha aligner implements these ideas in visual interactive displays, and is used to compute several examples of alignments of Staphylococcus aureus and Mycobacterium bacteriophages, involving up to 29 genomes. Using these datasets, we prove that Alpha alignments are at least as good as those computed by standard aligners. Comparison with the progressive Mauve aligner - which implements a partial order strategy, but whose alignments are linearized - shows a greatly improved interactive graphic display, while avoiding misalignments. Multiple alignments of whole bacteriophage genomes work, and will become an important conceptual and visual tool in comparative genomics of sets of related strains. A python implementation of Alpha, along with installation instructions for Ubuntu and OSX, is available on bitbucket (https://bitbucket.org/thekswenson/alpha).

Biologically inspired EM image alignment and neural reconstruction.

Science.gov (United States)

Knowles-Barley, Seymour; Butcher, Nancy J; Meinertzhagen, Ian A; Armstrong, J Douglas

2011-08-15

Three-dimensional reconstruction of consecutive serial-section transmission electron microscopy (ssTEM) images of neural tissue currently requires many hours of manual tracing and annotation. Several computational techniques have already been applied to ssTEM images to facilitate 3D reconstruction and ease this burden. Here, we present an alternative computational approach for ssTEM image analysis. We have used biologically inspired receptive fields as a basis for a ridge detection algorithm to identify cell membranes, synaptic contacts and mitochondria. Detected line segments are used to improve alignment between consecutive images and we have joined small segments of membrane into cell surfaces using a dynamic programming algorithm similar to the Needleman-Wunsch and Smith-Waterman DNA sequence alignment procedures. A shortest path-based approach has been used to close edges and achieve image segmentation. Partial reconstructions were automatically generated and used as a basis for semi-automatic reconstruction of neural tissue. The accuracy of partial reconstructions was evaluated and 96% of membrane could be identified at the cost of 13% false positive detections. An open-source reference implementation is available in the Supplementary information. seymour.kb@ed.ac.uk; douglas.armstrong@ed.ac.uk Supplementary data are available at Bioinformatics online.

[Network structures in biological systems].

Science.gov (United States)

Oleskin, A V

2013-01-01

Network structures (networks) that have been extensively studied in the humanities are characterized by cohesion, a lack of a central control unit, and predominantly fractal properties. They are contrasted with structures that contain a single centre (hierarchies) as well as with those whose elements predominantly compete with one another (market-type structures). As far as biological systems are concerned, their network structures can be subdivided into a number of types involving different organizational mechanisms. Network organization is characteristic of various structural levels of biological systems ranging from single cells to integrated societies. These networks can be classified into two main subgroups: (i) flat (leaderless) network structures typical of systems that are composed of uniform elements and represent modular organisms or at least possess manifest integral properties and (ii) three-dimensional, partly hierarchical structures characterized by significant individual and/or intergroup (intercaste) differences between their elements. All network structures include an element that performs structural, protective, and communication-promoting functions. By analogy to cell structures, this element is denoted as the matrix of a network structure. The matrix includes a material and an immaterial component. The material component comprises various structures that belong to the whole structure and not to any of its elements per se. The immaterial (ideal) component of the matrix includes social norms and rules regulating network elements' behavior. These behavioral rules can be described in terms of algorithms. Algorithmization enables modeling the behavior of various network structures, particularly of neuron networks and their artificial analogs.

A Unifying Mathematical Framework for Genetic Robustness, Environmental Robustness, Network Robustness and their Trade-offs on Phenotype Robustness in Biological Networks. Part III: Synthetic Gene Networks in Synthetic Biology

Science.gov (United States)

Chen, Bor-Sen; Lin, Ying-Po

2013-01-01

Robust stabilization and environmental disturbance attenuation are ubiquitous systematic properties that are observed in biological systems at many different levels. The underlying principles for robust stabilization and environmental disturbance attenuation are universal to both complex biological systems and sophisticated engineering systems. In many biological networks, network robustness should be large enough to confer: intrinsic robustness for tolerating intrinsic parameter fluctuations; genetic robustness for buffering genetic variations; and environmental robustness for resisting environmental disturbances. Network robustness is needed so phenotype stability of biological network can be maintained, guaranteeing phenotype robustness. Synthetic biology is foreseen to have important applications in biotechnology and medicine; it is expected to contribute significantly to a better understanding of functioning of complex biological systems. This paper presents a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance attenuation for synthetic gene networks in synthetic biology. Further, from the unifying mathematical framework, we found that the phenotype robustness criterion for synthetic gene networks is the following: if intrinsic robustness + genetic robustness + environmental robustness ≦ network robustness, then the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations, genetic variations, and environmental disturbances. Therefore, the trade-offs between intrinsic robustness, genetic robustness, environmental robustness, and network robustness in synthetic biology can also be investigated through corresponding phenotype robustness criteria from the systematic point of view. Finally, a robust synthetic design that involves network evolution algorithms with desired behavior under intrinsic parameter fluctuations, genetic variations, and environmental

From biological and social network metaphors to coupled bio-social wireless networks

Science.gov (United States)

Barrett, Christopher L.; Eubank, Stephen; Anil Kumar, V.S.; Marathe, Madhav V.

2010-01-01

Biological and social analogies have been long applied to complex systems. Inspiration has been drawn from biological solutions to solve problems in engineering products and systems, ranging from Velcro to camouflage to robotics to adaptive and learning computing methods. In this paper, we present an overview of recent advances in understanding biological systems as networks and use this understanding to design and analyse wireless communication networks. We expand on two applications, namely cognitive sensing and control and wireless epidemiology. We discuss how our work in these two applications is motivated by biological metaphors. We believe that recent advances in computing and communications coupled with advances in health and social sciences raise the possibility of studying coupled bio-social communication networks. We argue that we can better utilise the advances in our understanding of one class of networks to better our understanding of the other. PMID:21643462

Biodiesel and Integrated STEM: Vertical Alignment of High School Biology/Biochemistry and Chemistry

Science.gov (United States)

Burrows, Andrea C.; Breiner, Jonathan M.; Keiner, Jennifer; Behm, Chris

2014-01-01

This article explores the vertical alignment of two high school classes, biology and chemistry, around the core concept of biodiesel fuel production. High school teachers and university faculty members investigated biodiesel as it relates to societal impact through a National Science Foundation Research Experience for Teachers. Using an action…

100 nm scale low-noise sensors based on aligned carbon nanotube networks: overcoming the fundamental limitation of network-based sensors

Science.gov (United States)

Lee, Minbaek; Lee, Joohyung; Kim, Tae Hyun; Lee, Hyungwoo; Lee, Byung Yang; Park, June; Jhon, Young Min; Seong, Maeng-Je; Hong, Seunghun

2010-02-01

Nanoscale sensors based on single-walled carbon nanotube (SWNT) networks have been considered impractical due to several fundamental limitations such as a poor sensitivity and small signal-to-noise ratio. Herein, we present a strategy to overcome these fundamental problems and build highly-sensitive low-noise nanoscale sensors simply by controlling the structure of the SWNT networks. In this strategy, we prepared nanoscale width channels based on aligned SWNT networks using a directed assembly strategy. Significantly, the aligned network-based sensors with narrower channels exhibited even better signal-to-noise ratio than those with wider channels, which is opposite to conventional random network-based sensors. As a proof of concept, we demonstrated 100 nm scale low-noise sensors to detect mercury ions with the detection limit of ~1 pM, which is superior to any state-of-the-art portable detection system and is below the allowable limit of mercury ions in drinking water set by most government environmental protection agencies. This is the first demonstration of 100 nm scale low-noise sensors based on SWNT networks. Considering the increased interests in high-density sensor arrays for healthcare and environmental protection, our strategy should have a significant impact on various industrial applications.

100 nm scale low-noise sensors based on aligned carbon nanotube networks: overcoming the fundamental limitation of network-based sensors

Energy Technology Data Exchange (ETDEWEB)

Lee, Minbaek; Lee, Joohyung; Kim, Tae Hyun; Lee, Hyungwoo; Lee, Byung Yang; Hong, Seunghun [Department of Physics and Astronomy, Seoul National University, Shilim-Dong, Kwanak-Gu, Seoul 151-742 (Korea, Republic of); Park, June; Seong, Maeng-Je [Department of Physics, Chung-Ang University, Heukseok-Dong, Dongjak-Gu, Seoul 156-756 (Korea, Republic of); Jhon, Young Min, E-mail: mseong@cau.ac.kr, E-mail: shong@phya.snu.ac.kr [Korea Institute of Science and Technology, Hawolgok-Dong, Seongbuk-Gu, Seoul 136-791 (Korea, Republic of)

2010-02-05

Nanoscale sensors based on single-walled carbon nanotube (SWNT) networks have been considered impractical due to several fundamental limitations such as a poor sensitivity and small signal-to-noise ratio. Herein, we present a strategy to overcome these fundamental problems and build highly-sensitive low-noise nanoscale sensors simply by controlling the structure of the SWNT networks. In this strategy, we prepared nanoscale width channels based on aligned SWNT networks using a directed assembly strategy. Significantly, the aligned network-based sensors with narrower channels exhibited even better signal-to-noise ratio than those with wider channels, which is opposite to conventional random network-based sensors. As a proof of concept, we demonstrated 100 nm scale low-noise sensors to detect mercury ions with the detection limit of {approx}1 pM, which is superior to any state-of-the-art portable detection system and is below the allowable limit of mercury ions in drinking water set by most government environmental protection agencies. This is the first demonstration of 100 nm scale low-noise sensors based on SWNT networks. Considering the increased interests in high-density sensor arrays for healthcare and environmental protection, our strategy should have a significant impact on various industrial applications.

100 nm scale low-noise sensors based on aligned carbon nanotube networks: overcoming the fundamental limitation of network-based sensors

International Nuclear Information System (INIS)

Lee, Minbaek; Lee, Joohyung; Kim, Tae Hyun; Lee, Hyungwoo; Lee, Byung Yang; Hong, Seunghun; Park, June; Seong, Maeng-Je; Jhon, Young Min

2010-01-01

Nanoscale sensors based on single-walled carbon nanotube (SWNT) networks have been considered impractical due to several fundamental limitations such as a poor sensitivity and small signal-to-noise ratio. Herein, we present a strategy to overcome these fundamental problems and build highly-sensitive low-noise nanoscale sensors simply by controlling the structure of the SWNT networks. In this strategy, we prepared nanoscale width channels based on aligned SWNT networks using a directed assembly strategy. Significantly, the aligned network-based sensors with narrower channels exhibited even better signal-to-noise ratio than those with wider channels, which is opposite to conventional random network-based sensors. As a proof of concept, we demonstrated 100 nm scale low-noise sensors to detect mercury ions with the detection limit of ∼1 pM, which is superior to any state-of-the-art portable detection system and is below the allowable limit of mercury ions in drinking water set by most government environmental protection agencies. This is the first demonstration of 100 nm scale low-noise sensors based on SWNT networks. Considering the increased interests in high-density sensor arrays for healthcare and environmental protection, our strategy should have a significant impact on various industrial applications.

Functional model of biological neural networks.

Science.gov (United States)

Lo, James Ting-Ho

2010-12-01

A functional model of biological neural networks, called temporal hierarchical probabilistic associative memory (THPAM), is proposed in this paper. THPAM comprises functional models of dendritic trees for encoding inputs to neurons, a first type of neuron for generating spike trains, a second type of neuron for generating graded signals to modulate neurons of the first type, supervised and unsupervised Hebbian learning mechanisms for easy learning and retrieving, an arrangement of dendritic trees for maximizing generalization, hardwiring for rotation-translation-scaling invariance, and feedback connections with different delay durations for neurons to make full use of present and past informations generated by neurons in the same and higher layers. These functional models and their processing operations have many functions of biological neural networks that have not been achieved by other models in the open literature and provide logically coherent answers to many long-standing neuroscientific questions. However, biological justifications of these functional models and their processing operations are required for THPAM to qualify as a macroscopic model (or low-order approximate) of biological neural networks.

Reconstructing Causal Biological Networks through Active Learning.

Directory of Open Access Journals (Sweden)

Hyunghoon Cho

Full Text Available Reverse-engineering of biological networks is a central problem in systems biology. The use of intervention data, such as gene knockouts or knockdowns, is typically used for teasing apart causal relationships among genes. Under time or resource constraints, one needs to carefully choose which intervention experiments to carry out. Previous approaches for selecting most informative interventions have largely been focused on discrete Bayesian networks. However, continuous Bayesian networks are of great practical interest, especially in the study of complex biological systems and their quantitative properties. In this work, we present an efficient, information-theoretic active learning algorithm for Gaussian Bayesian networks (GBNs, which serve as important models for gene regulatory networks. In addition to providing linear-algebraic insights unique to GBNs, leading to significant runtime improvements, we demonstrate the effectiveness of our method on data simulated with GBNs and the DREAM4 network inference challenge data sets. Our method generally leads to faster recovery of underlying network structure and faster convergence to final distribution of confidence scores over candidate graph structures using the full data, in comparison to random selection of intervention experiments.

Exploring the Alignment of the Intended and Implemented Curriculum through Teachers' Interpretation: A Case Study of A-Level Biology Practical Work

Science.gov (United States)

Phaeton, Mukaro Joe; Stears, Michèle

2017-01-01

The research reported on here is part of a larger study exploring the alignment of the intended, implemented and attained curriculum with regard to practical work in the Zimbabwean A-level Biology curriculum. In this paper we focus on the alignment between the intended and implemented A-Level Biology curriculum through the lens of teachers'…

Applying differential dynamic logic to reconfigurable biological networks.

Science.gov (United States)

Figueiredo, Daniel; Martins, Manuel A; Chaves, Madalena

2017-09-01

Qualitative and quantitative modeling frameworks are widely used for analysis of biological regulatory networks, the former giving a preliminary overview of the system's global dynamics and the latter providing more detailed solutions. Another approach is to model biological regulatory networks as hybrid systems, i.e., systems which can display both continuous and discrete dynamic behaviors. Actually, the development of synthetic biology has shown that this is a suitable way to think about biological systems, which can often be constructed as networks with discrete controllers, and present hybrid behaviors. In this paper we discuss this approach as a special case of the reconfigurability paradigm, well studied in Computer Science (CS). In CS there are well developed computational tools to reason about hybrid systems. We argue that it is worth applying such tools in a biological context. One interesting tool is differential dynamic logic (dL), which has recently been developed by Platzer and applied to many case-studies. In this paper we discuss some simple examples of biological regulatory networks to illustrate how dL can be used as an alternative, or also as a complement to methods already used. Copyright © 2017 Elsevier Inc. All rights reserved.

Alignment and integration of complex networks by hypergraph-based spectral clustering

Science.gov (United States)

Michoel, Tom; Nachtergaele, Bruno

2012-11-01

Complex networks possess a rich, multiscale structure reflecting the dynamical and functional organization of the systems they model. Often there is a need to analyze multiple networks simultaneously, to model a system by more than one type of interaction, or to go beyond simple pairwise interactions, but currently there is a lack of theoretical and computational methods to address these problems. Here we introduce a framework for clustering and community detection in such systems using hypergraph representations. Our main result is a generalization of the Perron-Frobenius theorem from which we derive spectral clustering algorithms for directed and undirected hypergraphs. We illustrate our approach with applications for local and global alignment of protein-protein interaction networks between multiple species, for tripartite community detection in folksonomies, and for detecting clusters of overlapping regulatory pathways in directed networks.

Organization of excitable dynamics in hierarchical biological networks.

Directory of Open Access Journals (Sweden)

Mark Müller-Linow

Full Text Available This study investigates the contributions of network topology features to the dynamic behavior of hierarchically organized excitable networks. Representatives of different types of hierarchical networks as well as two biological neural networks are explored with a three-state model of node activation for systematically varying levels of random background network stimulation. The results demonstrate that two principal topological aspects of hierarchical networks, node centrality and network modularity, correlate with the network activity patterns at different levels of spontaneous network activation. The approach also shows that the dynamic behavior of the cerebral cortical systems network in the cat is dominated by the network's modular organization, while the activation behavior of the cellular neuronal network of Caenorhabditis elegans is strongly influenced by hub nodes. These findings indicate the interaction of multiple topological features and dynamic states in the function of complex biological networks.

Application of random matrix theory to biological networks

Energy Technology Data Exchange (ETDEWEB)

Luo Feng [Department of Computer Science, Clemson University, 100 McAdams Hall, Clemson, SC 29634 (United States); Department of Pathology, U.T. Southwestern Medical Center, 5323 Harry Hines Blvd. Dallas, TX 75390-9072 (United States); Zhong Jianxin [Department of Physics, Xiangtan University, Hunan 411105 (China) and Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States)]. E-mail: zhongjn@ornl.gov; Yang Yunfeng [Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Scheuermann, Richard H. [Department of Pathology, U.T. Southwestern Medical Center, 5323 Harry Hines Blvd. Dallas, TX 75390-9072 (United States); Zhou Jizhong [Department of Botany and Microbiology, University of Oklahoma, Norman, OK 73019 (United States) and Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States)]. E-mail: zhouj@ornl.gov

2006-09-25

We show that spectral fluctuation of interaction matrices of a yeast protein-protein interaction network and a yeast metabolic network follows the description of the Gaussian orthogonal ensemble (GOE) of random matrix theory (RMT). Furthermore, we demonstrate that while the global biological networks evaluated belong to GOE, removal of interactions between constituents transitions the networks to systems of isolated modules described by the Poisson distribution. Our results indicate that although biological networks are very different from other complex systems at the molecular level, they display the same statistical properties at network scale. The transition point provides a new objective approach for the identification of functional modules.

A simulation model for aligning smart home networks and deploying smart objects

DEFF Research Database (Denmark)

Lynggaard, Per

Smart homes use sensor based networks to capture activities and offer learned services to the user. These smart home networks are challenging because they mainly use wireless communication at frequencies that are shared with other services and equipments. One of the major challenges...... is the interferences produced by WiFi access points in smart home networks which are expensive to overcome in terms of battery energy. Currently, different method exists to handle this. However, they use complex mechanisms such as sharing frequencies, sharing time slots, and spatial reuse of frequencies. This paper...... introduces a unique concept which saves battery energy and lowers the interference level by simulating the network alignment and assign the necessary amount of transmit power to each individual network node and finally, deploy the smart objects. The needed transmit powers are calculated by the presented...

Characterizing Topology of Probabilistic Biological Networks.

Science.gov (United States)

Todor, Andrei; Dobra, Alin; Kahveci, Tamer

2013-09-06

Biological interactions are often uncertain events, that may or may not take place with some probability. Existing studies analyze the degree distribution of biological networks by assuming that all the given interactions take place under all circumstances. This strong and often incorrect assumption can lead to misleading results. Here, we address this problem and develop a sound mathematical basis to characterize networks in the presence of uncertain interactions. We develop a method that accurately describes the degree distribution of such networks. We also extend our method to accurately compute the joint degree distributions of node pairs connected by edges. The number of possible network topologies grows exponentially with the number of uncertain interactions. However, the mathematical model we develop allows us to compute these degree distributions in polynomial time in the number of interactions. It also helps us find an adequate mathematical model using maximum likelihood estimation. Our results demonstrate that power law and log-normal models best describe degree distributions for probabilistic networks. The inverse correlation of degrees of neighboring nodes shows that, in probabilistic networks, nodes with large number of interactions prefer to interact with those with small number of interactions more frequently than expected.

Multilayer network modeling of integrated biological systems. Comment on "Network science of biological systems at different scales: A review" by Gosak et al.

Science.gov (United States)

De Domenico, Manlio

2018-03-01

Biological systems, from a cell to the human brain, are inherently complex. A powerful representation of such systems, described by an intricate web of relationships across multiple scales, is provided by complex networks. Recently, several studies are highlighting how simple networks - obtained by aggregating or neglecting temporal or categorical description of biological data - are not able to account for the richness of information characterizing biological systems. More complex models, namely multilayer networks, are needed to account for interdependencies, often varying across time, of biological interacting units within a cell, a tissue or parts of an organism.

Biological Networks Entropies: Examples in Neural Memory Networks, Genetic Regulation Networks and Social Epidemic Networks

Directory of Open Access Journals (Sweden)

Jacques Demongeot

2018-01-01

Full Text Available Networks used in biological applications at different scales (molecule, cell and population are of different types: neuronal, genetic, and social, but they share the same dynamical concepts, in their continuous differential versions (e.g., non-linear Wilson-Cowan system as well as in their discrete Boolean versions (e.g., non-linear Hopfield system; in both cases, the notion of interaction graph G(J associated to its Jacobian matrix J, and also the concepts of frustrated nodes, positive or negative circuits of G(J, kinetic energy, entropy, attractors, structural stability, etc., are relevant and useful for studying the dynamics and the robustness of these systems. We will give some general results available for both continuous and discrete biological networks, and then study some specific applications of three new notions of entropy: (i attractor entropy, (ii isochronal entropy and (iii entropy centrality; in three domains: a neural network involved in the memory evocation, a genetic network responsible of the iron control and a social network accounting for the obesity spread in high school environment.

Networks in biological systems: An investigation of the Gene Ontology as an evolving network

International Nuclear Information System (INIS)

Coronnello, C; Tumminello, M; Micciche, S; Mantegna, R.N.

2009-01-01

Many biological systems can be described as networks where different elements interact, in order to perform biological processes. We introduce a network associated with the Gene Ontology. Specifically, we construct a correlation-based network where the vertices are the terms of the Gene Ontology and the link between each two terms is weighted on the basis of the number of genes that they have in common. We analyze a filtered network obtained from the correlation-based network and we characterize its evolution over different releases of the Gene Ontology.

Improved image alignment method in application to X-ray images and biological images.

Science.gov (United States)

Wang, Ching-Wei; Chen, Hsiang-Chou

2013-08-01

Alignment of medical images is a vital component of a large number of applications throughout the clinical track of events; not only within clinical diagnostic settings, but prominently so in the area of planning, consummation and evaluation of surgical and radiotherapeutical procedures. However, image registration of medical images is challenging because of variations on data appearance, imaging artifacts and complex data deformation problems. Hence, the aim of this study is to develop a robust image alignment method for medical images. An improved image registration method is proposed, and the method is evaluated with two types of medical data, including biological microscopic tissue images and dental X-ray images and compared with five state-of-the-art image registration techniques. The experimental results show that the presented method consistently performs well on both types of medical images, achieving 88.44 and 88.93% averaged registration accuracies for biological tissue images and X-ray images, respectively, and outperforms the benchmark methods. Based on the Tukey's honestly significant difference test and Fisher's least square difference test tests, the presented method performs significantly better than all existing methods (P ≤ 0.001) for tissue image alignment, and for the X-ray image registration, the proposed method performs significantly better than the two benchmark b-spline approaches (P < 0.001). The software implementation of the presented method and the data used in this study are made publicly available for scientific communities to use (http://www-o.ntust.edu.tw/∼cweiwang/ImprovedImageRegistration/). cweiwang@mail.ntust.edu.tw.

Improving accountability through alignment: the role of academic health science centres and networks in England.

Science.gov (United States)

Ovseiko, Pavel V; Heitmueller, Axel; Allen, Pauline; Davies, Stephen M; Wells, Glenn; Ford, Gary A; Darzi, Ara; Buchan, Alastair M

2014-01-20

As in many countries around the world, there are high expectations on academic health science centres and networks in England to provide high-quality care, innovative research, and world-class education, while also supporting wealth creation and economic growth. Meeting these expectations increasingly depends on partnership working between university medical schools and teaching hospitals, as well as other healthcare providers. However, academic-clinical relationships in England are still characterised by the "unlinked partners" model, whereby universities and their partner teaching hospitals are neither fiscally nor structurally linked, creating bifurcating accountabilities to various government and public agencies. This article focuses on accountability relationships in universities and teaching hospitals, as well as other healthcare providers that form core constituent parts of academic health science centres and networks. The authors analyse accountability for the tripartite mission of patient care, research, and education, using a four-fold typology of accountability relationships, which distinguishes between hierarchical (bureaucratic) accountability, legal accountability, professional accountability, and political accountability. Examples from North West London suggest that a number of mechanisms can be used to improve accountability for the tripartite mission through alignment, but that the simple creation of academic health science centres and networks is probably not sufficient. At the heart of the challenge for academic health science centres and networks is the separation of accountabilities for patient care, research, and education in different government departments. Given that a fundamental top-down system redesign is now extremely unlikely, local academic and clinical leaders face the challenge of aligning their institutions as a matter of priority in order to improve accountability for the tripartite mission from the bottom up. It remains to be

Biological and Environmental Research Network Requirements

Energy Technology Data Exchange (ETDEWEB)

Balaji, V. [Princeton Univ., NJ (United States). Earth Science Grid Federation (ESGF); Boden, Tom [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Cowley, Dave [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Dart, Eli [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). ESNet; Dattoria, Vince [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). ESNet; Desai, Narayan [Argonne National Lab. (ANL), Argonne, IL (United States); Egan, Rob [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Foster, Ian [Argonne National Lab. (ANL), Argonne, IL (United States); Goldstone, Robin [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Gregurick, Susan [U.S. Dept. of Energy, Washington, DC (United States). Biological Systems Science Division; Houghton, John [U.S. Dept. of Energy, Washington, DC (United States). Biological and Environmental Research (BER) Program; Izaurralde, Cesar [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Johnston, Bill [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). ESNet; Joseph, Renu [U.S. Dept. of Energy, Washington, DC (United States). Climate and Environmental Sciences Division; Kleese-van Dam, Kerstin [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Lipton, Mary [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Monga, Inder [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). ESNet; Pritchard, Matt [British Atmospheric Data Centre (BADC), Oxon (United Kingdom); Rotman, Lauren [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). ESNet; Strand, Gary [National Center for Atmospheric Research (NCAR), Boulder, CO (United States); Stuart, Cory [Argonne National Lab. (ANL), Argonne, IL (United States); Tatusova, Tatiana [National Inst. of Health (NIH), Bethesda, MD (United States); Tierney, Brian [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). ESNet; Thomas, Brian [Univ. of California, Berkeley, CA (United States); Williams, Dean N. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Zurawski, Jason [Internet2, Washington, DC (United States)

2013-09-01

The Energy Sciences Network (ESnet) is the primary provider of network connectivity for the U.S. Department of Energy (DOE) Office of Science (SC), the single largest supporter of basic research in the physical sciences in the United States. In support of SC programs, ESnet regularly updates and refreshes its understanding of the networking requirements of the instruments, facilities, scientists, and science programs that it serves. This focus has helped ESnet be a highly successful enabler of scientific discovery for over 25 years. In November 2012, ESnet and the Office of Biological and Environmental Research (BER) of the DOE SC organized a review to characterize the networking requirements of the programs funded by the BER program office. Several key findings resulted from the review. Among them: 1) The scale of data sets available to science collaborations continues to increase exponentially. This has broad impact, both on the network and on the computational and storage systems connected to the network. 2) Many science collaborations require assistance to cope with the systems and network engineering challenges inherent in managing the rapid growth in data scale. 3) Several science domains operate distributed facilities that rely on high-performance networking for success. Key examples illustrated in this report include the Earth System Grid Federation (ESGF) and the Systems Biology Knowledgebase (KBase). This report expands on these points, and addresses others as well. The report contains a findings section as well as the text of the case studies discussed at the review.

NN-align. An artificial neural network-based alignment algorithm for MHC class II peptide binding prediction

Directory of Open Access Journals (Sweden)

Lund Ole

2009-09-01

Full Text Available Abstract Background The major histocompatibility complex (MHC molecule plays a central role in controlling the adaptive immune response to infections. MHC class I molecules present peptides derived from intracellular proteins to cytotoxic T cells, whereas MHC class II molecules stimulate cellular and humoral immunity through presentation of extracellularly derived peptides to helper T cells. Identification of which peptides will bind a given MHC molecule is thus of great importance for the understanding of host-pathogen interactions, and large efforts have been placed in developing algorithms capable of predicting this binding event. Results Here, we present a novel artificial neural network-based method, NN-align that allows for simultaneous identification of the MHC class II binding core and binding affinity. NN-align is trained using a novel training algorithm that allows for correction of bias in the training data due to redundant binding core representation. Incorporation of information about the residues flanking the peptide-binding core is shown to significantly improve the prediction accuracy. The method is evaluated on a large-scale benchmark consisting of six independent data sets covering 14 human MHC class II alleles, and is demonstrated to outperform other state-of-the-art MHC class II prediction methods. Conclusion The NN-align method is competitive with the state-of-the-art MHC class II peptide binding prediction algorithms. The method is publicly available at http://www.cbs.dtu.dk/services/NetMHCII-2.0.

Automated, feature-based image alignment for high-resolution imaging mass spectrometry of large biological samples

NARCIS (Netherlands)

Broersen, A.; Liere, van R.; Altelaar, A.F.M.; Heeren, R.M.A.; McDonnell, L.A.

2008-01-01

High-resolution imaging mass spectrometry of large biological samples is the goal of several research groups. In mosaic imaging, the most common method, the large sample is divided into a mosaic of small areas that are then analyzed with high resolution. Here we present an automated alignment

Uncovering Biological Network Function via Graphlet Degree Signatures

Directory of Open Access Journals (Sweden)

Nataša Pržulj

2008-01-01

Full Text Available Motivation: Proteins are essential macromolecules of life and thus understanding their function is of great importance. The number of functionally unclassified proteins is large even for simple and well studied organisms such as baker’s yeast. Methods for determining protein function have shifted their focus from targeting specific proteins based solely on sequence homology to analyses of the entire proteome based on protein-protein interaction (PPI networks. Since proteins interact to perform a certain function, analyzing structural properties of PPI networks may provide useful clues about the biological function of individual proteins, protein complexes they participate in, and even larger subcellular machines.Results: We design a sensitive graph theoretic method for comparing local structures of node neighborhoods that demonstrates that in PPI networks, biological function of a node and its local network structure are closely related. The method summarizes a protein’s local topology in a PPI network into the vector of graphlet degrees called the signature of the protein and computes the signature similarities between all protein pairs. We group topologically similar proteins under this measure in a PPI network and show that these protein groups belong to the same protein complexes, perform the same biological functions, are localized in the same subcellular compartments, and have the same tissue expressions. Moreover, we apply our technique on a proteome-scale network data and infer biological function of yet unclassified proteins demonstrating that our method can provide valuable guidelines for future experimental research such as disease protein prediction.Availability: Data is available upon request.

SBEToolbox: A Matlab Toolbox for Biological Network Analysis.

Science.gov (United States)

Konganti, Kranti; Wang, Gang; Yang, Ence; Cai, James J

2013-01-01

We present SBEToolbox (Systems Biology and Evolution Toolbox), an open-source Matlab toolbox for biological network analysis. It takes a network file as input, calculates a variety of centralities and topological metrics, clusters nodes into modules, and displays the network using different graph layout algorithms. Straightforward implementation and the inclusion of high-level functions allow the functionality to be easily extended or tailored through developing custom plugins. SBEGUI, a menu-driven graphical user interface (GUI) of SBEToolbox, enables easy access to various network and graph algorithms for programmers and non-programmers alike. All source code and sample data are freely available at https://github.com/biocoder/SBEToolbox/releases.

Mining Functional Modules in Heterogeneous Biological Networks Using Multiplex PageRank Approach.

Science.gov (United States)

Li, Jun; Zhao, Patrick X

2016-01-01

Identification of functional modules/sub-networks in large-scale biological networks is one of the important research challenges in current bioinformatics and systems biology. Approaches have been developed to identify functional modules in single-class biological networks; however, methods for systematically and interactively mining multiple classes of heterogeneous biological networks are lacking. In this paper, we present a novel algorithm (called mPageRank) that utilizes the Multiplex PageRank approach to mine functional modules from two classes of biological networks. We demonstrate the capabilities of our approach by successfully mining functional biological modules through integrating expression-based gene-gene association networks and protein-protein interaction networks. We first compared the performance of our method with that of other methods using simulated data. We then applied our method to identify the cell division cycle related functional module and plant signaling defense-related functional module in the model plant Arabidopsis thaliana. Our results demonstrated that the mPageRank method is effective for mining sub-networks in both expression-based gene-gene association networks and protein-protein interaction networks, and has the potential to be adapted for the discovery of functional modules/sub-networks in other heterogeneous biological networks. The mPageRank executable program, source code, the datasets and results of the presented two case studies are publicly and freely available at http://plantgrn.noble.org/MPageRank/.

Activating and inhibiting connections in biological network dynamics

Directory of Open Access Journals (Sweden)

Knight Rob

2008-12-01

Full Text Available Abstract Background Many studies of biochemical networks have analyzed network topology. Such work has suggested that specific types of network wiring may increase network robustness and therefore confer a selective advantage. However, knowledge of network topology does not allow one to predict network dynamical behavior – for example, whether deleting a protein from a signaling network would maintain the network's dynamical behavior, or induce oscillations or chaos. Results Here we report that the balance between activating and inhibiting connections is important in determining whether network dynamics reach steady state or oscillate. We use a simple dynamical model of a network of interacting genes or proteins. Using the model, we study random networks, networks selected for robust dynamics, and examples of biological network topologies. The fraction of activating connections influences whether the network dynamics reach steady state or oscillate. Conclusion The activating fraction may predispose a network to oscillate or reach steady state, and neutral evolution or selection of this parameter may affect the behavior of biological networks. This principle may unify the dynamics of a wide range of cellular networks. Reviewers Reviewed by Sergei Maslov, Eugene Koonin, and Yu (Brandon Xia (nominated by Mark Gerstein. For the full reviews, please go to the Reviewers' comments section.

Title: Using Alignment and 2D Network Simulations to Study Charge Transport Through Doped ZnO Nanowire Thin Film Electrodes

KAUST Repository

Phadke, Sujay

2011-09-30

Factors affecting charge transport through ZnO nanowire mat films were studied by aligning ZnO nanowires on substrates and coupling experimental measurements with 2D nanowire network simulations. Gallium doped ZnO nanowires were aligned on thermally oxidized silicon wafer by shearing a nanowire dispersion in ethanol. Sheet resistances of nanowire thin films that had current flowing parallel to nanowire alignment direction were compared to thin films that had current flowing perpendicular to nanowire alignment direction. Perpendicular devices showed ∼5 fold greater sheet resistance than parallel devices supporting the hypothesis that aligning nanowires would increase conductivity of ZnO nanowire electrodes. 2-D nanowire network simulations of thin films showed that the device sheet resistance was dominated by inter-wire contact resistance. For a given resistivity of ZnO nanowires, the thin film electrodes would have the lowest possible sheet resistance if the inter-wire contact resistance was one order of magnitude lower than the single nanowire resistance. Simulations suggest that the conductivity of such thin film devices could be further enhanced by using longer nanowires. Solution processed Gallium doped ZnO nanowires are aligned on substrates using an innovative shear coating technique. Nanowire alignment has shown improvement in ZnO nanowire transparent electrode conductivity. 2D network simulations in conjunction with electrical measurements have revealed different regimes of operation of nanowire thin films and provided a guideline for improving electrical performance of nanowire electrodes. Copyright © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Engineering survey planning for the alignment of a particle accelerator: part II. Design of a reference network and measurement strategy

Science.gov (United States)

Junqueira Leão, Rodrigo; Raffaelo Baldo, Crhistian; Collucci da Costa Reis, Maria Luisa; Alves Trabanco, Jorge Luiz

2018-03-01

The building blocks of particle accelerators are magnets responsible for keeping beams of charged particles at a desired trajectory. Magnets are commonly grouped in support structures named girders, which are mounted on vertical and horizontal stages. The performance of this type of machine is highly dependent on the relative alignment between its main components. The length of particle accelerators ranges from small machines to large-scale national or international facilities, with typical lengths of hundreds of meters to a few kilometers. This relatively large volume together with micrometric positioning tolerances make the alignment activity a classical large-scale dimensional metrology problem. The alignment concept relies on networks of fixed monuments installed on the building structure to which all accelerator components are referred. In this work, the Sirius accelerator is taken as a case study, and an alignment network is optimized via computational methods in terms of geometry, densification, and surveying procedure. Laser trackers are employed to guide the installation and measure the girders’ positions, using the optimized network as a reference and applying the metric developed in part I of this paper. Simulations demonstrate the feasibility of aligning the 220 girders of the Sirius synchrotron to better than 0.080 mm, at a coverage probability of 95%.

Emergence of communication in socio-biological networks

CERN Document Server

Berea, Anamaria

2018-01-01

This book integrates current advances in biology, economics of information and linguistics research through applications using agent-based modeling and social network analysis to develop scenarios of communication and language emergence in the social aspects of biological communications. The book presents a model of communication emergence that can be applied both to human and non-human living organism networks. The model is based on economic concepts and individual behavior fundamental for the study of trust and reputation networks in social science, particularly in economics; it is also based on the theory of the emergence of norms and historical path dependence that has been influential in institutional economics. Also included are mathematical models and code for agent-based models to explore various scenarios of language evolution, as well as a computer application that explores language and communication in biological versus social organisms, and the emergence of various meanings and grammars in human ...

Network Biology (http://www.iaees.org/publications/journals/nb/online-version.asp

Directory of Open Access Journals (Sweden)

networkbiology@iaees.org

Full Text Available Network Biology ISSN 2220-8879 URL: http://www.iaees.org/publications/journals/nb/online-version.asp RSS: http://www.iaees.org/publications/journals/nb/rss.xml E-mail: networkbiology@iaees.org Editor-in-Chief: WenJun Zhang Aims and Scope NETWORK BIOLOGY (ISSN 2220-8879; CODEN NBEICS is an open access, peer-reviewed international journal that considers scientific articles in all different areas of network biology. It is the transactions of the International Society of Network Biology. It dedicates to the latest advances in network biology. The goal of this journal is to keep a record of the state-of-the-art research and promote the research work in these fast moving areas. The topics to be covered by Network Biology include, but are not limited to: •Theories, algorithms and programs of network analysis •Innovations and applications of biological networks •Ecological networks, food webs and natural equilibrium •Co-evolution, co-extinction, biodiversity conservation •Metabolic networks, protein-protein interaction networks, biochemical reaction networks, gene networks, transcriptional regulatory networks, cell cycle networks, phylogenetic networks, network motifs •Physiological networks •Network regulation of metabolic processes, human diseases and ecological systems •Social networks, epidemiological networks •System complexity, self-organized systems, emergence of biological systems, agent-based modeling, individual-based modeling, neural network modeling, and other network-based modeling, etc. We are also interested in short communications that clearly address a specific issue or completely present a new ecological network, food web, or metabolic or gene network, etc. Authors can submit their works to the email box of this journal, networkbiology@iaees.org. All manuscripts submitted to this journal must be previously unpublished and may not be considered for publication elsewhere at any time during review period of this journal

Assessment of network perturbation amplitudes by applying high-throughput data to causal biological networks

Directory of Open Access Journals (Sweden)

Martin Florian

2012-05-01

Full Text Available Abstract Background High-throughput measurement technologies produce data sets that have the potential to elucidate the biological impact of disease, drug treatment, and environmental agents on humans. The scientific community faces an ongoing challenge in the analysis of these rich data sources to more accurately characterize biological processes that have been perturbed at the mechanistic level. Here, a new approach is built on previous methodologies in which high-throughput data was interpreted using prior biological knowledge of cause and effect relationships. These relationships are structured into network models that describe specific biological processes, such as inflammatory signaling or cell cycle progression. This enables quantitative assessment of network perturbation in response to a given stimulus. Results Four complementary methods were devised to quantify treatment-induced activity changes in processes described by network models. In addition, companion statistics were developed to qualify significance and specificity of the results. This approach is called Network Perturbation Amplitude (NPA scoring because the amplitudes of treatment-induced perturbations are computed for biological network models. The NPA methods were tested on two transcriptomic data sets: normal human bronchial epithelial (NHBE cells treated with the pro-inflammatory signaling mediator TNFα, and HCT116 colon cancer cells treated with the CDK cell cycle inhibitor R547. Each data set was scored against network models representing different aspects of inflammatory signaling and cell cycle progression, and these scores were compared with independent measures of pathway activity in NHBE cells to verify the approach. The NPA scoring method successfully quantified the amplitude of TNFα-induced perturbation for each network model when compared against NF-κB nuclear localization and cell number. In addition, the degree and specificity to which CDK

Network Analysis Tools: from biological networks to clusters and pathways.

Science.gov (United States)

Brohée, Sylvain; Faust, Karoline; Lima-Mendez, Gipsi; Vanderstocken, Gilles; van Helden, Jacques

2008-01-01

Network Analysis Tools (NeAT) is a suite of computer tools that integrate various algorithms for the analysis of biological networks: comparison between graphs, between clusters, or between graphs and clusters; network randomization; analysis of degree distribution; network-based clustering and path finding. The tools are interconnected to enable a stepwise analysis of the network through a complete analytical workflow. In this protocol, we present a typical case of utilization, where the tasks above are combined to decipher a protein-protein interaction network retrieved from the STRING database. The results returned by NeAT are typically subnetworks, networks enriched with additional information (i.e., clusters or paths) or tables displaying statistics. Typical networks comprising several thousands of nodes and arcs can be analyzed within a few minutes. The complete protocol can be read and executed in approximately 1 h.

Gapped sequence alignment using artificial neural networks: application to the MHC class I system

DEFF Research Database (Denmark)

Andreatta, Massimo; Nielsen, Morten

2016-01-01

. On this relatively simple system, we developed a sequence alignment method based on artificial neural networks that allows insertions and deletions in the alignment. Results: We show that prediction methods based on alignments that include insertions and deletions have significantly higher performance than methods...... trained on peptides of single lengths. Also, we illustrate how the location of deletions can aid the interpretation of the modes of binding of the peptide-MHC, as in the case of long peptides bulging out of the MHC groove or protruding at either terminus. Finally, we demonstrate that the method can learn...... the length profile of different MHC molecules, and quantified the reduction of the experimental effort required to identify potential epitopes using our prediction algorithm. Availability and implementation: The NetMHC-4.0 method for the prediction of peptide-MHC class I binding affinity using gapped...

Novel topological descriptors for analyzing biological networks

Directory of Open Access Journals (Sweden)

Varmuza Kurt K

2010-06-01

Full Text Available Abstract Background Topological descriptors, other graph measures, and in a broader sense, graph-theoretical methods, have been proven as powerful tools to perform biological network analysis. However, the majority of the developed descriptors and graph-theoretical methods does not have the ability to take vertex- and edge-labels into account, e.g., atom- and bond-types when considering molecular graphs. Indeed, this feature is important to characterize biological networks more meaningfully instead of only considering pure topological information. Results In this paper, we put the emphasis on analyzing a special type of biological networks, namely bio-chemical structures. First, we derive entropic measures to calculate the information content of vertex- and edge-labeled graphs and investigate some useful properties thereof. Second, we apply the mentioned measures combined with other well-known descriptors to supervised machine learning methods for predicting Ames mutagenicity. Moreover, we investigate the influence of our topological descriptors - measures for only unlabeled vs. measures for labeled graphs - on the prediction performance of the underlying graph classification problem. Conclusions Our study demonstrates that the application of entropic measures to molecules representing graphs is useful to characterize such structures meaningfully. For instance, we have found that if one extends the measures for determining the structural information content of unlabeled graphs to labeled graphs, the uniqueness of the resulting indices is higher. Because measures to structurally characterize labeled graphs are clearly underrepresented so far, the further development of such methods might be valuable and fruitful for solving problems within biological network analysis.

Towards the understanding of network information processing in biology

Science.gov (United States)

Singh, Vijay

Living organisms perform incredibly well in detecting a signal present in the environment. This information processing is achieved near optimally and quite reliably, even though the sources of signals are highly variable and complex. The work in the last few decades has given us a fair understanding of how individual signal processing units like neurons and cell receptors process signals, but the principles of collective information processing on biological networks are far from clear. Information processing in biological networks, like the brain, metabolic circuits, cellular-signaling circuits, etc., involves complex interactions among a large number of units (neurons, receptors). The combinatorially large number of states such a system can exist in makes it impossible to study these systems from the first principles, starting from the interactions between the basic units. The principles of collective information processing on such complex networks can be identified using coarse graining approaches. This could provide insights into the organization and function of complex biological networks. Here I study models of biological networks using continuum dynamics, renormalization, maximum likelihood estimation and information theory. Such coarse graining approaches identify features that are essential for certain processes performed by underlying biological networks. We find that long-range connections in the brain allow for global scale feature detection in a signal. These also suppress the noise and remove any gaps present in the signal. Hierarchical organization with long-range connections leads to large-scale connectivity at low synapse numbers. Time delays can be utilized to separate a mixture of signals with temporal scales. Our observations indicate that the rules in multivariate signal processing are quite different from traditional single unit signal processing.

Social network size relates to developmental neural sensitivity to biological motion

Directory of Open Access Journals (Sweden)

L.A. Kirby

2018-04-01

Full Text Available The ability to perceive others’ actions and goals from human motion (i.e., biological motion perception is a critical component of social perception and may be linked to the development of real-world social relationships. Adult research demonstrates two key nodes of the brain’s biological motion perception system—amygdala and posterior superior temporal sulcus (pSTS—are linked to variability in social network properties. The relation between social perception and social network properties, however, has not yet been investigated in middle childhood—a time when individual differences in social experiences and social perception are growing. The aims of this study were to (1 replicate past work showing amygdala and pSTS sensitivity to biological motion in middle childhood; (2 examine age-related changes in the neural sensitivity for biological motion, and (3 determine whether neural sensitivity for biological motion relates to social network characteristics in children. Consistent with past work, we demonstrate a significant relation between social network size and neural sensitivity for biological motion in left pSTS, but do not find age-related change in biological motion perception. This finding offers evidence for the interplay between real-world social experiences and functional brain development and has important implications for understanding disorders of atypical social experience. Keywords: Biological motion, Social networks, Middle childhood, Neural specialization, Brain-behavior relations, pSTS

Discriminative topological features reveal biological network mechanisms

Directory of Open Access Journals (Sweden)

Levovitz Chaya

2004-11-01

Full Text Available Abstract Background Recent genomic and bioinformatic advances have motivated the development of numerous network models intending to describe graphs of biological, technological, and sociological origin. In most cases the success of a model has been evaluated by how well it reproduces a few key features of the real-world data, such as degree distributions, mean geodesic lengths, and clustering coefficients. Often pairs of models can reproduce these features with indistinguishable fidelity despite being generated by vastly different mechanisms. In such cases, these few target features are insufficient to distinguish which of the different models best describes real world networks of interest; moreover, it is not clear a priori that any of the presently-existing algorithms for network generation offers a predictive description of the networks inspiring them. Results We present a method to assess systematically which of a set of proposed network generation algorithms gives the most accurate description of a given biological network. To derive discriminative classifiers, we construct a mapping from the set of all graphs to a high-dimensional (in principle infinite-dimensional "word space". This map defines an input space for classification schemes which allow us to state unambiguously which models are most descriptive of a given network of interest. Our training sets include networks generated from 17 models either drawn from the literature or introduced in this work. We show that different duplication-mutation schemes best describe the E. coli genetic network, the S. cerevisiae protein interaction network, and the C. elegans neuronal network, out of a set of network models including a linear preferential attachment model and a small-world model. Conclusions Our method is a first step towards systematizing network models and assessing their predictability, and we anticipate its usefulness for a number of communities.

On the origin of distribution patterns of motifs in biological networks

Directory of Open Access Journals (Sweden)

Lesk Arthur M

2008-08-01

Full Text Available Abstract Background Inventories of small subgraphs in biological networks have identified commonly-recurring patterns, called motifs. The inference that these motifs have been selected for function rests on the idea that their occurrences are significantly more frequent than random. Results Our analysis of several large biological networks suggests, in contrast, that the frequencies of appearance of common subgraphs are similar in natural and corresponding random networks. Conclusion Indeed, certain topological features of biological networks give rise naturally to the common appearance of the motifs. We therefore question whether frequencies of occurrences are reasonable evidence that the structures of motifs have been selected for their functional contribution to the operation of networks.

Continuum Modeling of Biological Network Formation

KAUST Repository

Albi, Giacomo; Burger, Martin; Haskovec, Jan; Markowich, Peter A.; Schlottbom, Matthias

2017-01-01

We present an overview of recent analytical and numerical results for the elliptic–parabolic system of partial differential equations proposed by Hu and Cai, which models the formation of biological transportation networks. The model describes

Network science of biological systems at different scales: A review

Science.gov (United States)

Gosak, Marko; Markovič, Rene; Dolenšek, Jurij; Slak Rupnik, Marjan; Marhl, Marko; Stožer, Andraž; Perc, Matjaž

2018-03-01

Network science is today established as a backbone for description of structure and function of various physical, chemical, biological, technological, and social systems. Here we review recent advances in the study of complex biological systems that were inspired and enabled by methods of network science. First, we present

High-accuracy local positioning network for the alignment of the Mu2e experiment.

Energy Technology Data Exchange (ETDEWEB)

Hejdukova, Jana B. [Czech Technical Univ., Prague (Czech Republic)

2017-06-01

This Diploma thesis describes the establishment of a high-precision local positioning network and accelerator alignment for the Mu2e physics experiment. The process of establishing new network consists of few steps: design of the network, pre-analysis, installation works, measurements of the network and making adjustments. Adjustments were performed using two approaches. First is a geodetic approach of taking into account the Earth’s curvature and the metrological approach of a pure 3D Cartesian system on the other side. The comparison of those two approaches is performed and evaluated in the results and compared with expected differences. The effect of the Earth’s curvature was found to be significant for this kind of network and should not be neglected. The measurements were obtained with Absolute Tracker AT401, leveling instrument Leica DNA03 and gyrotheodolite DMT Gyromat 2000. The coordinates of the points of the reference network were determined by the Least Square Meth od and the overall view is attached as Annexes.

Alignment for CSR

International Nuclear Information System (INIS)

Wang Shoujin; Man Kaidi; Guo Yizhen; Cai Guozhu; Guo Yuhui

2002-01-01

Cooled Storage Ring of Heavy Ion Research Facility in Lanzhou (HIRFL-CSR) belongs to China great scientific project in China. The alignment for it is very difficult because of very large area and very high accuracy. For the special case in HIRFL-CSR, some new methods and new instruments are used, including the construction of survey control network, the usage of laser tracker, and CSR alignment database system with applications developed to store and analyze data. The author describes the whole procedure of CSR alignment

Dense module enumeration in biological networks

Science.gov (United States)

Tsuda, Koji; Georgii, Elisabeth

2009-12-01

Analysis of large networks is a central topic in various research fields including biology, sociology, and web mining. Detection of dense modules (a.k.a. clusters) is an important step to analyze the networks. Though numerous methods have been proposed to this aim, they often lack mathematical rigorousness. Namely, there is no guarantee that all dense modules are detected. Here, we present a novel reverse-search-based method for enumerating all dense modules. Furthermore, constraints from additional data sources such as gene expression profiles or customer profiles can be integrated, so that we can systematically detect dense modules with interesting profiles. We report successful applications in human protein interaction network analyses.

Dense module enumeration in biological networks

International Nuclear Information System (INIS)

Tsuda, Koji; Georgii, Elisabeth

2009-01-01

Analysis of large networks is a central topic in various research fields including biology, sociology, and web mining. Detection of dense modules (a.k.a. clusters) is an important step to analyze the networks. Though numerous methods have been proposed to this aim, they often lack mathematical rigorousness. Namely, there is no guarantee that all dense modules are detected. Here, we present a novel reverse-search-based method for enumerating all dense modules. Furthermore, constraints from additional data sources such as gene expression profiles or customer profiles can be integrated, so that we can systematically detect dense modules with interesting profiles. We report successful applications in human protein interaction network analyses.

Propagating semantic information in biochemical network models

Directory of Open Access Journals (Sweden)

Schulz Marvin

2012-01-01

Full Text Available Abstract Background To enable automatic searches, alignments, and model combination, the elements of systems biology models need to be compared and matched across models. Elements can be identified by machine-readable biological annotations, but assigning such annotations and matching non-annotated elements is tedious work and calls for automation. Results A new method called "semantic propagation" allows the comparison of model elements based not only on their own annotations, but also on annotations of surrounding elements in the network. One may either propagate feature vectors, describing the annotations of individual elements, or quantitative similarities between elements from different models. Based on semantic propagation, we align partially annotated models and find annotations for non-annotated model elements. Conclusions Semantic propagation and model alignment are included in the open-source library semanticSBML, available on sourceforge. Online services for model alignment and for annotation prediction can be used at http://www.semanticsbml.org.

Using biological networks to improve our understanding of infectious diseases

Directory of Open Access Journals (Sweden)

Nicola J. Mulder

2014-08-01

Full Text Available Infectious diseases are the leading cause of death, particularly in developing countries. Although many drugs are available for treating the most common infectious diseases, in many cases the mechanism of action of these drugs or even their targets in the pathogen remain unknown. In addition, the key factors or processes in pathogens that facilitate infection and disease progression are often not well understood. Since proteins do not work in isolation, understanding biological systems requires a better understanding of the interconnectivity between proteins in different pathways and processes, which includes both physical and other functional interactions. Such biological networks can be generated within organisms or between organisms sharing a common environment using experimental data and computational predictions. Though different data sources provide different levels of accuracy, confidence in interactions can be measured using interaction scores. Connections between interacting proteins in biological networks can be represented as graphs and edges, and thus studied using existing algorithms and tools from graph theory. There are many different applications of biological networks, and here we discuss three such applications, specifically applied to the infectious disease tuberculosis, with its causative agent Mycobacterium tuberculosis and host, Homo sapiens. The applications include the use of the networks for function prediction, comparison of networks for evolutionary studies, and the generation and use of host–pathogen interaction networks.

Revisiting the variation of clustering coefficient of biological networks suggests new modular structure.

Science.gov (United States)

Hao, Dapeng; Ren, Cong; Li, Chuanxing

2012-05-01

A central idea in biology is the hierarchical organization of cellular processes. A commonly used method to identify the hierarchical modular organization of network relies on detecting a global signature known as variation of clustering coefficient (so-called modularity scaling). Although several studies have suggested other possible origins of this signature, it is still widely used nowadays to identify hierarchical modularity, especially in the analysis of biological networks. Therefore, a further and systematical investigation of this signature for different types of biological networks is necessary. We analyzed a variety of biological networks and found that the commonly used signature of hierarchical modularity is actually the reflection of spoke-like topology, suggesting a different view of network architecture. We proved that the existence of super-hubs is the origin that the clustering coefficient of a node follows a particular scaling law with degree k in metabolic networks. To study the modularity of biological networks, we systematically investigated the relationship between repulsion of hubs and variation of clustering coefficient. We provided direct evidences for repulsion between hubs being the underlying origin of the variation of clustering coefficient, and found that for biological networks having no anti-correlation between hubs, such as gene co-expression network, the clustering coefficient doesn't show dependence of degree. Here we have shown that the variation of clustering coefficient is neither sufficient nor exclusive for a network to be hierarchical. Our results suggest the existence of spoke-like modules as opposed to "deterministic model" of hierarchical modularity, and suggest the need to reconsider the organizational principle of biological hierarchy.

Computational modeling for prediction of the shear stress of three-dimensional isotropic and aligned fiber networks.

Science.gov (United States)

Park, Seungman

2017-09-01

Interstitial flow (IF) is a creeping flow through the interstitial space of the extracellular matrix (ECM). IF plays a key role in diverse biological functions, such as tissue homeostasis, cell function and behavior. Currently, most studies that have characterized IF have focused on the permeability of ECM or shear stress distribution on the cells, but less is known about the prediction of shear stress on the individual fibers or fiber networks despite its significance in the alignment of matrix fibers and cells observed in fibrotic or wound tissues. In this study, I developed a computational model to predict shear stress for different structured fibrous networks. To generate isotropic models, a random growth algorithm and a second-order orientation tensor were employed. Then, a three-dimensional (3D) solid model was created using computer-aided design (CAD) software for the aligned models (i.e., parallel, perpendicular and cubic models). Subsequently, a tetrahedral unstructured mesh was generated and flow solutions were calculated by solving equations for mass and momentum conservation for all models. Through the flow solutions, I estimated permeability using Darcy's law. Average shear stress (ASS) on the fibers was calculated by averaging the wall shear stress of the fibers. By using nonlinear surface fitting of permeability, viscosity, velocity, porosity and ASS, I devised new computational models. Overall, the developed models showed that higher porosity induced higher permeability, as previous empirical and theoretical models have shown. For comparison of the permeability, the present computational models were matched well with previous models, which justify our computational approach. ASS tended to increase linearly with respect to inlet velocity and dynamic viscosity, whereas permeability was almost the same. Finally, the developed model nicely predicted the ASS values that had been directly estimated from computational fluid dynamics (CFD). The present

Exploitation of complex network topology for link prediction in biological interactomes

KAUST Repository

Alanis Lobato, Gregorio

2014-06-01

The network representation of the interactions between proteins and genes allows for a holistic perspective of the complex machinery underlying the living cell. However, the large number of interacting entities within the cell makes network construction a daunting and arduous task, prone to errors and missing information. Fortunately, the structure of biological networks is not different from that of other complex systems, such as social networks, the world-wide web or power grids, for which growth models have been proposed to better understand their structure and function. This means that we can design tools based on these models in order to exploit the topology of biological interactomes with the aim to construct more complete and reliable maps of the cell. In this work, we propose three novel and powerful approaches for the prediction of interactions in biological networks and conclude that it is possible to mine the topology of these complex system representations and produce reliable and biologically meaningful information that enriches the datasets to which we have access today.

Social traits, social networks and evolutionary biology.

Science.gov (United States)

Fisher, D N; McAdam, A G

2017-12-01

effects) provides the potential to understand how entire networks of social interactions in populations influence phenotypes and predict how these traits may evolve. By theoretical integration of social network analysis and quantitative genetics, we hope to identify areas of compatibility and incompatibility and to direct research efforts towards the most promising areas. Continuing this synthesis could provide important insights into the evolution of traits expressed in a social context and the evolutionary consequences of complex and nuanced social phenotypes. © 2017 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2017 European Society For Evolutionary Biology.

Spatiotemporal network motif reveals the biological traits of developmental gene regulatory networks in Drosophila melanogaster

Directory of Open Access Journals (Sweden)

Kim Man-Sun

2012-05-01

Full Text Available Abstract Background Network motifs provided a “conceptual tool” for understanding the functional principles of biological networks, but such motifs have primarily been used to consider static network structures. Static networks, however, cannot be used to reveal time- and region-specific traits of biological systems. To overcome this limitation, we proposed the concept of a “spatiotemporal network motif,” a spatiotemporal sequence of network motifs of sub-networks which are active only at specific time points and body parts. Results On the basis of this concept, we analyzed the developmental gene regulatory network of the Drosophila melanogaster embryo. We identified spatiotemporal network motifs and investigated their distribution pattern in time and space. As a result, we found how key developmental processes are temporally and spatially regulated by the gene network. In particular, we found that nested feedback loops appeared frequently throughout the entire developmental process. From mathematical simulations, we found that mutual inhibition in the nested feedback loops contributes to the formation of spatial expression patterns. Conclusions Taken together, the proposed concept and the simulations can be used to unravel the design principle of developmental gene regulatory networks.

PyPathway: Python Package for Biological Network Analysis and Visualization.

Science.gov (United States)

Xu, Yang; Luo, Xiao-Chun

2018-05-01

Life science studies represent one of the biggest generators of large data sets, mainly because of rapid sequencing technological advances. Biological networks including interactive networks and human curated pathways are essential to understand these high-throughput data sets. Biological network analysis offers a method to explore systematically not only the molecular complexity of a particular disease but also the molecular relationships among apparently distinct phenotypes. Currently, several packages for Python community have been developed, such as BioPython and Goatools. However, tools to perform comprehensive network analysis and visualization are still needed. Here, we have developed PyPathway, an extensible free and open source Python package for functional enrichment analysis, network modeling, and network visualization. The network process module supports various interaction network and pathway databases such as Reactome, WikiPathway, STRING, and BioGRID. The network analysis module implements overrepresentation analysis, gene set enrichment analysis, network-based enrichment, and de novo network modeling. Finally, the visualization and data publishing modules enable users to share their analysis by using an easy web application. For package availability, see the first Reference.

Revisiting the variation of clustering coefficient of biological networks suggests new modular structure

Directory of Open Access Journals (Sweden)

Hao Dapeng

2012-05-01

Full Text Available Abstract Background A central idea in biology is the hierarchical organization of cellular processes. A commonly used method to identify the hierarchical modular organization of network relies on detecting a global signature known as variation of clustering coefficient (so-called modularity scaling. Although several studies have suggested other possible origins of this signature, it is still widely used nowadays to identify hierarchical modularity, especially in the analysis of biological networks. Therefore, a further and systematical investigation of this signature for different types of biological networks is necessary. Results We analyzed a variety of biological networks and found that the commonly used signature of hierarchical modularity is actually the reflection of spoke-like topology, suggesting a different view of network architecture. We proved that the existence of super-hubs is the origin that the clustering coefficient of a node follows a particular scaling law with degree k in metabolic networks. To study the modularity of biological networks, we systematically investigated the relationship between repulsion of hubs and variation of clustering coefficient. We provided direct evidences for repulsion between hubs being the underlying origin of the variation of clustering coefficient, and found that for biological networks having no anti-correlation between hubs, such as gene co-expression network, the clustering coefficient doesn’t show dependence of degree. Conclusions Here we have shown that the variation of clustering coefficient is neither sufficient nor exclusive for a network to be hierarchical. Our results suggest the existence of spoke-like modules as opposed to “deterministic model” of hierarchical modularity, and suggest the need to reconsider the organizational principle of biological hierarchy.

Epigenetics and Why Biological Networks are More Controllable than Expected

Science.gov (United States)

Motter, Adilson

2013-03-01

A fundamental property of networks is that perturbations to one node can affect other nodes, potentially causing the entire system to change behavior or fail. In this talk, I will show that it is possible to exploit this same principle to control network behavior. This approach takes advantage of the nonlinear dynamics inherent to real networks, and allows bringing the system to a desired target state even when this state is not directly accessible or the linear counterpart is not controllable. Applications show that this framework permits both reprogramming a network to a desired task as well as rescuing networks from the brink of failure, which I will illustrate through various biological problems. I will also briefly review the progress our group has made over the past 5 years on related control of complex networks in non-biological domains.

ABS: Sequence alignment by scanning

KAUST Repository

Bonny, Mohamed Talal; Salama, Khaled N.

2011-01-01

Sequence alignment is an essential tool in almost any computational biology research. It processes large database sequences and considered to be high consumers of computation time. Heuristic algorithms are used to get approximate but fast results. We introduce fast alignment algorithm, called Alignment By Scanning (ABS), to provide an approximate alignment of two DNA sequences. We compare our algorithm with the well-known alignment algorithms, the FASTA (which is heuristic) and the 'Needleman-Wunsch' (which is optimal). The proposed algorithm achieves up to 76% enhancement in alignment score when it is compared with the FASTA Algorithm. The evaluations are conducted using different lengths of DNA sequences. © 2011 IEEE.

ABS: Sequence alignment by scanning

KAUST Repository

Bonny, Mohamed Talal

2011-08-01

Sequence alignment is an essential tool in almost any computational biology research. It processes large database sequences and considered to be high consumers of computation time. Heuristic algorithms are used to get approximate but fast results. We introduce fast alignment algorithm, called Alignment By Scanning (ABS), to provide an approximate alignment of two DNA sequences. We compare our algorithm with the well-known alignment algorithms, the FASTA (which is heuristic) and the \\'Needleman-Wunsch\\' (which is optimal). The proposed algorithm achieves up to 76% enhancement in alignment score when it is compared with the FASTA Algorithm. The evaluations are conducted using different lengths of DNA sequences. © 2011 IEEE.

Analysis and logical modeling of biological signaling transduction networks

Science.gov (United States)

Sun, Zhongyao

The study of network theory and its application span across a multitude of seemingly disparate fields of science and technology: computer science, biology, social science, linguistics, etc. It is the intrinsic similarities embedded in the entities and the way they interact with one another in these systems that link them together. In this dissertation, I present from both the aspect of theoretical analysis and the aspect of application three projects, which primarily focus on signal transduction networks in biology. In these projects, I assembled a network model through extensively perusing literature, performed model-based simulations and validation, analyzed network topology, and proposed a novel network measure. The application of network modeling to the system of stomatal opening in plants revealed a fundamental question about the process that has been left unanswered in decades. The novel measure of the redundancy of signal transduction networks with Boolean dynamics by calculating its maximum node-independent elementary signaling mode set accurately predicts the effect of single node knockout in such signaling processes. The three projects as an organic whole advance the understanding of a real system as well as the behavior of such network models, giving me an opportunity to take a glimpse at the dazzling facets of the immense world of network science.

Two classes of bipartite networks: nested biological and social systems.

Science.gov (United States)

Burgos, Enrique; Ceva, Horacio; Hernández, Laura; Perazzo, R P J; Devoto, Mariano; Medan, Diego

2008-10-01

Bipartite graphs have received some attention in the study of social networks and of biological mutualistic systems. A generalization of a previous model is presented, that evolves the topology of the graph in order to optimally account for a given contact preference rule between the two guilds of the network. As a result, social and biological graphs are classified as belonging to two clearly different classes. Projected graphs, linking the agents of only one guild, are obtained from the original bipartite graph. The corresponding evolution of its statistical properties is also studied. An example of a biological mutualistic network is analyzed in detail, and it is found that the model provides a very good fitting of all the main statistical features. The model also provides a proper qualitative description of the same features observed in social webs, suggesting the possible reasons underlying the difference in the organization of these two kinds of bipartite networks.

Bayesian Network Webserver: a comprehensive tool for biological network modeling.

Science.gov (United States)

Ziebarth, Jesse D; Bhattacharya, Anindya; Cui, Yan

2013-11-01

The Bayesian Network Webserver (BNW) is a platform for comprehensive network modeling of systems genetics and other biological datasets. It allows users to quickly and seamlessly upload a dataset, learn the structure of the network model that best explains the data and use the model to understand relationships between network variables. Many datasets, including those used to create genetic network models, contain both discrete (e.g. genotype) and continuous (e.g. gene expression traits) variables, and BNW allows for modeling hybrid datasets. Users of BNW can incorporate prior knowledge during structure learning through an easy-to-use structural constraint interface. After structure learning, users are immediately presented with an interactive network model, which can be used to make testable hypotheses about network relationships. BNW, including a downloadable structure learning package, is available at http://compbio.uthsc.edu/BNW. (The BNW interface for adding structural constraints uses HTML5 features that are not supported by current version of Internet Explorer. We suggest using other browsers (e.g. Google Chrome or Mozilla Firefox) when accessing BNW). ycui2@uthsc.edu. Supplementary data are available at Bioinformatics online.

Nonlinear signaling on biological networks: The role of stochasticity and spectral clustering

Science.gov (United States)

Hernandez-Hernandez, Gonzalo; Myers, Jesse; Alvarez-Lacalle, Enrique; Shiferaw, Yohannes

2017-03-01

Signal transduction within biological cells is governed by networks of interacting proteins. Communication between these proteins is mediated by signaling molecules which bind to receptors and induce stochastic transitions between different conformational states. Signaling is typically a cooperative process which requires the occurrence of multiple binding events so that reaction rates have a nonlinear dependence on the amount of signaling molecule. It is this nonlinearity that endows biological signaling networks with robust switchlike properties which are critical to their biological function. In this study we investigate how the properties of these signaling systems depend on the network architecture. Our main result is that these nonlinear networks exhibit bistability where the network activity can switch between states that correspond to a low and high activity level. We show that this bistable regime emerges at a critical coupling strength that is determined by the spectral structure of the network. In particular, the set of nodes that correspond to large components of the leading eigenvector of the adjacency matrix determines the onset of bistability. Above this transition the eigenvectors of the adjacency matrix determine a hierarchy of clusters, defined by its spectral properties, which are activated sequentially with increasing network activity. We argue further that the onset of bistability occurs either continuously or discontinuously depending upon whether the leading eigenvector is localized or delocalized. Finally, we show that at low network coupling stochastic transitions to the active branch are also driven by the set of nodes that contribute more strongly to the leading eigenvector. However, at high coupling, transitions are insensitive to network structure since the network can be activated by stochastic transitions of a few nodes. Thus this work identifies important features of biological signaling networks that may underlie their biological

Evolution of biological sequences implies an extreme value distribution of type I for both global and local pairwise alignment scores.

Science.gov (United States)

Bastien, Olivier; Maréchal, Eric

2008-08-07

Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic data. Two statistical models have been proposed. In the asymptotic limit of long sequences, the Karlin-Altschul model is based on the computation of a P-value, assuming that the number of high scoring matching regions above a threshold is Poisson distributed. Alternatively, the Lipman-Pearson model is based on the computation of a Z-value from a random score distribution obtained by a Monte-Carlo simulation. Z-values allow the deduction of an upper bound of the P-value (1/Z-value2) following the TULIP theorem. Simulations of Z-value distribution is known to fit with a Gumbel law. This remarkable property was not demonstrated and had no obvious biological support. We built a model of evolution of sequences based on aging, as meant in Reliability Theory, using the fact that the amount of information shared between an initial sequence and the sequences in its lineage (i.e., mutual information in Information Theory) is a decreasing function of time. This quantity is simply measured by a sequence alignment score. In systems aging, the failure rate is related to the systems longevity. The system can be a machine with structured components, or a living entity or population. "Reliability" refers to the ability to operate properly according to a standard. Here, the "reliability" of a sequence refers to the ability to conserve a sufficient functional level at the folded and maturated protein level (positive selection pressure). Homologous sequences were considered as systems 1) having a high redundancy of information reflected by the magnitude of their alignment scores, 2) which components are the amino acids that can independently be damaged by random DNA mutations. From these assumptions, we deduced that information shared at each amino acid position evolved with a constant rate, corresponding to the

CytoCluster: A Cytoscape Plugin for Cluster Analysis and Visualization of Biological Networks.

Science.gov (United States)

Li, Min; Li, Dongyan; Tang, Yu; Wu, Fangxiang; Wang, Jianxin

2017-08-31

Nowadays, cluster analysis of biological networks has become one of the most important approaches to identifying functional modules as well as predicting protein complexes and network biomarkers. Furthermore, the visualization of clustering results is crucial to display the structure of biological networks. Here we present CytoCluster, a cytoscape plugin integrating six clustering algorithms, HC-PIN (Hierarchical Clustering algorithm in Protein Interaction Networks), OH-PIN (identifying Overlapping and Hierarchical modules in Protein Interaction Networks), IPCA (Identifying Protein Complex Algorithm), ClusterONE (Clustering with Overlapping Neighborhood Expansion), DCU (Detecting Complexes based on Uncertain graph model), IPC-MCE (Identifying Protein Complexes based on Maximal Complex Extension), and BinGO (the Biological networks Gene Ontology) function. Users can select different clustering algorithms according to their requirements. The main function of these six clustering algorithms is to detect protein complexes or functional modules. In addition, BinGO is used to determine which Gene Ontology (GO) categories are statistically overrepresented in a set of genes or a subgraph of a biological network. CytoCluster can be easily expanded, so that more clustering algorithms and functions can be added to this plugin. Since it was created in July 2013, CytoCluster has been downloaded more than 9700 times in the Cytoscape App store and has already been applied to the analysis of different biological networks. CytoCluster is available from http://apps.cytoscape.org/apps/cytocluster.

Local and global control of ecological and biological networks

OpenAIRE

Alessandro Ferrarini

2014-01-01

Recently, I introduced a methodological framework so that ecological and biological networks can be controlled both from inside and outside by coupling network dynamics and evolutionary modelling. The endogenous control requires the network to be optimized at the beginning of its dynamics (by acting upon nodes, edges or both) so that it will then go inertially to the desired state. Instead, the exogenous control requires that exogenous controllers act upon the network at each time step. By th...

Things fall apart: biological species form unconnected parsimony networks.

Science.gov (United States)

Hart, Michael W; Sunday, Jennifer

2007-10-22

The generality of operational species definitions is limited by problematic definitions of between-species divergence. A recent phylogenetic species concept based on a simple objective measure of statistically significant genetic differentiation uses between-species application of statistical parsimony networks that are typically used for population genetic analysis within species. Here we review recent phylogeographic studies and reanalyse several mtDNA barcoding studies using this method. We found that (i) alignments of DNA sequences typically fall apart into a separate subnetwork for each Linnean species (but with a higher rate of true positives for mtDNA data) and (ii) DNA sequences from single species typically stick together in a single haplotype network. Departures from these patterns are usually consistent with hybridization or cryptic species diversity.

Functional Module Analysis for Gene Coexpression Networks with Network Integration.

Science.gov (United States)

Zhang, Shuqin; Zhao, Hongyu; Ng, Michael K

2015-01-01

Network has been a general tool for studying the complex interactions between different genes, proteins, and other small molecules. Module as a fundamental property of many biological networks has been widely studied and many computational methods have been proposed to identify the modules in an individual network. However, in many cases, a single network is insufficient for module analysis due to the noise in the data or the tuning of parameters when building the biological network. The availability of a large amount of biological networks makes network integration study possible. By integrating such networks, more informative modules for some specific disease can be derived from the networks constructed from different tissues, and consistent factors for different diseases can be inferred. In this paper, we have developed an effective method for module identification from multiple networks under different conditions. The problem is formulated as an optimization model, which combines the module identification in each individual network and alignment of the modules from different networks together. An approximation algorithm based on eigenvector computation is proposed. Our method outperforms the existing methods, especially when the underlying modules in multiple networks are different in simulation studies. We also applied our method to two groups of gene coexpression networks for humans, which include one for three different cancers, and one for three tissues from the morbidly obese patients. We identified 13 modules with three complete subgraphs, and 11 modules with two complete subgraphs, respectively. The modules were validated through Gene Ontology enrichment and KEGG pathway enrichment analysis. We also showed that the main functions of most modules for the corresponding disease have been addressed by other researchers, which may provide the theoretical basis for further studying the modules experimentally.

Quantifying the connectivity of scale-free and biological networks

Energy Technology Data Exchange (ETDEWEB)

Shiner, J.S. E-mail: shiner@alumni.duke.edu; Davison, Matt E-mail: mdavison@uwo.ca

2004-07-01

Scale-free and biological networks follow a power law distribution p{sub k}{proportional_to}k{sup -{alpha}} for the probability that a node is connected to k other nodes; the corresponding ranges for {alpha} (biological: 1<{alpha}<2; scale-free: 2<{alpha}{<=}3) yield a diverging variance for the connectivity k and lack of predictability for the average connectivity. Predictability can be achieved with the Renyi, Tsallis and Landsberg-Vedral extended entropies and corresponding 'disorders' for correctly chosen values of the entropy index q. Escort distributions p{sub k}{proportional_to}k{sup -{alpha}}{sup q} with q>3/{alpha} also yield a nondiverging variance and predictability. It is argued that the Tsallis entropies may be the appropriate quantities for the study of scale-free and biological networks.

Tevatron alignment issues 2003-2004

International Nuclear Information System (INIS)

Volk, J.T.; Annala, J.; Elementi, L.; Gelfand, N.; Gollwitzer, K.E.; Greenwood, J.; Martens, M.; Moore, C.; Nobrega, A.; Russell, A.D.; Shiltsev, V.; Stefanski, R.; Sager, T.; Syphers, M.J.; Wojcik, G.

2005-01-01

It was observed during the early part of Run II that dipole corrector currents in the Tevatron were changing over time. Measurement of the roll for dipoles and quadrupoles confirmed that there was a slow and systematic movement of the magnets from their ideal position. A simple system using a digital protractor and laptop computer was developed to allow roll measurements of all dipoles and quadrupoles. These measurements showed that many magnets in the Tevatron had rolled more than 1 milliradian. To aid in magnet alignment a new survey network was built in the Tevatron tunnel. This network is based on the use of free centering laser tracker. During the measurement of the network coordinates for all dipole, quadrupole and corrector magnets were obtained. This paper discusses roll measurement techniques and data, the old and new Tevatron alignment network

Ancestral sequence alignment under optimal conditions

Directory of Open Access Journals (Sweden)

Brown Daniel G

2005-11-01

Full Text Available Abstract Background Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multiple alignments. Many popular alignment algorithms for DNA use the sum-of-pairs heuristic, where the score of a multiple alignment is the sum of its induced pairwise alignment scores. However, the biological meaning of the sum-of-pairs of pairs heuristic is not obvious. Additionally, many algorithms based on the sum-of-pairs heuristic are complicated and slow, compared to pairwise alignment algorithms. An alternative approach to aligning alignments is to first infer ancestral sequences for each alignment, and then align the two ancestral sequences. In addition to being fast, this method has a clear biological basis that takes into account the evolution implied by an underlying phylogenetic tree. In this study we explore the accuracy of aligning alignments by ancestral sequence alignment. We examine the use of both maximum likelihood and parsimony to infer ancestral sequences. Additionally, we investigate the effect on accuracy of allowing ambiguity in our ancestral sequences. Results We use synthetic sequence data that we generate by simulating evolution on a phylogenetic tree. We use two different types of phylogenetic trees: trees with a period of rapid growth followed by a period of slow growth, and trees with a period of slow growth followed by a period of rapid growth. We examine the alignment accuracy of four ancestral sequence reconstruction and alignment methods: parsimony, maximum likelihood, ambiguous parsimony, and ambiguous maximum likelihood. Additionally, we compare against the alignment accuracy of two sum-of-pairs algorithms: ClustalW and the heuristic of Ma, Zhang, and Wang. Conclusion We find that allowing ambiguity in ancestral sequences does not lead to better multiple alignments. Regardless of whether we use parsimony or maximum likelihood, the

Metabolic pathway alignment between species using a comprehensive and flexible similarity measure

Directory of Open Access Journals (Sweden)

de Ridder Dick

2008-12-01

Full Text Available Abstract Background Comparative analysis of metabolic networks in multiple species yields important information on their evolution, and has great practical value in metabolic engineering, human disease analysis, drug design etc. In this work, we aim to systematically search for conserved pathways in two species, quantify their similarities, and focus on the variations between them. Results We present an efficient framework, Metabolic Pathway Alignment and Scoring (M-PAS, for identifying and ranking conserved metabolic pathways. M-PAS aligns all reactions in entire metabolic networks of two species and assembles them into pathways, taking mismatches, gaps and crossovers into account. It uses a comprehensive scoring function, which quantifies pathway similarity such that we can focus on different pathways given different biological motivations. Using M-PAS, we detected 1198 length-four pathways fully conserved between Saccharomyces cerevisiae and Escherichia coli, and also revealed 1399 cases of a species using a unique route in otherwise highly conserved pathways. Conclusion Our method efficiently automates the process of exploring reaction arrangement possibilities, both between species and within species, to find conserved pathways. We not only reconstruct conventional pathways such as those found in KEGG, but also discover new pathway possibilities. Our results can help to generate hypotheses on missing reactions and manifest differences in highly conserved pathways, which is useful for biology and life science applications.

Directional Freezing of Nanocellulose Dispersions Aligns the Rod-Like Particles and Produces Low-Density and Robust Particle Networks.

Science.gov (United States)

Munier, Pierre; Gordeyeva, Korneliya; Bergström, Lennart; Fall, Andreas B

2016-05-09

We show that unidirectional freezing of nanocellulose dispersions produces cellular foams with high alignment of the rod-like nanoparticles in the freezing direction. Quantification of the alignment in the long direction of the tubular pores with X-ray diffraction shows high orientation of cellulose nanofibrils (CNF) and cellulose nanocrystals (CNC) at particle concentrations above 0.2 wt % (CNC) and 0.08 wt % (CNF). Aggregation of CNF by pH decrease or addition of salt significantly reduces the particle orientation; in contrast, exceeding the concentration where particles gel by mobility constraints had a relatively small effect on the orientation. The dense nanocellulose network formed by directional freezing was sufficiently strong to resist melting. The formed hydrogels were birefringent and displayed anisotropic laser diffraction patterns, suggesting preserved nanocellulose alignment and cellular structure. Nondirectional freezing of the hydrogels followed by sublimation generates foams with a pore structure and nanocellulose alignment resembling the structure of the initial directional freezing.

Alignment of the UMLS semantic network with BioTop: methodology and assessment.

Science.gov (United States)

Schulz, Stefan; Beisswanger, Elena; van den Hoek, László; Bodenreider, Olivier; van Mulligen, Erik M

2009-06-15

For many years, the Unified Medical Language System (UMLS) semantic network (SN) has been used as an upper-level semantic framework for the categorization of terms from terminological resources in biomedicine. BioTop has recently been developed as an upper-level ontology for the biomedical domain. In contrast to the SN, it is founded upon strict ontological principles, using OWL DL as a formal representation language, which has become standard in the semantic Web. In order to make logic-based reasoning available for the resources annotated or categorized with the SN, a mapping ontology was developed aligning the SN with BioTop. The theoretical foundations and the practical realization of the alignment are being described, with a focus on the design decisions taken, the problems encountered and the adaptations of BioTop that became necessary. For evaluation purposes, UMLS concept pairs obtained from MEDLINE abstracts by a named entity recognition system were tested for possible semantic relationships. Furthermore, all semantic-type combinations that occur in the UMLS Metathesaurus were checked for satisfiability. The effort-intensive alignment process required major design changes and enhancements of BioTop and brought up several design errors that could be fixed. A comparison between a human curator and the ontology yielded only a low agreement. Ontology reasoning was also used to successfully identify 133 inconsistent semantic-type combinations. BioTop, the OWL DL representation of the UMLS SN, and the mapping ontology are available at http://www.purl.org/biotop/.

Alignment of paired molecules of C60 within a hexagonal platform networked through hydrogen-bonds.

Science.gov (United States)

Hisaki, Ichiro; Nakagawa, Shoichi; Sato, Hiroyasu; Tohnai, Norimitsu

2016-07-28

We demonstrate, for the first time, that a hydrogen-bonded low-density organic framework can be applied as a platform to achieve periodic alignment of paired molecules of C60, which is the smallest example of a finite-numbered cluster of C60. The framework is a layered assembly of a hydrogen-bonded 2D hexagonal network (LA-H-HexNet) composed of dodecadehydrotribenzo[18]annulene derivatives.

Network biology concepts in complex disease comorbidities

DEFF Research Database (Denmark)

Hu, Jessica Xin; Thomas, Cecilia Engel; Brunak, Søren

2016-01-01

collected electronically, disease co-occurrences are starting to be quantitatively characterized. Linking network dynamics to the real-life, non-ideal patient in whom diseases co-occur and interact provides a valuable basis for generating hypotheses on molecular disease mechanisms, and provides knowledge......The co-occurrence of diseases can inform the underlying network biology of shared and multifunctional genes and pathways. In addition, comorbidities help to elucidate the effects of external exposures, such as diet, lifestyle and patient care. With worldwide health transaction data now often being...

Dissecting the Molecular Mechanisms of Neurodegenerative Diseases through Network Biology

Directory of Open Access Journals (Sweden)

Jose A. Santiago

2017-05-01

Full Text Available Neurodegenerative diseases are rarely caused by a mutation in a single gene but rather influenced by a combination of genetic, epigenetic and environmental factors. Emerging high-throughput technologies such as RNA sequencing have been instrumental in deciphering the molecular landscape of neurodegenerative diseases, however, the interpretation of such large amounts of data remains a challenge. Network biology has become a powerful platform to integrate multiple omics data to comprehensively explore the molecular networks in the context of health and disease. In this review article, we highlight recent advances in network biology approaches with an emphasis in brain-networks that have provided insights into the molecular mechanisms leading to the most prevalent neurodegenerative diseases including Alzheimer’s (AD, Parkinson’s (PD and Huntington’s diseases (HD. We discuss how integrative approaches using multi-omics data from different tissues have been valuable for identifying biomarkers and therapeutic targets. In addition, we discuss the challenges the field of network medicine faces toward the translation of network-based findings into clinically actionable tools for personalized medicine applications.

Evolution of biological sequences implies an extreme value distribution of type I for both global and local pairwise alignment scores

Directory of Open Access Journals (Sweden)

Maréchal Eric

2008-08-01

Full Text Available Abstract Background Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic data. Two statistical models have been proposed. In the asymptotic limit of long sequences, the Karlin-Altschul model is based on the computation of a P-value, assuming that the number of high scoring matching regions above a threshold is Poisson distributed. Alternatively, the Lipman-Pearson model is based on the computation of a Z-value from a random score distribution obtained by a Monte-Carlo simulation. Z-values allow the deduction of an upper bound of the P-value (1/Z-value2 following the TULIP theorem. Simulations of Z-value distribution is known to fit with a Gumbel law. This remarkable property was not demonstrated and had no obvious biological support. Results We built a model of evolution of sequences based on aging, as meant in Reliability Theory, using the fact that the amount of information shared between an initial sequence and the sequences in its lineage (i.e., mutual information in Information Theory is a decreasing function of time. This quantity is simply measured by a sequence alignment score. In systems aging, the failure rate is related to the systems longevity. The system can be a machine with structured components, or a living entity or population. "Reliability" refers to the ability to operate properly according to a standard. Here, the "reliability" of a sequence refers to the ability to conserve a sufficient functional level at the folded and maturated protein level (positive selection pressure. Homologous sequences were considered as systems 1 having a high redundancy of information reflected by the magnitude of their alignment scores, 2 which components are the amino acids that can independently be damaged by random DNA mutations. From these assumptions, we deduced that information shared at each amino acid position evolved with a

Neural network models: from biology to many - body phenomenology

International Nuclear Information System (INIS)

Clark, J.W.

1993-01-01

Theoretical work in neural networks has a strange feel for most physicists. In some cases the aspect of design becomes paramount. More comfortable ground at least for many body theorists may be found in realistic biological simulation, although the complexity of most problems is so awesome that incisive results will be hard won. It has also shown the impressive capabilities of artificial networks in pattern recognition and classification may be exploited to solve management problems in experimental physics and for discovery of radically new theoretical description of physical systems. This advance represents an important step towards the ultimate goal of neuro biological paradigm. (A.B.)

KeyPathwayMiner - De-novo network enrichment by combining multiple OMICS data and biological networks

DEFF Research Database (Denmark)

Baumbach, Jan; Alcaraz, Nicolas; Pauling, Josch K.

We tackle the problem of de-novo pathway extraction. Given a biological network and a set of case-control studies, KeyPathwayMiner efficiently extracts and visualizes all maximal connected sub-networks that contain mainly genes that are dysregulated, e.g., differentially expressed, in most cases ...

Chinese Herbal Medicine Meets Biological Networks of Complex Diseases: A Computational Perspective

Directory of Open Access Journals (Sweden)

Shuo Gu

2017-01-01

Full Text Available With the rapid development of cheminformatics, computational biology, and systems biology, great progress has been made recently in the computational research of Chinese herbal medicine with in-depth understanding towards pharmacognosy. This paper summarized these studies in the aspects of computational methods, traditional Chinese medicine (TCM compound databases, and TCM network pharmacology. Furthermore, we chose arachidonic acid metabolic network as a case study to demonstrate the regulatory function of herbal medicine in the treatment of inflammation at network level. Finally, a computational workflow for the network-based TCM study, derived from our previous successful applications, was proposed.

Chinese Herbal Medicine Meets Biological Networks of Complex Diseases: A Computational Perspective.

Science.gov (United States)

Gu, Shuo; Pei, Jianfeng

2017-01-01

With the rapid development of cheminformatics, computational biology, and systems biology, great progress has been made recently in the computational research of Chinese herbal medicine with in-depth understanding towards pharmacognosy. This paper summarized these studies in the aspects of computational methods, traditional Chinese medicine (TCM) compound databases, and TCM network pharmacology. Furthermore, we chose arachidonic acid metabolic network as a case study to demonstrate the regulatory function of herbal medicine in the treatment of inflammation at network level. Finally, a computational workflow for the network-based TCM study, derived from our previous successful applications, was proposed.

Cyclic mechanical stretch contributes to network development of osteocyte-like cells with morphological change and autophagy promotion but without preferential cell alignment in rat.

Science.gov (United States)

Inaba, Nao; Kuroshima, Shinichiro; Uto, Yusuke; Sasaki, Muneteru; Sawase, Takashi

2017-09-01

Osteocytes play important roles in controlling bone quality as well as preferential alignment of biological apatite c -axis/collagen fibers. However, the relationship between osteocytes and mechanical stress remains unclear due to the difficulty of three-dimensional (3D) culture of osteocytes in vitro . The aim of this study was to investigate the effect of cyclic mechanical stretch on 3D-cultured osteocyte-like cells. Osteocyte-like cells were established using rat calvarial osteoblasts cultured in a 3D culture system. Cyclic mechanical stretch (8% amplitude at a rate of 2 cycles min -1 ) was applied for 24, 48 and 96 consecutive hours. Morphology, cell number and preferential cell alignment were evaluated. Apoptosis- and autophagy-related gene expression levels were measured using quantitative PCR. 3D-cultured osteoblasts became osteocyte-like cells that expressed osteocyte-specific genes such as Dmp1 , Cx43 , Sost , Fgf23 and RANKL , with morphological changes similar to osteocytes. Cell number was significantly decreased in a time-dependent manner under non-loaded conditions, whereas cyclic mechanical stretch significantly prevented decreased cell numbers with increased expression of anti-apoptosis-related genes. Moreover, cyclic mechanical stretch significantly decreased cell size and ellipticity with increased expression of autophagy-related genes, LC3b and atg7 . Interestingly, preferential cell alignment did not occur, irrespective of mechanical stretch. These findings suggest that an anti-apoptotic effect contributes to network development of osteocyte-like cells under loaded condition. Spherical change of osteocyte-like cells induced by mechanical stretch may be associated with autophagy upregulation. Preferential alignment of osteocytes induced by mechanical load in vivo may be partially predetermined before osteoblasts differentiate into osteocytes and embed into bone matrix.

Multilayer network modeling creates opportunities for novel network statistics. Comment on "Network science of biological systems at different scales: A review" by Gosak et al.

Science.gov (United States)

Muldoon, Sarah Feldt

2018-03-01

As described in the review by Gosak et al., the field of network science has had enormous success in providing new insights into the structure and function of biological systems [1]. In the complex networks framework, system elements are network nodes, and connections between nodes represent some form of interaction between system elements [2]. The flexibility to define network nodes and edges to represent different aspects of biological systems has been employed to model numerous diverse systems at multiple scales.

Continuum Modeling of Biological Network Formation

KAUST Repository

Albi, Giacomo

2017-04-10

We present an overview of recent analytical and numerical results for the elliptic–parabolic system of partial differential equations proposed by Hu and Cai, which models the formation of biological transportation networks. The model describes the pressure field using a Darcy type equation and the dynamics of the conductance network under pressure force effects. Randomness in the material structure is represented by a linear diffusion term and conductance relaxation by an algebraic decay term. We first introduce micro- and mesoscopic models and show how they are connected to the macroscopic PDE system. Then, we provide an overview of analytical results for the PDE model, focusing mainly on the existence of weak and mild solutions and analysis of the steady states. The analytical part is complemented by extensive numerical simulations. We propose a discretization based on finite elements and study the qualitative properties of network structures for various parameter values.

Perturbation Biology: Inferring Signaling Networks in Cellular Systems

Science.gov (United States)

Miller, Martin L.; Gauthier, Nicholas P.; Jing, Xiaohong; Kaushik, Poorvi; He, Qin; Mills, Gordon; Solit, David B.; Pratilas, Christine A.; Weigt, Martin; Braunstein, Alfredo; Pagnani, Andrea; Zecchina, Riccardo; Sander, Chris

2013-01-01

We present a powerful experimental-computational technology for inferring network models that predict the response of cells to perturbations, and that may be useful in the design of combinatorial therapy against cancer. The experiments are systematic series of perturbations of cancer cell lines by targeted drugs, singly or in combination. The response to perturbation is quantified in terms of relative changes in the measured levels of proteins, phospho-proteins and cellular phenotypes such as viability. Computational network models are derived de novo, i.e., without prior knowledge of signaling pathways, and are based on simple non-linear differential equations. The prohibitively large solution space of all possible network models is explored efficiently using a probabilistic algorithm, Belief Propagation (BP), which is three orders of magnitude faster than standard Monte Carlo methods. Explicit executable models are derived for a set of perturbation experiments in SKMEL-133 melanoma cell lines, which are resistant to the therapeutically important inhibitor of RAF kinase. The resulting network models reproduce and extend known pathway biology. They empower potential discoveries of new molecular interactions and predict efficacious novel drug perturbations, such as the inhibition of PLK1, which is verified experimentally. This technology is suitable for application to larger systems in diverse areas of molecular biology. PMID:24367245

A three-dimensional microelectrode array composed of vertically aligned ultra-dense carbon nanotube networks

Science.gov (United States)

Nick, C.; Yadav, S.; Joshi, R.; Schneider, J. J.; Thielemann, C.

2015-07-01

Electrodes based on carbon nanotubes are a promising approach to manufacture highly sensitive sensors with a low limit of signal detection and a high signal-to-noise ratio. This is achieved by dramatically increasing the electrochemical active surface area without increasing the overall geometrical dimensions. Typically, carbon nanotube electrodes are nearly planar and composed of randomly distributed carbon nanotube networks having a limited surface gain for a specific geometrical surface area. To overcome this limitation, we have introduced vertically aligned carbon nanotube (VACNT) networks as electrodes, which are arranged in a microelectrode pattern of 60 single electrodes. Each microelectrode features a very high aspect ratio of more than 300 and thus a dramatically increased surface area. These microelectrodes composed of VACNT networks display dramatically decreased impedance over the entire frequency range compared to planar microelectrodes caused by the enormous capacity increase. This is experimentally verified by electrochemical impedance spectroscopy and cyclic voltammetry.

From biological neural networks to thinking machines: Transitioning biological organizational principles to computer technology

Science.gov (United States)

Ross, Muriel D.

1991-01-01

The three-dimensional organization of the vestibular macula is under study by computer assisted reconstruction and simulation methods as a model for more complex neural systems. One goal of this research is to transition knowledge of biological neural network architecture and functioning to computer technology, to contribute to the development of thinking computers. Maculas are organized as weighted neural networks for parallel distributed processing of information. The network is characterized by non-linearity of its terminal/receptive fields. Wiring appears to develop through constrained randomness. A further property is the presence of two main circuits, highly channeled and distributed modifying, that are connected through feedforward-feedback collaterals and biasing subcircuit. Computer simulations demonstrate that differences in geometry of the feedback (afferent) collaterals affects the timing and the magnitude of voltage changes delivered to the spike initiation zone. Feedforward (efferent) collaterals act as voltage followers and likely inhibit neurons of the distributed modifying circuit. These results illustrate the importance of feedforward-feedback loops, of timing, and of inhibition in refining neural network output. They also suggest that it is the distributed modifying network that is most involved in adaptation, memory, and learning. Tests of macular adaptation, through hyper- and microgravitational studies, support this hypothesis since synapses in the distributed modifying circuit, but not the channeled circuit, are altered. Transitioning knowledge of biological systems to computer technology, however, remains problematical.

Quantitative assessment of biological impact using transcriptomic data and mechanistic network models

International Nuclear Information System (INIS)

Thomson, Ty M.; Sewer, Alain; Martin, Florian; Belcastro, Vincenzo; Frushour, Brian P.; Gebel, Stephan; Park, Jennifer; Schlage, Walter K.; Talikka, Marja; Vasilyev, Dmitry M.; Westra, Jurjen W.; Hoeng, Julia; Peitsch, Manuel C.

2013-01-01

Exposure to biologically active substances such as therapeutic drugs or environmental toxicants can impact biological systems at various levels, affecting individual molecules, signaling pathways, and overall cellular processes. The ability to derive mechanistic insights from the resulting system responses requires the integration of experimental measures with a priori knowledge about the system and the interacting molecules therein. We developed a novel systems biology-based methodology that leverages mechanistic network models and transcriptomic data to quantitatively assess the biological impact of exposures to active substances. Hierarchically organized network models were first constructed to provide a coherent framework for investigating the impact of exposures at the molecular, pathway and process levels. We then validated our methodology using novel and previously published experiments. For both in vitro systems with simple exposure and in vivo systems with complex exposures, our methodology was able to recapitulate known biological responses matching expected or measured phenotypes. In addition, the quantitative results were in agreement with experimental endpoint data for many of the mechanistic effects that were assessed, providing further objective confirmation of the approach. We conclude that our methodology evaluates the biological impact of exposures in an objective, systematic, and quantifiable manner, enabling the computation of a systems-wide and pan-mechanistic biological impact measure for a given active substance or mixture. Our results suggest that various fields of human disease research, from drug development to consumer product testing and environmental impact analysis, could benefit from using this methodology. - Highlights: • The impact of biologically active substances is quantified at multiple levels. • The systems-level impact integrates the perturbations of individual networks. • The networks capture the relationships between

Novel approaches to develop community-built biological network models for potential drug discovery.

Science.gov (United States)

Talikka, Marja; Bukharov, Natalia; Hayes, William S; Hofmann-Apitius, Martin; Alexopoulos, Leonidas; Peitsch, Manuel C; Hoeng, Julia

2017-08-01

Hundreds of thousands of data points are now routinely generated in clinical trials by molecular profiling and NGS technologies. A true translation of this data into knowledge is not possible without analysis and interpretation in a well-defined biology context. Currently, there are many public and commercial pathway tools and network models that can facilitate such analysis. At the same time, insights and knowledge that can be gained is highly dependent on the underlying biological content of these resources. Crowdsourcing can be employed to guarantee the accuracy and transparency of the biological content underlining the tools used to interpret rich molecular data. Areas covered: In this review, the authors describe crowdsourcing in drug discovery. The focal point is the efforts that have successfully used the crowdsourcing approach to verify and augment pathway tools and biological network models. Technologies that enable the building of biological networks with the community are also described. Expert opinion: A crowd of experts can be leveraged for the entire development process of biological network models, from ontologies to the evaluation of their mechanistic completeness. The ultimate goal is to facilitate biomarker discovery and personalized medicine by mechanistically explaining patients' differences with respect to disease prevention, diagnosis, and therapy outcome.

Biologically-inspired Learning in Pulsed Neural Networks

DEFF Research Database (Denmark)

Lehmann, Torsten; Woodburn, Robin

1999-01-01

Self-learning chips to implement many popular ANN (artificial neural network) algorithms are very difficult to design. We explain why this is so and say what lessons previous work teaches us in the design of self-learning systems. We offer a contribution to the `biologically-inspired' approach......, explaining what we mean by this term and providing an example of a robust, self-learning design that can solve simple classical-conditioning tasks. We give details of the design of individual circuits to perform component functions, which can then be combined into a network to solve the task. We argue...

Systems Biology Modeling of the Radiation Sensitivity Network: A Biomarker Discovery Platform

International Nuclear Information System (INIS)

Eschrich, Steven; Zhang Hongling; Zhao Haiyan; Boulware, David; Lee, Ji-Hyun; Bloom, Gregory; Torres-Roca, Javier F.

2009-01-01

Purpose: The discovery of effective biomarkers is a fundamental goal of molecular medicine. Developing a systems-biology understanding of radiosensitivity can enhance our ability of identifying radiation-specific biomarkers. Methods and Materials: Radiosensitivity, as represented by the survival fraction at 2 Gy was modeled in 48 human cancer cell lines. We applied a linear regression algorithm that integrates gene expression with biological variables, including ras status (mut/wt), tissue of origin and p53 status (mut/wt). Results: The biomarker discovery platform is a network representation of the top 500 genes identified by linear regression analysis. This network was reduced to a 10-hub network that includes c-Jun, HDAC1, RELA (p65 subunit of NFKB), PKC-beta, SUMO-1, c-Abl, STAT1, AR, CDK1, and IRF1. Nine targets associated with radiosensitization drugs are linked to the network, demonstrating clinical relevance. Furthermore, the model identified four significant radiosensitivity clusters of terms and genes. Ras was a dominant variable in the analysis, as was the tissue of origin, and their interaction with gene expression but not p53. Overrepresented biological pathways differed between clusters but included DNA repair, cell cycle, apoptosis, and metabolism. The c-Jun network hub was validated using a knockdown approach in 8 human cell lines representing lung, colon, and breast cancers. Conclusion: We have developed a novel radiation-biomarker discovery platform using a systems biology modeling approach. We believe this platform will play a central role in the integration of biology into clinical radiation oncology practice.

Chinese Herbal Medicine Meets Biological Networks of Complex Diseases: A Computational Perspective

OpenAIRE

Shuo Gu; Jianfeng Pei

2017-01-01

With the rapid development of cheminformatics, computational biology, and systems biology, great progress has been made recently in the computational research of Chinese herbal medicine with in-depth understanding towards pharmacognosy. This paper summarized these studies in the aspects of computational methods, traditional Chinese medicine (TCM) compound databases, and TCM network pharmacology. Furthermore, we chose arachidonic acid metabolic network as a case study to demonstrate the regula...

Learning and coding in biological neural networks

Science.gov (United States)

Fiete, Ila Rani

How can large groups of neurons that locally modify their activities learn to collectively perform a desired task? Do studies of learning in small networks tell us anything about learning in the fantastically large collection of neurons that make up a vertebrate brain? What factors do neurons optimize by encoding sensory inputs or motor commands in the way they do? In this thesis I present a collection of four theoretical works: each of the projects was motivated by specific constraints and complexities of biological neural networks, as revealed by experimental studies; together, they aim to partially address some of the central questions of neuroscience posed above. We first study the role of sparse neural activity, as seen in the coding of sequential commands in a premotor area responsible for birdsong. We show that the sparse coding of temporal sequences in the songbird brain can, in a network where the feedforward plastic weights must translate the sparse sequential code into a time-varying muscle code, facilitate learning by minimizing synaptic interference. Next, we propose a biologically plausible synaptic plasticity rule that can perform goal-directed learning in recurrent networks of voltage-based spiking neurons that interact through conductances. Learning is based on the correlation of noisy local activity with a global reward signal; we prove that this rule performs stochastic gradient ascent on the reward. Thus, if the reward signal quantifies network performance on some desired task, the plasticity rule provably drives goal-directed learning in the network. To assess the convergence properties of the learning rule, we compare it with a known example of learning in the brain. Song-learning in finches is a clear example of a learned behavior, with detailed available neurophysiological data. With our learning rule, we train an anatomically accurate model birdsong network that drives a sound source to mimic an actual zebrafinch song. Simulation and

Biana: a software framework for compiling biological interactions and analyzing networks.

Science.gov (United States)

Garcia-Garcia, Javier; Guney, Emre; Aragues, Ramon; Planas-Iglesias, Joan; Oliva, Baldo

2010-01-27

The analysis and usage of biological data is hindered by the spread of information across multiple repositories and the difficulties posed by different nomenclature systems and storage formats. In particular, there is an important need for data unification in the study and use of protein-protein interactions. Without good integration strategies, it is difficult to analyze the whole set of available data and its properties. We introduce BIANA (Biologic Interactions and Network Analysis), a tool for biological information integration and network management. BIANA is a Python framework designed to achieve two major goals: i) the integration of multiple sources of biological information, including biological entities and their relationships, and ii) the management of biological information as a network where entities are nodes and relationships are edges. Moreover, BIANA uses properties of proteins and genes to infer latent biomolecular relationships by transferring edges to entities sharing similar properties. BIANA is also provided as a plugin for Cytoscape, which allows users to visualize and interactively manage the data. A web interface to BIANA providing basic functionalities is also available. The software can be downloaded under GNU GPL license from http://sbi.imim.es/web/BIANA.php. BIANA's approach to data unification solves many of the nomenclature issues common to systems dealing with biological data. BIANA can easily be extended to handle new specific data repositories and new specific data types. The unification protocol allows BIANA to be a flexible tool suitable for different user requirements: non-expert users can use a suggested unification protocol while expert users can define their own specific unification rules.

Sequence alignment visualization in HTML5 without Java.

Science.gov (United States)

Gille, Christoph; Birgit, Weyand; Gille, Andreas

2014-01-01

Java has been extensively used for the visualization of biological data in the web. However, the Java runtime environment is an additional layer of software with an own set of technical problems and security risks. HTML in its new version 5 provides features that for some tasks may render Java unnecessary. Alignment-To-HTML is the first HTML-based interactive visualization for annotated multiple sequence alignments. The server side script interpreter can perform all tasks like (i) sequence retrieval, (ii) alignment computation, (iii) rendering, (iv) identification of a homologous structural models and (v) communication with BioDAS-servers. The rendered alignment can be included in web pages and is displayed in all browsers on all platforms including touch screen tablets. The functionality of the user interface is similar to legacy Java applets and includes color schemes, highlighting of conserved and variable alignment positions, row reordering by drag and drop, interlinked 3D visualization and sequence groups. Novel features are (i) support for multiple overlapping residue annotations, such as chemical modifications, single nucleotide polymorphisms and mutations, (ii) mechanisms to quickly hide residue annotations, (iii) export to MS-Word and (iv) sequence icons. Alignment-To-HTML, the first interactive alignment visualization that runs in web browsers without additional software, confirms that to some extend HTML5 is already sufficient to display complex biological data. The low speed at which programs are executed in browsers is still the main obstacle. Nevertheless, we envision an increased use of HTML and JavaScript for interactive biological software. Under GPL at: http://www.bioinformatics.org/strap/toHTML/.

Bridging the gap between clinicians and systems biologists: from network biology to translational biomedical research.

Science.gov (United States)

Jinawath, Natini; Bunbanjerdsuk, Sacarin; Chayanupatkul, Maneerat; Ngamphaiboon, Nuttapong; Asavapanumas, Nithi; Svasti, Jisnuson; Charoensawan, Varodom

2016-11-22

With the wealth of data accumulated from completely sequenced genomes and other high-throughput experiments, global studies of biological systems, by simultaneously investigating multiple biological entities (e.g. genes, transcripts, proteins), has become a routine. Network representation is frequently used to capture the presence of these molecules as well as their relationship. Network biology has been widely used in molecular biology and genetics, where several network properties have been shown to be functionally important. Here, we discuss how such methodology can be useful to translational biomedical research, where scientists traditionally focus on one or a small set of genes, diseases, and drug candidates at any one time. We first give an overview of network representation frequently used in biology: what nodes and edges represent, and review its application in preclinical research to date. Using cancer as an example, we review how network biology can facilitate system-wide approaches to identify targeted small molecule inhibitors. These types of inhibitors have the potential to be more specific, resulting in high efficacy treatments with less side effects, compared to the conventional treatments such as chemotherapy. Global analysis may provide better insight into the overall picture of human diseases, as well as identify previously overlooked problems, leading to rapid advances in medicine. From the clinicians' point of view, it is necessary to bridge the gap between theoretical network biology and practical biomedical research, in order to improve the diagnosis, prevention, and treatment of the world's major diseases.

An Alignment Model for Collaborative Value Networks

Science.gov (United States)

Bremer, Carlos; Azevedo, Rodrigo Cambiaghi; Klen, Alexandra Pereira

This paper presents parts of the work carried out in several global organizations through the development of strategic projects with high tactical and operational complexity. By investing in long-term relationships, strongly operating in the transformation of the competitive model and focusing on the value chain management, the main aim of these projects was the alignment of multiple value chains. The projects were led by the Axia Transformation Methodology as well as by its Management Model and following the principles of Project Management. As a concrete result of the efforts made in the last years in the Brazilian market this work also introduces the Alignment Model which supports the transformation process that the companies undergo.

A Reconfigurable and Biologically Inspired Paradigm for Computation Using Network-On-Chip and Spiking Neural Networks

Directory of Open Access Journals (Sweden)

Jim Harkin

2009-01-01

Full Text Available FPGA devices have emerged as a popular platform for the rapid prototyping of biological Spiking Neural Networks (SNNs applications, offering the key requirement of reconfigurability. However, FPGAs do not efficiently realise the biologically plausible neuron and synaptic models of SNNs, and current FPGA routing structures cannot accommodate the high levels of interneuron connectivity inherent in complex SNNs. This paper highlights and discusses the current challenges of implementing scalable SNNs on reconfigurable FPGAs. The paper proposes a novel field programmable neural network architecture (EMBRACE, incorporating low-power analogue spiking neurons, interconnected using a Network-on-Chip architecture. Results on the evaluation of the EMBRACE architecture using the XOR benchmark problem are presented, and the performance of the architecture is discussed. The paper also discusses the adaptability of the EMBRACE architecture in supporting fault tolerant computing.

A Systems’ Biology Approach to Study MicroRNA-Mediated Gene Regulatory Networks

Directory of Open Access Journals (Sweden)

Xin Lai

2013-01-01

Full Text Available MicroRNAs (miRNAs are potent effectors in gene regulatory networks where aberrant miRNA expression can contribute to human diseases such as cancer. For a better understanding of the regulatory role of miRNAs in coordinating gene expression, we here present a systems biology approach combining data-driven modeling and model-driven experiments. Such an approach is characterized by an iterative process, including biological data acquisition and integration, network construction, mathematical modeling and experimental validation. To demonstrate the application of this approach, we adopt it to investigate mechanisms of collective repression on p21 by multiple miRNAs. We first construct a p21 regulatory network based on data from the literature and further expand it using algorithms that predict molecular interactions. Based on the network structure, a detailed mechanistic model is established and its parameter values are determined using data. Finally, the calibrated model is used to study the effect of different miRNA expression profiles and cooperative target regulation on p21 expression levels in different biological contexts.

Biological instability in a chlorinated drinking water distribution network.

Science.gov (United States)

Nescerecka, Alina; Rubulis, Janis; Vital, Marius; Juhna, Talis; Hammes, Frederik

2014-01-01

The purpose of a drinking water distribution system is to deliver drinking water to the consumer, preferably with the same quality as when it left the treatment plant. In this context, the maintenance of good microbiological quality is often referred to as biological stability, and the addition of sufficient chlorine residuals is regarded as one way to achieve this. The full-scale drinking water distribution system of Riga (Latvia) was investigated with respect to biological stability in chlorinated drinking water. Flow cytometric (FCM) intact cell concentrations, intracellular adenosine tri-phosphate (ATP), heterotrophic plate counts and residual chlorine measurements were performed to evaluate the drinking water quality and stability at 49 sampling points throughout the distribution network. Cell viability methods were compared and the importance of extracellular ATP measurements was examined as well. FCM intact cell concentrations varied from 5×10(3) cells mL(-1) to 4.66×10(5) cells mL(-1) in the network. While this parameter did not exceed 2.1×10(4) cells mL(-1) in the effluent from any water treatment plant, 50% of all the network samples contained more than 1.06×10(5) cells mL(-1). This indisputably demonstrates biological instability in this particular drinking water distribution system, which was ascribed to a loss of disinfectant residuals and concomitant bacterial growth. The study highlights the potential of using cultivation-independent methods for the assessment of chlorinated water samples. In addition, it underlines the complexity of full-scale drinking water distribution systems, and the resulting challenges to establish the causes of biological instability.

NAP: The Network Analysis Profiler, a web tool for easier topological analysis and comparison of medium-scale biological networks.

Science.gov (United States)

Theodosiou, Theodosios; Efstathiou, Georgios; Papanikolaou, Nikolas; Kyrpides, Nikos C; Bagos, Pantelis G; Iliopoulos, Ioannis; Pavlopoulos, Georgios A

2017-07-14

Nowadays, due to the technological advances of high-throughput techniques, Systems Biology has seen a tremendous growth of data generation. With network analysis, looking at biological systems at a higher level in order to better understand a system, its topology and the relationships between its components is of a great importance. Gene expression, signal transduction, protein/chemical interactions, biomedical literature co-occurrences, are few of the examples captured in biological network representations where nodes represent certain bioentities and edges represent the connections between them. Today, many tools for network visualization and analysis are available. Nevertheless, most of them are standalone applications that often (i) burden users with computing and calculation time depending on the network's size and (ii) focus on handling, editing and exploring a network interactively. While such functionality is of great importance, limited efforts have been made towards the comparison of the topological analysis of multiple networks. Network Analysis Provider (NAP) is a comprehensive web tool to automate network profiling and intra/inter-network topology comparison. It is designed to bridge the gap between network analysis, statistics, graph theory and partially visualization in a user-friendly way. It is freely available and aims to become a very appealing tool for the broader community. It hosts a great plethora of topological analysis methods such as node and edge rankings. Few of its powerful characteristics are: its ability to enable easy profile comparisons across multiple networks, find their intersection and provide users with simplified, high quality plots of any of the offered topological characteristics against any other within the same network. It is written in R and Shiny, it is based on the igraph library and it is able to handle medium-scale weighted/unweighted, directed/undirected and bipartite graphs. NAP is available at http://bioinformatics.med.uoc.gr/NAP .

[Application of network biology on study of traditional Chinese medicine].

Science.gov (United States)

Tian, Sai-Sai; Yang, Jian; Zhao, Jing; Zhang, Wei-Dong

2018-01-01

With the completion of the human genome project, people have gradually recognized that the functions of the biological system are fulfilled through network-type interaction between genes, proteins and small molecules, while complex diseases are caused by the imbalance of biological processes due to a number of gene expression disorders. These have contributed to the rise of the concept of the "multi-target" drug discovery. Treatment and diagnosis of traditional Chinese medicine are based on holism and syndrome differentiation. At the molecular level, traditional Chinese medicine is characterized by multi-component and multi-target prescriptions, which is expected to provide a reference for the development of multi-target drugs. This paper reviews the application of network biology in traditional Chinese medicine in six aspects, in expectation to provide a reference to the modernized study of traditional Chinese medicine. Copyright© by the Chinese Pharmaceutical Association.

Inferring hidden causal relations between pathway members using reduced Google matrix of directed biological networks

Science.gov (United States)

2018-01-01

Signaling pathways represent parts of the global biological molecular network which connects them into a seamless whole through complex direct and indirect (hidden) crosstalk whose structure can change during development or in pathological conditions. We suggest a novel methodology, called Googlomics, for the structural analysis of directed biological networks using spectral analysis of their Google matrices, using parallels with quantum scattering theory, developed for nuclear and mesoscopic physics and quantum chaos. We introduce analytical “reduced Google matrix” method for the analysis of biological network structure. The method allows inferring hidden causal relations between the members of a signaling pathway or a functionally related group of genes. We investigate how the structure of hidden causal relations can be reprogrammed as a result of changes in the transcriptional network layer during cancerogenesis. The suggested Googlomics approach rigorously characterizes complex systemic changes in the wiring of large causal biological networks in a computationally efficient way. PMID:29370181

Yeast systems biology to unravel the network of life

DEFF Research Database (Denmark)

Mustacchi, Roberta; Hohmann, S; Nielsen, Jens

2006-01-01

Systems biology focuses on obtaining a quantitative description of complete biological systems, even complete cellular function. In this way, it will be possible to perform computer-guided design of novel drugs, advanced therapies for treatment of complex diseases, and to perform in silico design....... Furthermore, it serves as an industrial workhorse for production of a wide range of chemicals and pharmaceuticals. Systems biology involves the combination of novel experimental techniques from different disciplines as well as functional genomics, bioinformatics and mathematical modelling, and hence no single...... laboratory has access to all the necessary competences. For this reason the Yeast Systems Biology Network (YSBN) has been established. YSBN will coordinate research efforts, in yeast systems biology and, through the recently obtained EU funding for a Coordination Action, it will be possible to set...

Computing chemical organizations in biological networks.

Science.gov (United States)

Centler, Florian; Kaleta, Christoph; di Fenizio, Pietro Speroni; Dittrich, Peter

2008-07-15

Novel techniques are required to analyze computational models of intracellular processes as they increase steadily in size and complexity. The theory of chemical organizations has recently been introduced as such a technique that links the topology of biochemical reaction network models to their dynamical repertoire. The network is decomposed into algebraically closed and self-maintaining subnetworks called organizations. They form a hierarchy representing all feasible system states including all steady states. We present three algorithms to compute the hierarchy of organizations for network models provided in SBML format. Two of them compute the complete organization hierarchy, while the third one uses heuristics to obtain a subset of all organizations for large models. While the constructive approach computes the hierarchy starting from the smallest organization in a bottom-up fashion, the flux-based approach employs self-maintaining flux distributions to determine organizations. A runtime comparison on 16 different network models of natural systems showed that none of the two exhaustive algorithms is superior in all cases. Studying a 'genome-scale' network model with 762 species and 1193 reactions, we demonstrate how the organization hierarchy helps to uncover the model structure and allows to evaluate the model's quality, for example by detecting components and subsystems of the model whose maintenance is not explained by the model. All data and a Java implementation that plugs into the Systems Biology Workbench is available from http://www.minet.uni-jena.de/csb/prj/ot/tools.

Accelerated reliability testing of highly aligned single-walled carbon nanotube networks subjected to DC electrical stressing.

Science.gov (United States)

Strus, Mark C; Chiaramonti, Ann N; Kim, Young Lae; Jung, Yung Joon; Keller, Robert R

2011-07-01

We investigate the electrical reliability of nanoscale lines of highly aligned, networked, metallic/semiconducting single-walled carbon nanotubes (SWCNTs) fabricated through a template-based fluidic assembly process. We find that these SWCNT networks can withstand DC current densities larger than 10 MA cm(-2) for several hours and, in some cases, several days. We develop test methods that show that the degradation rate, failure predictability and total device lifetime can be linked to the initial resistance. Scanning electron and transmission electron microscopy suggest that fabrication variability plays a critical role in the rate of degradation, and we offer an empirical method of quickly determining the long-term performance of a network. We find that well-fabricated lines subject to constant electrical stress show a linear accumulation of damage reminiscent of electromigration in metallic interconnects, and we explore the underlying physical mechanisms that could cause such behavior.

Canadian Cytogenetic Emergency network (CEN) for biological dosimetry following radiological/nuclear accidents.

Science.gov (United States)

Miller, Susan M; Ferrarotto, Catherine L; Vlahovich, Slavica; Wilkins, Ruth C; Boreham, Douglas R; Dolling, Jo-Anna

2007-07-01

To test the ability of the cytogenetic emergency network (CEN) of laboratories, currently under development across Canada, to provide rapid biological dosimetry using the dicentric assay for triage assessment, that could be implemented in the event of a large-scale radiation/nuclear emergency. A workshop was held in May 2004 in Toronto, Canada, to introduce the concept of CEN and recruit clinical cytogenetic laboratories at hospitals across the country. Slides were prepared for dicentric assay analysis following in vitro irradiation of blood to a range of gamma-ray doses. A minimum of 50 metaphases per slide were analyzed by 41 people at 22 different laboratories to estimate the exposure level. Dose estimates were calculated based on a dose response curve generated at Health Canada. There were a total of 104 dose estimates and 96 (92.3%) of them fell within the expected range using triage scoring criteria. Half of the laboratories analyzed 50 metaphases in network were acceptable for emergency biological dosimetry. When this network is fully operational, it will be the first of its kind in Canada able to respond to radiological/nuclear emergencies by providing triage quality biological dosimetry for a large number of samples. This network represents an alternate expansion of existing international emergency biological dosimetry cytogenetic networks.

A reverse engineering approach to optimize experiments for the construction of biological regulatory networks.

Science.gov (United States)

Zhang, Xiaomeng; Shao, Bin; Wu, Yangle; Qi, Ouyang

2013-01-01

One of the major objectives in systems biology is to understand the relation between the topological structures and the dynamics of biological regulatory networks. In this context, various mathematical tools have been developed to deduct structures of regulatory networks from microarray expression data. In general, from a single data set, one cannot deduct the whole network structure; additional expression data are usually needed. Thus how to design a microarray expression experiment in order to get the most information is a practical problem in systems biology. Here we propose three methods, namely, maximum distance method, trajectory entropy method, and sampling method, to derive the optimal initial conditions for experiments. The performance of these methods is tested and evaluated in three well-known regulatory networks (budding yeast cell cycle, fission yeast cell cycle, and E. coli. SOS network). Based on the evaluation, we propose an efficient strategy for the design of microarray expression experiments.

Effective comparative analysis of protein-protein interaction networks by measuring the steady-state network flow using a Markov model.

Science.gov (United States)

Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

2016-10-06

Comparative analysis of protein-protein interaction (PPI) networks provides an effective means of detecting conserved functional network modules across different species. Such modules typically consist of orthologous proteins with conserved interactions, which can be exploited to computationally predict the modules through network comparison. In this work, we propose a novel probabilistic framework for comparing PPI networks and effectively predicting the correspondence between proteins, represented as network nodes, that belong to conserved functional modules across the given PPI networks. The basic idea is to estimate the steady-state network flow between nodes that belong to different PPI networks based on a Markov random walk model. The random walker is designed to make random moves to adjacent nodes within a PPI network as well as cross-network moves between potential orthologous nodes with high sequence similarity. Based on this Markov random walk model, we estimate the steady-state network flow - or the long-term relative frequency of the transitions that the random walker makes - between nodes in different PPI networks, which can be used as a probabilistic score measuring their potential correspondence. Subsequently, the estimated scores can be used for detecting orthologous proteins in conserved functional modules through network alignment. Through evaluations based on multiple real PPI networks, we demonstrate that the proposed scheme leads to improved alignment results that are biologically more meaningful at reduced computational cost, outperforming the current state-of-the-art algorithms. The source code and datasets can be downloaded from http://www.ece.tamu.edu/~bjyoon/CUFID .

Biological mechanisms beyond network analysis via mathematical modeling. Comment on "Network science of biological systems at different scales: A review" by Marko Gosak et al.

Science.gov (United States)

Pedersen, Morten Gram

2018-03-01

Methods from network theory are increasingly used in research spanning from engineering and computer science to psychology and the social sciences. In this issue, Gosak et al. [1] provide a thorough review of network science applications to biological systems ranging from the subcellular world via neuroscience to ecosystems, with special attention to the insulin-secreting beta-cells in pancreatic islets.

Progressive multiple sequence alignments from triplets

Directory of Open Access Journals (Sweden)

Stadler Peter F

2007-07-01

Full Text Available Abstract Background The quality of progressive sequence alignments strongly depends on the accuracy of the individual pairwise alignment steps since gaps that are introduced at one step cannot be removed at later aggregation steps. Adjacent insertions and deletions necessarily appear in arbitrary order in pairwise alignments and hence form an unavoidable source of errors. Research Here we present a modified variant of progressive sequence alignments that addresses both issues. Instead of pairwise alignments we use exact dynamic programming to align sequence or profile triples. This avoids a large fractions of the ambiguities arising in pairwise alignments. In the subsequent aggregation steps we follow the logic of the Neighbor-Net algorithm, which constructs a phylogenetic network by step-wisely replacing triples by pairs instead of combining pairs to singletons. To this end the three-way alignments are subdivided into two partial alignments, at which stage all-gap columns are naturally removed. This alleviates the "once a gap, always a gap" problem of progressive alignment procedures. Conclusion The three-way Neighbor-Net based alignment program aln3nn is shown to compare favorably on both protein sequences and nucleic acids sequences to other progressive alignment tools. In the latter case one easily can include scoring terms that consider secondary structure features. Overall, the quality of resulting alignments in general exceeds that of clustalw or other multiple alignments tools even though our software does not included heuristics for context dependent (mismatch scores.

A value-based maturity model for IT alignment in networked businesses

NARCIS (Netherlands)

Santana Tapia, R.G.

Business-IT alignment can be achieved at various levels of maturity. Supposing that an organization has tried to achieve business-IT alignment, a question to face is: how is that organization going to know the level of maturity of its alignment situation in order to plan future ways of action? That

An Alignment of J-PARC Linac

CERN Document Server

Morishita, Takatoshi; Hasegawa, Kazuo; Ikegami, Masanori; Ito, Takashi; Kubota, Chikashi; Naito, Fujio; Takasaki, Eiichi; Tanaka, Hirokazu; Ueno, Akira; Yoshino, Kazuo

2005-01-01

J-PARC linear accelerator components are now being installed in the accelerator tunnel, whose total length is more than 400 m including the beam transport line to RCS (Rapid Cycling Synchrotron). A precise alignment of accelerator components is essential for a high quality beam acceleration. In this paper, planned alignment schemes for the installation of linac components, the fine alignment before beam acceleration, and watching the long term motion of the building are described. Guide points are placed on the floor, which acts as a reference for the initial alignment at the installation and also as a relay point for the long surveying network linking at the fine alignment. For a straight line alignment, the wire position sensor is placed on the offset position with respect to the beam center by a target holder, then a single wire can cover the accelerator cavities and the focusing magnets at the DTL-SDTL section (120m). The hydrostatic levering system (HLS) is used for watching the floor elevation (changes)...

Impact of heuristics in clustering large biological networks.

Science.gov (United States)

Shafin, Md Kishwar; Kabir, Kazi Lutful; Ridwan, Iffatur; Anannya, Tasmiah Tamzid; Karim, Rashid Saadman; Hoque, Mohammad Mozammel; Rahman, M Sohel

2015-12-01

Traditional clustering algorithms often exhibit poor performance for large networks. On the contrary, greedy algorithms are found to be relatively efficient while uncovering functional modules from large biological networks. The quality of the clusters produced by these greedy techniques largely depends on the underlying heuristics employed. Different heuristics based on different attributes and properties perform differently in terms of the quality of the clusters produced. This motivates us to design new heuristics for clustering large networks. In this paper, we have proposed two new heuristics and analyzed the performance thereof after incorporating those with three different combinations in a recently celebrated greedy clustering algorithm named SPICi. We have extensively analyzed the effectiveness of these new variants. The results are found to be promising. Copyright © 2015 Elsevier Ltd. All rights reserved.

Structural identifiability of cyclic graphical models of biological networks with latent variables.

Science.gov (United States)

Wang, Yulin; Lu, Na; Miao, Hongyu

2016-06-13

Graphical models have long been used to describe biological networks for a variety of important tasks such as the determination of key biological parameters, and the structure of graphical model ultimately determines whether such unknown parameters can be unambiguously obtained from experimental observations (i.e., the identifiability problem). Limited by resources or technical capacities, complex biological networks are usually partially observed in experiment, which thus introduces latent variables into the corresponding graphical models. A number of previous studies have tackled the parameter identifiability problem for graphical models such as linear structural equation models (SEMs) with or without latent variables. However, the limited resolution and efficiency of existing approaches necessarily calls for further development of novel structural identifiability analysis algorithms. An efficient structural identifiability analysis algorithm is developed in this study for a broad range of network structures. The proposed method adopts the Wright's path coefficient method to generate identifiability equations in forms of symbolic polynomials, and then converts these symbolic equations to binary matrices (called identifiability matrix). Several matrix operations are introduced for identifiability matrix reduction with system equivalency maintained. Based on the reduced identifiability matrices, the structural identifiability of each parameter is determined. A number of benchmark models are used to verify the validity of the proposed approach. Finally, the network module for influenza A virus replication is employed as a real example to illustrate the application of the proposed approach in practice. The proposed approach can deal with cyclic networks with latent variables. The key advantage is that it intentionally avoids symbolic computation and is thus highly efficient. Also, this method is capable of determining the identifiability of each single parameter and

Automatic compilation from high-level biologically-oriented programming language to genetic regulatory networks.

Science.gov (United States)

Beal, Jacob; Lu, Ting; Weiss, Ron

2011-01-01

The field of synthetic biology promises to revolutionize our ability to engineer biological systems, providing important benefits for a variety of applications. Recent advances in DNA synthesis and automated DNA assembly technologies suggest that it is now possible to construct synthetic systems of significant complexity. However, while a variety of novel genetic devices and small engineered gene networks have been successfully demonstrated, the regulatory complexity of synthetic systems that have been reported recently has somewhat plateaued due to a variety of factors, including the complexity of biology itself and the lag in our ability to design and optimize sophisticated biological circuitry. To address the gap between DNA synthesis and circuit design capabilities, we present a platform that enables synthetic biologists to express desired behavior using a convenient high-level biologically-oriented programming language, Proto. The high level specification is compiled, using a regulatory motif based mechanism, to a gene network, optimized, and then converted to a computational simulation for numerical verification. Through several example programs we illustrate the automated process of biological system design with our platform, and show that our compiler optimizations can yield significant reductions in the number of genes (~ 50%) and latency of the optimized engineered gene networks. Our platform provides a convenient and accessible tool for the automated design of sophisticated synthetic biological systems, bridging an important gap between DNA synthesis and circuit design capabilities. Our platform is user-friendly and features biologically relevant compiler optimizations, providing an important foundation for the development of sophisticated biological systems.

Simulation of beamline alignment operations

International Nuclear Information System (INIS)

Annese, C; Miller, M G.

1999-01-01

The CORBA-based Simulator was a Laboratory Directed Research and Development (LDRD) project that applied simulation techniques to explore critical questions about distributed control systems. The simulator project used a three-prong approach that studied object-oriented distribution tools, computer network modeling, and simulation of key control system scenarios. The National Ignition Facility's (NIF) optical alignment system was modeled to study control system operations. The alignment of NIF's 192 beamlines is a large complex operation involving more than 100 computer systems and 8000 mechanized devices. The alignment process is defined by a detailed set of procedures; however, many of the steps are deterministic. The alignment steps for a poorly aligned component are similar to that of a nearly aligned component; however, additional operations/iterations are required to complete the process. Thus, the same alignment operations will require variable amounts of time to perform depending on the current alignment condition as well as other factors. Simulation of the alignment process is necessary to understand beamline alignment time requirements and how shared resources such as the Output Sensor and Target Alignment Sensor effect alignment efficiency. The simulation has provided alignment time estimates and other results based on documented alignment procedures and alignment experience gained in the laboratory. Computer communication time, mechanical hardware actuation times, image processing algorithm execution times, etc. have been experimentally determined and incorporated into the model. Previous analysis of alignment operations utilized average implementation times for all alignment operations. Resource sharing becomes rather simple to model when only average values are used. The time required to actually implement the many individual alignment operations will be quite dynamic. The simulation model estimates the time to complete an operation using

Enhanced Dynamic Algorithm of Genome Sequence Alignments

OpenAIRE

Arabi E. keshk

2014-01-01

The merging of biology and computer science has created a new field called computational biology that explore the capacities of computers to gain knowledge from biological data, bioinformatics. Computational biology is rooted in life sciences as well as computers, information sciences, and technologies. The main problem in computational biology is sequence alignment that is a way of arranging the sequences of DNA, RNA or protein to identify the region of similarity and relationship between se...

RENEB - Running the European Network of biological dosimetry and physical retrospective dosimetry.

Science.gov (United States)

Kulka, Ulrike; Abend, Michael; Ainsbury, Elizabeth; Badie, Christophe; Barquinero, Joan Francesc; Barrios, Lleonard; Beinke, Christina; Bortolin, Emanuela; Cucu, Alexandra; De Amicis, Andrea; Domínguez, Inmaculada; Fattibene, Paola; Frøvig, Anne Marie; Gregoire, Eric; Guogyte, Kamile; Hadjidekova, Valeria; Jaworska, Alicja; Kriehuber, Ralf; Lindholm, Carita; Lloyd, David; Lumniczky, Katalin; Lyng, Fiona; Meschini, Roberta; Mörtl, Simone; Della Monaca, Sara; Monteiro Gil, Octávia; Montoro, Alegria; Moquet, Jayne; Moreno, Mercedes; Oestreicher, Ursula; Palitti, Fabrizio; Pantelias, Gabriel; Patrono, Clarice; Piqueret-Stephan, Laure; Port, Matthias; Prieto, María Jesus; Quintens, Roel; Ricoul, Michelle; Romm, Horst; Roy, Laurence; Sáfrány, Géza; Sabatier, Laure; Sebastià, Natividad; Sommer, Sylwester; Terzoudi, Georgia; Testa, Antonella; Thierens, Hubert; Turai, Istvan; Trompier, François; Valente, Marco; Vaz, Pedro; Voisin, Philippe; Vral, Anne; Woda, Clemens; Zafiropoulos, Demetre; Wojcik, Andrzej

2017-01-01

A European network was initiated in 2012 by 23 partners from 16 European countries with the aim to significantly increase individualized dose reconstruction in case of large-scale radiological emergency scenarios. The network was built on three complementary pillars: (1) an operational basis with seven biological and physical dosimetric assays in ready-to-use mode, (2) a basis for education, training and quality assurance, and (3) a basis for further network development regarding new techniques and members. Techniques for individual dose estimation based on biological samples and/or inert personalized devices as mobile phones or smart phones were optimized to support rapid categorization of many potential victims according to the received dose to the blood or personal devices. Communication and cross-border collaboration were also standardized. To assure long-term sustainability of the network, cooperation with national and international emergency preparedness organizations was initiated and links to radiation protection and research platforms have been developed. A legal framework, based on a Memorandum of Understanding, was established and signed by 27 organizations by the end of 2015. RENEB is a European Network of biological and physical-retrospective dosimetry, with the capacity and capability to perform large-scale rapid individualized dose estimation. Specialized to handle large numbers of samples, RENEB is able to contribute to radiological emergency preparedness and wider large-scale research projects.

Survey and alignment for the Swiss Light Source

International Nuclear Information System (INIS)

Wei, F.Q.; Dreyer, K.; Fehlmann, U.; Pochon, J.L.; Wrulich, A.

1999-01-01

The Swiss Light Source (SLS) is a dedicated high brightness synchrotron light source currently under construction at the Paul Scherrer Institute (PSI) in Villigen. It will be commissioned in 2001. The accelerator complex includes a 2.4 GeV electron storage ring (SR) with 288 in circumference, a full energy injection booster synchrotron (Booster) and a 100 MeV linear pre-accelerator. The general alignment method and first results of the network measurements are presented. A laser tracker LTD500 is mainly adopted for network measurements and the alignment of storage ring components. (authors)

Accelerator Technology: Geodesy and Alignment for Particle Accelerators

CERN Document Server

Missiaen, D

2013-01-01

This document is part of Subvolume C 'Accelerators and Colliders' of Volume 21 'Elementary Particles' of Landolt-Börnstein - Group I 'Elementary Particles, Nuclei and Atoms'. It contains the the Section '8.9 Geodesy and Alignment for Particle Accelerators' of the Chapter '8 Accelerator Technology' with the content: 8.9 Geodesy and Alignment for Particle Accelerators 8.9.1 Introduction 8.9.2 Reference and Co-ordinate Systems 8.9.3 Definition of the Beam Line on the Accelerator Site 8.9.4 Geodetic Network 8.9.5 Tunnel Preliminary Works 8.9.6 The Alignment References 8.9.7 Alignment of Accelerator Components 8.9.8 Permanent Monitoring and Remote Alignment of Low Beta Quadrupoles 8.9.9 Alignment of Detector Components

Pairwise structure alignment specifically tuned for surface pockets and interaction interfaces

KAUST Repository

Cui, Xuefeng

2015-09-09

To detect and evaluate the similarities between the three-dimensional (3D) structures of two molecules, various kinds of methods have been proposed for the pairwise structure alignment problem [6, 9, 7, 11]. The problem plays important roles when studying the function and the evolution of biological molecules. Recently, pairwise structure alignment methods have been extended and applied on surface pocket structures [10, 3, 5] and interaction interface structures [8, 4]. The results show that, even when there are no global similarities discovered between the global sequences and the global structures, biological molecules or complexes could share similar functions because of well conserved pockets and interfaces. Thus, pairwise pocket and interface structure alignments are promising to unveil such shared functions that cannot be discovered by the well-studied global sequence and global structure alignments. State-of-the-art methods for pairwise pocket and interface structure alignments [4, 5] are direct extensions of the classic pairwise protein structure alignment methods, and thus such methods share a few limitations. First, the goal of the classic protein structure alignment methods is to align single-chain protein structures (i.e., a single fragment of residues connected by peptide bonds). However, we observed that pockets and interfaces tend to consist of tens of extremely short backbone fragments (i.e., three or fewer residues connected by peptide bonds). Thus, existing pocket and interface alignment methods based on the protein structure alignment methods still rely on the existence of long-enough backbone fragments, and the fragmentation issue of pockets and interfaces rises the risk of missing the optimal alignments. Moreover, existing interface structure alignment methods focus on protein-protein interfaces, and require a "blackbox preprocessing" before aligning protein-DNA and protein-RNA interfaces. Therefore, we introduce the PROtein STucture Alignment

Novel recurrent neural network for modelling biological networks: oscillatory p53 interaction dynamics.

Science.gov (United States)

Ling, Hong; Samarasinghe, Sandhya; Kulasiri, Don

2013-12-01

Understanding the control of cellular networks consisting of gene and protein interactions and their emergent properties is a central activity of Systems Biology research. For this, continuous, discrete, hybrid, and stochastic methods have been proposed. Currently, the most common approach to modelling accurate temporal dynamics of networks is ordinary differential equations (ODE). However, critical limitations of ODE models are difficulty in kinetic parameter estimation and numerical solution of a large number of equations, making them more suited to smaller systems. In this article, we introduce a novel recurrent artificial neural network (RNN) that addresses above limitations and produces a continuous model that easily estimates parameters from data, can handle a large number of molecular interactions and quantifies temporal dynamics and emergent systems properties. This RNN is based on a system of ODEs representing molecular interactions in a signalling network. Each neuron represents concentration change of one molecule represented by an ODE. Weights of the RNN correspond to kinetic parameters in the system and can be adjusted incrementally during network training. The method is applied to the p53-Mdm2 oscillation system - a crucial component of the DNA damage response pathways activated by a damage signal. Simulation results indicate that the proposed RNN can successfully represent the behaviour of the p53-Mdm2 oscillation system and solve the parameter estimation problem with high accuracy. Furthermore, we presented a modified form of the RNN that estimates parameters and captures systems dynamics from sparse data collected over relatively large time steps. We also investigate the robustness of the p53-Mdm2 system using the trained RNN under various levels of parameter perturbation to gain a greater understanding of the control of the p53-Mdm2 system. Its outcomes on robustness are consistent with the current biological knowledge of this system. As more

Evaluation of gene association methods for coexpression network construction and biological knowledge discovery.

Directory of Open Access Journals (Sweden)

Sapna Kumari

Full Text Available BACKGROUND: Constructing coexpression networks and performing network analysis using large-scale gene expression data sets is an effective way to uncover new biological knowledge; however, the methods used for gene association in constructing these coexpression networks have not been thoroughly evaluated. Since different methods lead to structurally different coexpression networks and provide different information, selecting the optimal gene association method is critical. METHODS AND RESULTS: In this study, we compared eight gene association methods - Spearman rank correlation, Weighted Rank Correlation, Kendall, Hoeffding's D measure, Theil-Sen, Rank Theil-Sen, Distance Covariance, and Pearson - and focused on their true knowledge discovery rates in associating pathway genes and construction coordination networks of regulatory genes. We also examined the behaviors of different methods to microarray data with different properties, and whether the biological processes affect the efficiency of different methods. CONCLUSIONS: We found that the Spearman, Hoeffding and Kendall methods are effective in identifying coexpressed pathway genes, whereas the Theil-sen, Rank Theil-Sen, Spearman, and Weighted Rank methods perform well in identifying coordinated transcription factors that control the same biological processes and traits. Surprisingly, the widely used Pearson method is generally less efficient, and so is the Distance Covariance method that can find gene pairs of multiple relationships. Some analyses we did clearly show Pearson and Distance Covariance methods have distinct behaviors as compared to all other six methods. The efficiencies of different methods vary with the data properties to some degree and are largely contingent upon the biological processes, which necessitates the pre-analysis to identify the best performing method for gene association and coexpression network construction.

PREFACE: Complex Networks: from Biology to Information Technology

Science.gov (United States)

Barrat, A.; Boccaletti, S.; Caldarelli, G.; Chessa, A.; Latora, V.; Motter, A. E.

2008-06-01

The field of complex networks is one of the most active areas in contemporary statistical physics. Ten years after seminal work initiated the modern study of networks, interest in the field is in fact still growing, as indicated by the ever increasing number of publications in network science. The reason for such a resounding success is most likely the simplicity and broad significance of the approach that, through graph theory, allows researchers to address a variety of different complex systems within a common framework. This special issue comprises a selection of contributions presented at the workshop 'Complex Networks: from Biology to Information Technology' held in July 2007 in Pula (Cagliari), Italy as a satellite of the general conference STATPHYS23. The contributions cover a wide range of problems that are currently among the most important questions in the area of complex networks and that are likely to stimulate future research. The issue is organised into four sections. The first two sections describe 'methods' to study the structure and the dynamics of complex networks, respectively. After this methodological part, the issue proceeds with a section on applications to biological systems. The issue closes with a section concentrating on applications to the study of social and technological networks. The first section, entitled Methods: The Structure, consists of six contributions focused on the characterisation and analysis of structural properties of complex networks: The paper Motif-based communities in complex networks by Arenas et al is a study of the occurrence of characteristic small subgraphs in complex networks. These subgraphs, known as motifs, are used to define general classes of nodes and their communities by extending the mathematical expression of the Newman-Girvan modularity. The same line of research, aimed at characterising network structure through the analysis of particular subgraphs, is explored by Bianconi and Gulbahce in Algorithm

Application of Federal Kalman Filter with Neural Networks in the Velocity and Attitude Matching of Transfer Alignment

Directory of Open Access Journals (Sweden)

Lijun Song

2018-01-01

Full Text Available The centralized Kalman filter is always applied in the velocity and attitude matching of Transfer Alignment (TA. But the centralized Kalman has many disadvantages, such as large amount of calculation, poor real-time performance, and low reliability. In the paper, the federal Kalman filter (FKF based on neural networks is used in the velocity and attitude matching of TA, the Kalman filter is adjusted by the neural networks in the two subfilters, the federal filter is used to fuse the information of the two subfilters, and the global suboptimal state estimation is obtained. The result of simulation shows that the federal Kalman filter based on neural networks is better in estimating the initial attitude misalignment angle of inertial navigation system (INS when the system dynamic model and noise statistics characteristics of inertial navigation system are unclear, and the estimation error is smaller and the accuracy is higher.

Content-rich biological network constructed by mining PubMed abstracts

Directory of Open Access Journals (Sweden)

Sharp Burt M

2004-10-01

Full Text Available Abstract Background The integration of the rapidly expanding corpus of information about the genome, transcriptome, and proteome, engendered by powerful technological advances, such as microarrays, and the availability of genomic sequence from multiple species, challenges the grasp and comprehension of the scientific community. Despite the existence of text-mining methods that identify biological relationships based on the textual co-occurrence of gene/protein terms or similarities in abstract texts, knowledge of the underlying molecular connections on a large scale, which is prerequisite to understanding novel biological processes, lags far behind the accumulation of data. While computationally efficient, the co-occurrence-based approaches fail to characterize (e.g., inhibition or stimulation, directionality biological interactions. Programs with natural language processing (NLP capability have been created to address these limitations, however, they are in general not readily accessible to the public. Results We present a NLP-based text-mining approach, Chilibot, which constructs content-rich relationship networks among biological concepts, genes, proteins, or drugs. Amongst its features, suggestions for new hypotheses can be generated. Lastly, we provide evidence that the connectivity of molecular networks extracted from the biological literature follows the power-law distribution, indicating scale-free topologies consistent with the results of previous experimental analyses. Conclusions Chilibot distills scientific relationships from knowledge available throughout a wide range of biological domains and presents these in a content-rich graphical format, thus integrating general biomedical knowledge with the specialized knowledge and interests of the user. Chilibot http://www.chilibot.net can be accessed free of charge to academic users.

A biological network-based regularized artificial neural network model for robust phenotype prediction from gene expression data.

Science.gov (United States)

Kang, Tianyu; Ding, Wei; Zhang, Luoyan; Ziemek, Daniel; Zarringhalam, Kourosh

2017-12-19

Stratification of patient subpopulations that respond favorably to treatment or experience and adverse reaction is an essential step toward development of new personalized therapies and diagnostics. It is currently feasible to generate omic-scale biological measurements for all patients in a study, providing an opportunity for machine learning models to identify molecular markers for disease diagnosis and progression. However, the high variability of genetic background in human populations hampers the reproducibility of omic-scale markers. In this paper, we develop a biological network-based regularized artificial neural network model for prediction of phenotype from transcriptomic measurements in clinical trials. To improve model sparsity and the overall reproducibility of the model, we incorporate regularization for simultaneous shrinkage of gene sets based on active upstream regulatory mechanisms into the model. We benchmark our method against various regression, support vector machines and artificial neural network models and demonstrate the ability of our method in predicting the clinical outcomes using clinical trial data on acute rejection in kidney transplantation and response to Infliximab in ulcerative colitis. We show that integration of prior biological knowledge into the classification as developed in this paper, significantly improves the robustness and generalizability of predictions to independent datasets. We provide a Java code of our algorithm along with a parsed version of the STRING DB database. In summary, we present a method for prediction of clinical phenotypes using baseline genome-wide expression data that makes use of prior biological knowledge on gene-regulatory interactions in order to increase robustness and reproducibility of omic-scale markers. The integrated group-wise regularization methods increases the interpretability of biological signatures and gives stable performance estimates across independent test sets.

Predicting Protein Function via Semantic Integration of Multiple Networks.

Science.gov (United States)

Yu, Guoxian; Fu, Guangyuan; Wang, Jun; Zhu, Hailong

2016-01-01

Determining the biological functions of proteins is one of the key challenges in the post-genomic era. The rapidly accumulated large volumes of proteomic and genomic data drives to develop computational models for automatically predicting protein function in large scale. Recent approaches focus on integrating multiple heterogeneous data sources and they often get better results than methods that use single data source alone. In this paper, we investigate how to integrate multiple biological data sources with the biological knowledge, i.e., Gene Ontology (GO), for protein function prediction. We propose a method, called SimNet, to Semantically integrate multiple functional association Networks derived from heterogenous data sources. SimNet firstly utilizes GO annotations of proteins to capture the semantic similarity between proteins and introduces a semantic kernel based on the similarity. Next, SimNet constructs a composite network, obtained as a weighted summation of individual networks, and aligns the network with the kernel to get the weights assigned to individual networks. Then, it applies a network-based classifier on the composite network to predict protein function. Experiment results on heterogenous proteomic data sources of Yeast, Human, Mouse, and Fly show that, SimNet not only achieves better (or comparable) results than other related competitive approaches, but also takes much less time. The Matlab codes of SimNet are available at https://sites.google.com/site/guoxian85/simnet.

MicroRNA functional network in pancreatic cancer: From biology to ...

Indian Academy of Sciences (India)

[Wang J and Sen S 2011 MicroRNA functional network in pancreatic cancer: From biology to biomarkers of disease. ... growth factor type I receptor; INSR, insulin receptor; IPA, Ingenuity Pathway Analysis; IPMN, ..... Prostate cancer signalling.

The impact of network biology in pharmacology and toxicology

DEFF Research Database (Denmark)

Panagiotou, Gianni; Taboureau, Olivier

2012-01-01

With the need to investigate alternative approaches and emerging technologies in order to increase drug efficacy and reduce adverse drug effects, network biology offers a novel way of approaching drug discovery by considering the effect of a molecule and protein's function in a global physiological...... and tools that allow integration and analysis of such information for understanding the properties of small molecules in the context of cellular networks. With the recent advances in the omics area, global integrative approaches are necessary to cope with the massive amounts of data, and biomedical...

Biological network extraction from scientific literature: state of the art and challenges.

Science.gov (United States)

Li, Chen; Liakata, Maria; Rebholz-Schuhmann, Dietrich

2014-09-01

Networks of molecular interactions explain complex biological processes, and all known information on molecular events is contained in a number of public repositories including the scientific literature. Metabolic and signalling pathways are often viewed separately, even though both types are composed of interactions involving proteins and other chemical entities. It is necessary to be able to combine data from all available resources to judge the functionality, complexity and completeness of any given network overall, but especially the full integration of relevant information from the scientific literature is still an ongoing and complex task. Currently, the text-mining research community is steadily moving towards processing the full body of the scientific literature by making use of rich linguistic features such as full text parsing, to extract biological interactions. The next step will be to combine these with information from scientific databases to support hypothesis generation for the discovery of new knowledge and the extension of biological networks. The generation of comprehensive networks requires technologies such as entity grounding, coordination resolution and co-reference resolution, which are not fully solved and are required to further improve the quality of results. Here, we analyse the state of the art for the extraction of network information from the scientific literature and the evaluation of extraction methods against reference corpora, discuss challenges involved and identify directions for future research. © The Author 2013. Published by Oxford University Press. For Permissions, please email: journals.permissions@oup.com.

Integrated analysis of multiple data sources reveals modular structure of biological networks

International Nuclear Information System (INIS)

Lu Hongchao; Shi Baochen; Wu Gaowei; Zhang Yong; Zhu Xiaopeng; Zhang Zhihua; Liu Changning; Zhao, Yi; Wu Tao; Wang Jie; Chen Runsheng

2006-01-01

It has been a challenging task to integrate high-throughput data into investigations of the systematic and dynamic organization of biological networks. Here, we presented a simple hierarchical clustering algorithm that goes a long way to achieve this aim. Our method effectively reveals the modular structure of the yeast protein-protein interaction network and distinguishes protein complexes from functional modules by integrating high-throughput protein-protein interaction data with the added subcellular localization and expression profile data. Furthermore, we take advantage of the detected modules to provide a reliably functional context for the uncharacterized components within modules. On the other hand, the integration of various protein-protein association information makes our method robust to false-positives, especially for derived protein complexes. More importantly, this simple method can be extended naturally to other types of data fusion and provides a framework for the study of more comprehensive properties of the biological network and other forms of complex networks

Alignment of SWNTs by protein-ligand interaction of functionalized magnetic particles under low magnetic fields.

Science.gov (United States)

Park, Tae Jung; Park, Jong Pil; Lee, Seok Jae; Jung, Dae-Hwan; Ko, Young Koan; Jung, Hee-Tae; Lee, Sang Yup

2011-05-01

Carbon nanotubes (CNTs) have attracted considerable attention for applications using their superior mechanical, thermal and electrical properties. A simple method to controllably align single-walled CNTs (SWNTs) by using magnetic particles embedded with superparamagnetic iron oxide as an accelerator under the magnetic field was developed. The functionalization of SWNTs using biotin, interacted with streptavidin-coupled magnetic particles (micro-to-nano in diameter), and layer-by-layer assembly were performed for the alignment of a particular direction onto the clean silicon and the gold substrate at very low magnetic forces (0.02-0.89 T) at room temperature. The successful alignment of the SWNTs with multi-layer film was observed by scanning electron microscopy (SEM) and transmission electron microscopy (TEM). By changing the orientation and location of the substrates, crossed-networks of SWNTs-magnetic particle complex could easily be fabricated. We suggest that this approach, which consists of a combination of biological interaction among streptavidin-biotin and magnetite particles, should be useful for lateral orientation of individual SWNTs with controllable direction.

Alternate MIMO AF relaying networks with interference alignment: Spectral efficient protocol and linear filter design

KAUST Repository

Park, Kihong

2013-02-01

In this paper, we study a two-hop relaying network consisting of one source, one destination, and three amplify-and-forward (AF) relays with multiple antennas. To compensate for the capacity prelog factor loss of 1/2$ due to the half-duplex relaying, alternate transmission is performed among three relays, and the inter-relay interference due to the alternate relaying is aligned to make additional degrees of freedom. In addition, suboptimal linear filter designs at the nodes are proposed to maximize the achievable sum rate for different fading scenarios when the destination utilizes a minimum mean-square error filter. © 1967-2012 IEEE.

Community Alignment ANADP

OpenAIRE

Halbert, Martin; Bicarregui, Juan; Anglada, Lluis; Duranti, Luciana

2014-01-01

Aligning National Approaches to Digital Preservation: An Action Assembly Biblioteca de Catalunya (National Library of Catalonia) November 18-20, 2013, Barcelona, Spain Auburn University Council on Library and Information Resources (CLIR) Digital Curation Centre (DCC) Digital Preservation Network (DPN) Joint Information Systems Committee (JISC) University of North Texas Virginia Tech Interuniversity Consortium for Political and Social Research (ICPSR) Innovative Inte...

Resource Alignment ANADP

OpenAIRE

Grindley, Neil; Cramer, Tom; Schrimpf, Sabine; Wilson, Tom

2014-01-01

Aligning National Approaches to Digital Preservation: An Action Assembly Biblioteca de Catalunya (National Library of Catalonia) November 18-20, 2013, Barcelona, Spain Auburn University Council on Library and Information Resources (CLIR) Digital Curation Centre (DCC) Digital Preservation Network (DPN) Joint Information Systems Committee (JISC) University of North Texas Virginia Tech Interuniversity Consortium for Political and Social Research (ICPSR) Innovative Inte...

Capacity Alignment ANADP

OpenAIRE

Davidson, Joy; Whitehead, Martha; Molloy, Laura; Molinaro, Mary

2014-01-01

Aligning National Approaches to Digital Preservation: An Action Assembly Biblioteca de Catalunya (National Library of Catalonia) November 18-20, 2013, Barcelona, Spain Auburn University Council on Library and Information Resources (CLIR) Digital Curation Centre (DCC) Digital Preservation Network (DPN) Joint Information Systems Committee (JISC) University of North Texas Virginia Tech Interuniversity Consortium for Political and Social Research (ICPSR) Innovative Inte...

ProteoLens: a visual analytic tool for multi-scale database-driven biological network data mining.

Science.gov (United States)

Huan, Tianxiao; Sivachenko, Andrey Y; Harrison, Scott H; Chen, Jake Y

2008-08-12

New systems biology studies require researchers to understand how interplay among myriads of biomolecular entities is orchestrated in order to achieve high-level cellular and physiological functions. Many software tools have been developed in the past decade to help researchers visually navigate large networks of biomolecular interactions with built-in template-based query capabilities. To further advance researchers' ability to interrogate global physiological states of cells through multi-scale visual network explorations, new visualization software tools still need to be developed to empower the analysis. A robust visual data analysis platform driven by database management systems to perform bi-directional data processing-to-visualizations with declarative querying capabilities is needed. We developed ProteoLens as a JAVA-based visual analytic software tool for creating, annotating and exploring multi-scale biological networks. It supports direct database connectivity to either Oracle or PostgreSQL database tables/views, on which SQL statements using both Data Definition Languages (DDL) and Data Manipulation languages (DML) may be specified. The robust query languages embedded directly within the visualization software help users to bring their network data into a visualization context for annotation and exploration. ProteoLens supports graph/network represented data in standard Graph Modeling Language (GML) formats, and this enables interoperation with a wide range of other visual layout tools. The architectural design of ProteoLens enables the de-coupling of complex network data visualization tasks into two distinct phases: 1) creating network data association rules, which are mapping rules between network node IDs or edge IDs and data attributes such as functional annotations, expression levels, scores, synonyms, descriptions etc; 2) applying network data association rules to build the network and perform the visual annotation of graph nodes and edges

Creating biological nanomaterials using synthetic biology

International Nuclear Information System (INIS)

Rice, MaryJoe K; Ruder, Warren C

2014-01-01

Synthetic biology is a new discipline that combines science and engineering approaches to precisely control biological networks. These signaling networks are especially important in fields such as biomedicine and biochemical engineering. Additionally, biological networks can also be critical to the production of naturally occurring biological nanomaterials, and as a result, synthetic biology holds tremendous potential in creating new materials. This review introduces the field of synthetic biology, discusses how biological systems naturally produce materials, and then presents examples and strategies for incorporating synthetic biology approaches in the development of new materials. In particular, strategies for using synthetic biology to produce both organic and inorganic nanomaterials are discussed. Ultimately, synthetic biology holds the potential to dramatically impact biological materials science with significant potential applications in medical systems. (review)

Creating biological nanomaterials using synthetic biology.

Science.gov (United States)

Rice, MaryJoe K; Ruder, Warren C

2014-02-01

Synthetic biology is a new discipline that combines science and engineering approaches to precisely control biological networks. These signaling networks are especially important in fields such as biomedicine and biochemical engineering. Additionally, biological networks can also be critical to the production of naturally occurring biological nanomaterials, and as a result, synthetic biology holds tremendous potential in creating new materials. This review introduces the field of synthetic biology, discusses how biological systems naturally produce materials, and then presents examples and strategies for incorporating synthetic biology approaches in the development of new materials. In particular, strategies for using synthetic biology to produce both organic and inorganic nanomaterials are discussed. Ultimately, synthetic biology holds the potential to dramatically impact biological materials science with significant potential applications in medical systems.

Modeling Cancer Metastasis using Global, Quantitative and Integrative Network Biology

DEFF Research Database (Denmark)

Schoof, Erwin; Erler, Janine

understanding of molecular processes which are fundamental to tumorigenesis. In Article 1, we propose a novel framework for how cancer mutations can be studied by taking into account their effect at the protein network level. In Article 2, we demonstrate how global, quantitative data on phosphorylation dynamics...... can be generated using MS, and how this can be modeled using a computational framework for deciphering kinase-substrate dynamics. This framework is described in depth in Article 3, and covers the design of KinomeXplorer, which allows the prediction of kinases responsible for modulating observed...... phosphorylation dynamics in a given biological sample. In Chapter III, we move into Integrative Network Biology, where, by combining two fundamental technologies (MS & NGS), we can obtain more in-depth insights into the links between cellular phenotype and genotype. Article 4 describes the proof...

Ontology alignment architecture for semantic sensor Web integration.

Science.gov (United States)

Fernandez, Susel; Marsa-Maestre, Ivan; Velasco, Juan R; Alarcos, Bernardo

2013-09-18

Sensor networks are a concept that has become very popular in data acquisition and processing for multiple applications in different fields such as industrial, medicine, home automation, environmental detection, etc. Today, with the proliferation of small communication devices with sensors that collect environmental data, semantic Web technologies are becoming closely related with sensor networks. The linking of elements from Semantic Web technologies with sensor networks has been called Semantic Sensor Web and has among its main features the use of ontologies. One of the key challenges of using ontologies in sensor networks is to provide mechanisms to integrate and exchange knowledge from heterogeneous sources (that is, dealing with semantic heterogeneity). Ontology alignment is the process of bringing ontologies into mutual agreement by the automatic discovery of mappings between related concepts. This paper presents a system for ontology alignment in the Semantic Sensor Web which uses fuzzy logic techniques to combine similarity measures between entities of different ontologies. The proposed approach focuses on two key elements: the terminological similarity, which takes into account the linguistic and semantic information of the context of the entity's names, and the structural similarity, based on both the internal and relational structure of the concepts. This work has been validated using sensor network ontologies and the Ontology Alignment Evaluation Initiative (OAEI) tests. The results show that the proposed techniques outperform previous approaches in terms of precision and recall.

Ontology Alignment Architecture for Semantic Sensor Web Integration

Directory of Open Access Journals (Sweden)

Bernardo Alarcos

2013-09-01

Full Text Available Sensor networks are a concept that has become very popular in data acquisition and processing for multiple applications in different fields such as industrial, medicine, home automation, environmental detection, etc. Today, with the proliferation of small communication devices with sensors that collect environmental data, semantic Web technologies are becoming closely related with sensor networks. The linking of elements from Semantic Web technologies with sensor networks has been called Semantic Sensor Web and has among its main features the use of ontologies. One of the key challenges of using ontologies in sensor networks is to provide mechanisms to integrate and exchange knowledge from heterogeneous sources (that is, dealing with semantic heterogeneity. Ontology alignment is the process of bringing ontologies into mutual agreement by the automatic discovery of mappings between related concepts. This paper presents a system for ontology alignment in the Semantic Sensor Web which uses fuzzy logic techniques to combine similarity measures between entities of different ontologies. The proposed approach focuses on two key elements: the terminological similarity, which takes into account the linguistic and semantic information of the context of the entity’s names, and the structural similarity, based on both the internal and relational structure of the concepts. This work has been validated using sensor network ontologies and the Ontology Alignment Evaluation Initiative (OAEI tests. The results show that the proposed techniques outperform previous approaches in terms of precision and recall.

Improving your target-template alignment with MODalign.

KAUST Repository

Barbato, Alessandro

2012-02-04

SUMMARY: MODalign is an interactive web-based tool aimed at helping protein structure modelers to inspect and manually modify the alignment between the sequences of a target protein and of its template(s). It interactively computes, displays and, upon modification of the target-template alignment, updates the multiple sequence alignments of the two protein families, their conservation score, secondary structure and solvent accessibility values, and local quality scores of the implied three-dimensional model(s). Although it has been designed to simplify the target-template alignment step in modeling, it is suitable for all cases where a sequence alignment needs to be inspected in the context of other biological information. AVAILABILITY AND IMPLEMENTATION: Freely available on the web at http://modorama.biocomputing.it/modalign. Website implemented in HTML and JavaScript with all major browsers supported. CONTACT: jan.kosinski@uniroma1.it.

Deep Neural Networks: A New Framework for Modeling Biological Vision and Brain Information Processing.

Science.gov (United States)

Kriegeskorte, Nikolaus

2015-11-24

Recent advances in neural network modeling have enabled major strides in computer vision and other artificial intelligence applications. Human-level visual recognition abilities are coming within reach of artificial systems. Artificial neural networks are inspired by the brain, and their computations could be implemented in biological neurons. Convolutional feedforward networks, which now dominate computer vision, take further inspiration from the architecture of the primate visual hierarchy. However, the current models are designed with engineering goals, not to model brain computations. Nevertheless, initial studies comparing internal representations between these models and primate brains find surprisingly similar representational spaces. With human-level performance no longer out of reach, we are entering an exciting new era, in which we will be able to build biologically faithful feedforward and recurrent computational models of how biological brains perform high-level feats of intelligence, including vision.

Main activities of the Latin American Network of Biological Dosimetry (LBDNet)

International Nuclear Information System (INIS)

Di Giorgio, M.; Vallerga, M.B.; Radl, A.; Taja, M.R.; Stuck Oliveira, M.; Valdivia, P.; Garcia Lima, O.; Lamadrid, A.; Gonzalez Mesa, J.E.; Romero Aguilera, I.; Mandina Cardoso, T.; Guerrero Carbajal, C.; Arceo Maldonado, C.; Espinoza, M.; Martinez Lopez, W.; Di Tomasso, M.; Barquinero, F.; Roy, L.

2010-01-01

The Latin American Biological Dosimetry Network (LBDNET) was constituted in 2007 for mutual assistance in case of a radiation emergency in the region supported by IAEA Technical Cooperation Projects RLA/9/054 and RLA/9/061. The main objectives are: a) to strengthen the technical capacities of Biological Dosimetry Services belonging to laboratories existing in the region (Argentine, Brazil, Chile, Cuba, Mexico, Peru and Uruguay) integrated in National Radiological Emergency Plans to provide a rapid biodosimetric response in a coordinated manner between countries and with RANET-IAEA/BioDoseNet-WHO, b) to provide support to other countries in the region lacking Biological Dosimetry laboratories, c) to consolidate the organization of the Latin American Biological Dosimetry Network for mutual assistance. The activities developed include technical meetings for protocols and chromosomal aberration scoring criteria unification, blood samples cultures exercises, chromosomal aberrations analysis at microscope, discussion of statistical methods and specialized software for dose calculation, the intercomparison between laboratory data after the analysis of slides with irradiated material and the intercomparison of the analysis of captured images distributed electronically in the WEB. The last exercise was the transportation of an irradiated human blood sample to countries inside and outside of the region. At the moment the exercises are concluded and they are pending to be published in reference journals. Results obtained show the capacity in the region for a biodosimetric response to a radiological accident. In the future the network will integrate techniques for high dose exposure evaluation and will enhance the interaction with other emergency systems in the region. (authors) [es

MSD-MAP: A Network-Based Systems Biology Platform for Predicting Disease-Metabolite Links.

Science.gov (United States)

Wathieu, Henri; Issa, Naiem T; Mohandoss, Manisha; Byers, Stephen W; Dakshanamurthy, Sivanesan

2017-01-01

Cancer-associated metabolites result from cell-wide mechanisms of dysregulation. The field of metabolomics has sought to identify these aberrant metabolites as disease biomarkers, clues to understanding disease mechanisms, or even as therapeutic agents. This study was undertaken to reliably predict metabolites associated with colorectal, esophageal, and prostate cancers. Metabolite and disease biological action networks were compared in a computational platform called MSD-MAP (Multi Scale Disease-Metabolite Association Platform). Using differential gene expression analysis with patient-based RNAseq data from The Cancer Genome Atlas, genes up- or down-regulated in cancer compared to normal tissue were identified. Relational databases were used to map biological entities including pathways, functions, and interacting proteins, to those differential disease genes. Similar relational maps were built for metabolites, stemming from known and in silico predicted metabolite-protein associations. The hypergeometric test was used to find statistically significant relationships between disease and metabolite biological signatures at each tier, and metabolites were assessed for multi-scale association with each cancer. Metabolite networks were also directly associated with various other diseases using a disease functional perturbation database. Our platform recapitulated metabolite-disease links that have been empirically verified in the scientific literature, with network-based mapping of jointly-associated biological activity also matching known disease mechanisms. This was true for colorectal, esophageal, and prostate cancers, using metabolite action networks stemming from both predicted and known functional protein associations. By employing systems biology concepts, MSD-MAP reliably predicted known cancermetabolite links, and may serve as a predictive tool to streamline conventional metabolomic profiling methodologies. Copyright© Bentham Science Publishers; For any

Biologically-inspired On-chip Learning in Pulsed Neural Networks

DEFF Research Database (Denmark)

Lehmann, Torsten; Woodburn, Robin

1999-01-01

Self-learning chips to implement many popular ANN (artificial neural network) algorithms are very difficult to design. We explain why this is so and say what lessons previous work teaches us in the design of self-learning systems. We offer a contribution to the "biologically-inspired" approach......, explaining what we mean by this term and providing an example of a robust, self-learning design that can solve simple classical-conditioning tasks, We give details of the design of individual circuits to perform component functions, which can then be combined into a network to solve the task. We argue...

Impact of Supply Chain Alignment on Construction Performance: A developed model for Vietnam

Directory of Open Access Journals (Sweden)

Huy Troung Quang

2017-12-01

Full Text Available There are many articles mentioning the advantages and benefits of supply chain alignment none, however, describe how to model such alignment in the supply chain. This paper offers a framework for examining and understanding the impact supply chain alignment has on performance. Based on supply chain mapping approach, a model describing alignment between processes/ flows in the supply chain network is developed. The model is then validated using a dataset of 316 enterprises operating in the Vietnam construction sector. Evidence indicates that the supply chain processes and flows were aligned. According to the results, the proposed supply chain alignment model is able to explain a 59.9% variance in operational performance, 58.9% in customer satisfaction, 34.5% in operating costs and 67.4% in business performance. To successfully align the supply chain network, companies can use the proposed model as a “road-map” to reduce high costs, to avoid the loss of control, management difficulties and/or vulnerability to opportunistic action, all of which may hinder efforts to align the supply chains.

Biological sample collector

Science.gov (United States)

Murphy, Gloria A [French Camp, CA

2010-09-07

A biological sample collector is adapted to a collect several biological samples in a plurality of filter wells. A biological sample collector may comprise a manifold plate for mounting a filter plate thereon, the filter plate having a plurality of filter wells therein; a hollow slider for engaging and positioning a tube that slides therethrough; and a slide case within which the hollow slider travels to allow the tube to be aligned with a selected filter well of the plurality of filter wells, wherein when the tube is aligned with the selected filter well, the tube is pushed through the hollow slider and into the selected filter well to sealingly engage the selected filter well and to allow the tube to deposit a biological sample onto a filter in the bottom of the selected filter well. The biological sample collector may be portable.

Phylogenetically informed logic relationships improve detection of biological network organization

Science.gov (United States)

2011-01-01

Background A "phylogenetic profile" refers to the presence or absence of a gene across a set of organisms, and it has been proven valuable for understanding gene functional relationships and network organization. Despite this success, few studies have attempted to search beyond just pairwise relationships among genes. Here we search for logic relationships involving three genes, and explore its potential application in gene network analyses. Results Taking advantage of a phylogenetic matrix constructed from the large orthologs database Roundup, we invented a method to create balanced profiles for individual triplets of genes that guarantee equal weight on the different phylogenetic scenarios of coevolution between genes. When we applied this idea to LAPP, the method to search for logic triplets of genes, the balanced profiles resulted in significant performance improvement and the discovery of hundreds of thousands more putative triplets than unadjusted profiles. We found that logic triplets detected biological network organization and identified key proteins and their functions, ranging from neighbouring proteins in local pathways, to well separated proteins in the whole pathway, and to the interactions among different pathways at the system level. Finally, our case study suggested that the directionality in a logic relationship and the profile of a triplet could disclose the connectivity between the triplet and surrounding networks. Conclusion Balanced profiles are superior to the raw profiles employed by traditional methods of phylogenetic profiling in searching for high order gene sets. Gene triplets can provide valuable information in detection of biological network organization and identification of key genes at different levels of cellular interaction. PMID:22172058

Attentional Networks and Biological Motion

Directory of Open Access Journals (Sweden)

Chandramouli Chandrasekaran

2010-03-01

Full Text Available Our ability to see meaningful actions when presented with pointlight traces of human movement is commonly referred to as the perception of biological motion. While traditionalexplanations have emphasized the spontaneous and automatic nature of this ability, morerecent findings suggest that attention may play a larger role than is typically assumed. Intwo studies we show that the speed and accuracy of responding to point-light stimuli is highly correlated with the ability to control selective attention. In our first experiment we measured thresholds for determining the walking direction of a masked point-light figure, and performance on a range of attention-related tasks in the same set of observers. Mask-density thresholds for the direction discrimination task varied quite considerably from observer to observer and this variation was highly correlated with performance on both Stroop and flanker interference tasks. Other components of attention, such as orienting, alerting and visual search efficiency, showed no such relationship. In a second experiment, we examined the relationship between the ability to determine the orientation of unmasked point-light actions and Stroop interference, again finding a strong correlation. Our results are consistent with previous research suggesting that biological motion processing may requite attention, and specifically implicate networks of attention related to executive control and selection.

Elucidation of time-dependent systems biology cell response patterns with time course network enrichment

DEFF Research Database (Denmark)

Wiwie, Christian; Rauch, Alexander; Haakonsson, Anders

2018-01-01

, no methods exist to integrate time series data with networks, thus preventing the identification of time-dependent systems biology responses. We close this gap with Time Course Network Enrichment (TiCoNE). It combines a new kind of human-augmented clustering with a novel approach to network enrichment...

DNAAlignEditor: DNA alignment editor tool

Directory of Open Access Journals (Sweden)

Guill Katherine E

2008-03-01

Full Text Available Abstract Background With advances in DNA re-sequencing methods and Next-Generation parallel sequencing approaches, there has been a large increase in genomic efforts to define and analyze the sequence variability present among individuals within a species. For very polymorphic species such as maize, this has lead to a need for intuitive, user-friendly software that aids the biologist, often with naïve programming capability, in tracking, editing, displaying, and exporting multiple individual sequence alignments. To fill this need we have developed a novel DNA alignment editor. Results We have generated a nucleotide sequence alignment editor (DNAAlignEditor that provides an intuitive, user-friendly interface for manual editing of multiple sequence alignments with functions for input, editing, and output of sequence alignments. The color-coding of nucleotide identity and the display of associated quality score aids in the manual alignment editing process. DNAAlignEditor works as a client/server tool having two main components: a relational database that collects the processed alignments and a user interface connected to database through universal data access connectivity drivers. DNAAlignEditor can be used either as a stand-alone application or as a network application with multiple users concurrently connected. Conclusion We anticipate that this software will be of general interest to biologists and population genetics in editing DNA sequence alignments and analyzing natural sequence variation regardless of species, and will be particularly useful for manual alignment editing of sequences in species with high levels of polymorphism.

Robustness leads close to the edge of chaos in coupled map networks: toward the understanding of biological networks

International Nuclear Information System (INIS)

Saito, Nen; Kikuchi, Macoto

2013-01-01

Dynamics in biological networks are, in general, robust against several perturbations. We investigate a coupled map network as a model motivated by gene regulatory networks and design systems that are robust against phenotypic perturbations (perturbations in dynamics), as well as systems that are robust against mutation (perturbations in network structure). To achieve such a design, we apply a multicanonical Monte Carlo method. Analysis based on the maximum Lyapunov exponent and parameter sensitivity shows that systems with marginal stability, which are regarded as systems at the edge of chaos, emerge when robustness against network perturbations is required. This emergence of the edge of chaos is a self-organization phenomenon and does not need a fine tuning of parameters. (paper)

Detecting and evaluating communities in complex human and biological networks

Science.gov (United States)

Morrison, Greg; Mahadevan, L.

2012-02-01

We develop a simple method for detecting the community structure in a network can by utilizing a measure of closeness between nodes. This approach readily leads to a method of coarse graining the network, which allows the detection of the natural hierarchy (or hierarchies) of community structure without appealing to an unknown resolution parameter. The closeness measure can also be used to evaluate the robustness of an individual node's assignment to its community (rather than evaluating only the quality of the global structure). Each of these methods in community detection and evaluation are illustrated using a variety of real world networks of either biological or sociological importance and illustrate the power and flexibility of the approach.

Networks In Real Space: Characteristics and Analysis for Biology and Mechanics

Science.gov (United States)

Modes, Carl; Magnasco, Marcelo; Katifori, Eleni

Functional networks embedded in physical space play a crucial role in countless biological and physical systems, from the efficient dissemination of oxygen, blood sugars, and hormonal signals in vascular systems to the complex relaying of informational signals in the brain to the distribution of stress and strain in architecture or static sand piles. Unlike their more-studied abstract cousins, such as the hyperlinked internet, social networks, or economic and financial connections, these networks are both constrained by and intimately connected to the physicality of their real, embedding space. We report on the results of new computational and analytic approaches tailored to these physical networks with particular implications and insights for mammalian organ vasculature.

From systems biology to photosynthesis and whole-plant physiology: a conceptual model for integrating multi-scale networks.

Science.gov (United States)

Weston, David J; Hanson, Paul J; Norby, Richard J; Tuskan, Gerald A; Wullschleger, Stan D

2012-02-01

Network analysis is now a common statistical tool for molecular biologists. Network algorithms are readily used to model gene, protein and metabolic correlations providing insight into pathways driving biological phenomenon. One output from such an analysis is a candidate gene list that can be responsible, in part, for the biological process of interest. The question remains, however, as to whether molecular network analysis can be used to inform process models at higher levels of biological organization. In our previous work, transcriptional networks derived from three plant species were constructed, interrogated for orthology and then correlated with photosynthetic inhibition at elevated temperature. One unique aspect of that study was the link from co-expression networks to net photosynthesis. In this addendum, we propose a conceptual model where traditional network analysis can be linked to whole-plant models thereby informing predictions on key processes such as photosynthesis, nutrient uptake and assimilation, and C partitioning.

An novel frequent probability pattern mining algorithm based on circuit simulation method in uncertain biological networks

Science.gov (United States)

2014-01-01

Background Motif mining has always been a hot research topic in bioinformatics. Most of current research on biological networks focuses on exact motif mining. However, due to the inevitable experimental error and noisy data, biological network data represented as the probability model could better reflect the authenticity and biological significance, therefore, it is more biological meaningful to discover probability motif in uncertain biological networks. One of the key steps in probability motif mining is frequent pattern discovery which is usually based on the possible world model having a relatively high computational complexity. Methods In this paper, we present a novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks. First, the partition based efficient search is applied to the non-tree like subgraph mining where the probability of occurrence in random networks is small. Then, an algorithm of probability isomorphic based on circuit simulation is proposed. The probability isomorphic combines the analysis of circuit topology structure with related physical properties of voltage in order to evaluate the probability isomorphism between probability subgraphs. The circuit simulation based probability isomorphic can avoid using traditional possible world model. Finally, based on the algorithm of probability subgraph isomorphism, two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probability patterns from the clusters. Results The experiment results on data sets of the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae show that the proposed method can efficiently discover the frequent probability subgraphs. The discovered subgraphs in our study contain all probability motifs reported in the experiments published in other related papers. Conclusions The algorithm of probability graph isomorphism

Analysis of complex networks from biology to linguistics

CERN Document Server

Dehmer, Matthias

2009-01-01

Mathematical problems such as graph theory problems are of increasing importance for the analysis of modelling data in biomedical research such as in systems biology, neuronal network modelling etc. This book follows a new approach of including graph theory from a mathematical perspective with specific applications of graph theory in biomedical and computational sciences. The book is written by renowned experts in the field and offers valuable background information for a wide audience.

A swarm intelligence framework for reconstructing gene networks: searching for biologically plausible architectures.

Science.gov (United States)

Kentzoglanakis, Kyriakos; Poole, Matthew

2012-01-01

In this paper, we investigate the problem of reverse engineering the topology of gene regulatory networks from temporal gene expression data. We adopt a computational intelligence approach comprising swarm intelligence techniques, namely particle swarm optimization (PSO) and ant colony optimization (ACO). In addition, the recurrent neural network (RNN) formalism is employed for modeling the dynamical behavior of gene regulatory systems. More specifically, ACO is used for searching the discrete space of network architectures and PSO for searching the corresponding continuous space of RNN model parameters. We propose a novel solution construction process in the context of ACO for generating biologically plausible candidate architectures. The objective is to concentrate the search effort into areas of the structure space that contain architectures which are feasible in terms of their topological resemblance to real-world networks. The proposed framework is initially applied to the reconstruction of a small artificial network that has previously been studied in the context of gene network reverse engineering. Subsequently, we consider an artificial data set with added noise for reconstructing a subnetwork of the genetic interaction network of S. cerevisiae (yeast). Finally, the framework is applied to a real-world data set for reverse engineering the SOS response system of the bacterium Escherichia coli. Results demonstrate the relative advantage of utilizing problem-specific knowledge regarding biologically plausible structural properties of gene networks over conducting a problem-agnostic search in the vast space of network architectures.

Exploitation of complex network topology for link prediction in biological interactomes

KAUST Repository

Alanis Lobato, Gregorio

2014-01-01

In this work, we propose three novel and powerful approaches for the prediction of interactions in biological networks and conclude that it is possible to mine the topology of these complex system representations and produce reliable

Stochastic noncooperative and cooperative evolutionary game strategies of a population of biological networks under natural selection.

Science.gov (United States)

Chen, Bor-Sen; Yeh, Chin-Hsun

2017-12-01

We review current static and dynamic evolutionary game strategies of biological networks and discuss the lack of random genetic variations and stochastic environmental disturbances in these models. To include these factors, a population of evolving biological networks is modeled as a nonlinear stochastic biological system with Poisson-driven genetic variations and random environmental fluctuations (stimuli). To gain insight into the evolutionary game theory of stochastic biological networks under natural selection, the phenotypic robustness and network evolvability of noncooperative and cooperative evolutionary game strategies are discussed from a stochastic Nash game perspective. The noncooperative strategy can be transformed into an equivalent multi-objective optimization problem and is shown to display significantly improved network robustness to tolerate genetic variations and buffer environmental disturbances, maintaining phenotypic traits for longer than the cooperative strategy. However, the noncooperative case requires greater effort and more compromises between partly conflicting players. Global linearization is used to simplify the problem of solving nonlinear stochastic evolutionary games. Finally, a simple stochastic evolutionary model of a metabolic pathway is simulated to illustrate the procedure of solving for two evolutionary game strategies and to confirm and compare their respective characteristics in the evolutionary process. Copyright © 2017 Elsevier B.V. All rights reserved.

Network Expansion and Pathway Enrichment Analysis towards Biologically Significant Findings from Microarrays

Directory of Open Access Journals (Sweden)

Wu Xiaogang

2012-06-01

Full Text Available In many cases, crucial genes show relatively slight changes between groups of samples (e.g. normal vs. disease, and many genes selected from microarray differential analysis by measuring the expression level statistically are also poorly annotated and lack of biological significance. In this paper, we present an innovative approach - network expansion and pathway enrichment analysis (NEPEA for integrative microarray analysis. We assume that organized knowledge will help microarray data analysis in significant ways, and the organized knowledge could be represented as molecular interaction networks or biological pathways. Based on this hypothesis, we develop the NEPEA framework based on network expansion from the human annotated and predicted protein interaction (HAPPI database, and pathway enrichment from the human pathway database (HPD. We use a recently-published microarray dataset (GSE24215 related to insulin resistance and type 2 diabetes (T2D as case study, since this study provided a thorough experimental validation for both genes and pathways identified computationally from classical microarray analysis and pathway analysis. We perform our NEPEA analysis for this dataset based on the results from the classical microarray analysis to identify biologically significant genes and pathways. Our findings are not only consistent with the original findings mostly, but also obtained more supports from other literatures.

Molecular codes in biological and chemical reaction networks.

Directory of Open Access Journals (Sweden)

Dennis Görlich

Full Text Available Shannon's theory of communication has been very successfully applied for the analysis of biological information. However, the theory neglects semantic and pragmatic aspects and thus cannot directly be applied to distinguish between (bio- chemical systems able to process "meaningful" information from those that do not. Here, we present a formal method to assess a system's semantic capacity by analyzing a reaction network's capability to implement molecular codes. We analyzed models of chemical systems (martian atmosphere chemistry and various combustion chemistries, biochemical systems (gene expression, gene translation, and phosphorylation signaling cascades, an artificial chemistry, and random reaction networks. Our study suggests that different chemical systems possess different semantic capacities. No semantic capacity was found in the model of the martian atmosphere chemistry, the studied combustion chemistries, and highly connected random networks, i.e. with these chemistries molecular codes cannot be implemented. High semantic capacity was found in the studied biochemical systems and in random reaction networks where the number of second order reactions is twice the number of species. We conclude that our approach can be applied to evaluate the information processing capabilities of a chemical system and may thus be a useful tool to understand the origin and evolution of meaningful information, e.g. in the context of the origin of life.

Intradomain Textures in Block Copolymers: Multizone Alignment and Biaxiality

Science.gov (United States)

Prasad, Ishan; Seo, Youngmi; Hall, Lisa M.; Grason, Gregory M.

2017-06-01

Block copolymer (BCP) melt assembly has been studied for decades, focusing largely on self-organized spatial patterns of periodically ordered segment density. Here, we demonstrate that underlying the well-known composition profiles (i.e., ordered lamella, cylinders, spheres, and networks) are generic and heterogeneous patterns of segment orientation that couple strongly to morphology, even in the absence of specific factors that promote intra or interchain segment alignment. We employ both self-consistent field theory and coarse-grained simulation methods to measure polar and nematic order parameters of segments in a freely jointed chain model of diblock melts. We show that BCP morphologies have a multizone texture, with segments predominantly aligned normal and parallel to interdomain interfaces in the respective brush and interfacial regions of the microdomain. Further, morphologies with anisotropically curved interfaces (i.e., cylinders and networks) exhibit biaxial order that is aligned to the principal curvature axes of the interface.

Physical limits of feedback noise-suppression in biological networks

International Nuclear Information System (INIS)

Zhang, Jiajun; Yuan, Zhanjiang; Zhou, Tianshou

2009-01-01

Feedback is a ubiquitous control mechanism of biological networks, and has also been identified in a variety of regulatory systems and organisms. It has been shown that, for a given gain and with negligible intrinsic noise, negative feedback impairs noise buffering whereas positive feedback enhances noise buffering. We further investigate the influence of negative and positive feedback on noise in output signals by considering both intrinsic and extrinsic noise as well as operator noise. We find that, while maintaining the system sensitivity, either there exists a minimum of the output noise intensity corresponding to a biologically feasible feedback strength, or the output noise intensity is a monotonic function of feedback strength bounded by both biological and dynamical constraints. In both cases, feedback noise-suppression is physically limited. In other words, noise suppressed by negative or positive feedback cannot be reduced without limitation even in the case of slow transcription

Building gene co-expression networks using transcriptomics data for systems biology investigations

DEFF Research Database (Denmark)

Kadarmideen, Haja; Watson-Haigh, Nathan S.

2012-01-01

Gene co-expression networks (GCN), built using high-throughput gene expression data are fundamental aspects of systems biology. The main aims of this study were to compare two popular approaches to building and analysing GCN. We use real ovine microarray transcriptomics datasets representing four......) is connected within a network. The two GCN construction methods used were, Weighted Gene Co-expression Network Analysis (WGCNA) and Partial Correlation and Information Theory (PCIT) methods. Nodes were ranked based on their connectivity measures in each of the four different networks created by WGCNA and PCIT...... (with > 20000 genes) access to large computer clusters, particularly those with larger amounts of shared memory is recommended....

Double network bacterial cellulose hydrogel to build a biology-device interface

Science.gov (United States)

Shi, Zhijun; Li, Ying; Chen, Xiuli; Han, Hongwei; Yang, Guang

2013-12-01

Establishing a biology-device interface might enable the interaction between microelectronics and biotechnology. In this study, electroactive hydrogels have been produced using bacterial cellulose (BC) and conducting polymer (CP) deposited on the BC hydrogel surface to cover the BC fibers. The structures of these composites thus have double networks, one of which is a layer of electroactive hydrogels combined with BC and CP. The electroconductivity provides the composites with capabilities for voltage and current response, and the BC hydrogel layer provides good biocompatibility, biodegradability, bioadhesion and mass transport properties. Such a system might allow selective biological functions such as molecular recognition and specific catalysis and also for probing the detailed genetic and molecular mechanisms of life. A BC-CP composite hydrogel could then lead to a biology-device interface. Cyclic voltammetry and electrochemical impedance spectroscopy (EIS) are used here to study the composite hydrogels' electroactive property. BC-PAni and BC-PPy respond to voltage changes. This provides a mechanism to amplify electrochemical signals for analysis or detection. BC hydrogels were found to be able to support the growth, spreading and migration of human normal skin fibroblasts without causing any cytotoxic effect on the cells in the cell culture. These double network BC-CP hydrogels are biphasic Janus hydrogels which integrate electroactivity with biocompatibility, and might provide a biology-device interface to produce implantable devices for personalized and regenerative medicine.

An attempt to understand glioma stem cell biology through centrality analysis of a protein interaction network.

Science.gov (United States)

Mallik, Mrinmay Kumar

2018-02-07

Biological networks can be analyzed using "Centrality Analysis" to identify the more influential nodes and interactions in the network. This study was undertaken to create and visualize a biological network comprising of protein-protein interactions (PPIs) amongst proteins which are preferentially over-expressed in glioma cancer stem cell component (GCSC) of glioblastomas as compared to the glioma non-stem cancer cell (GNSC) component and then to analyze this network through centrality analyses (CA) in order to identify the essential proteins in this network and their interactions. In addition, this study proposes a new centrality analysis method pertaining exclusively to transcription factors (TFs) and interactions amongst them. Moreover the relevant molecular functions, biological processes and biochemical pathways amongst these proteins were sought through enrichment analysis. A protein interaction network was created using a list of proteins which have been shown to be preferentially expressed or over-expressed in GCSCs isolated from glioblastomas as compared to the GNSCs. This list comprising of 38 proteins, created using manual literature mining, was submitted to the Reactome FIViz tool, a web based application integrated into Cytoscape, an open source software platform for visualizing and analyzing molecular interaction networks and biological pathways to produce the network. This network was subjected to centrality analyses utilizing ranked lists of six centrality measures using the FIViz application and (for the first time) a dedicated centrality analysis plug-in ; CytoNCA. The interactions exclusively amongst the transcription factors were nalyzed through a newly proposed centrality analysis method called "Gene Expression Associated Degree Centrality Analysis (GEADCA)". Enrichment analysis was performed using the "network function analysis" tool on Reactome. The CA was able to identify a small set of proteins with consistently high centrality ranks that

Integrated Network Analysis and Effective Tools in Plant Systems Biology

Directory of Open Access Journals (Sweden)

Atsushi eFukushima

2014-11-01

Full Text Available One of the ultimate goals in plant systems biology is to elucidate the genotype-phenotype relationship in plant cellular systems. Integrated network analysis that combines omics data with mathematical models has received particular attention. Here we focus on the latest cutting-edge computational advances that facilitate their combination. We highlight (1 network visualization tools, (2 pathway analyses, (3 genome-scale metabolic reconstruction, and (4 the integration of high-throughput experimental data and mathematical models. Multi-omics data that contain the genome, transcriptome, proteome, and metabolome and mathematical models are expected to integrate and expand our knowledge of complex plant metabolisms.

OmicsNet: a web-based tool for creation and visual analysis of biological networks in 3D space.

Science.gov (United States)

Zhou, Guangyan; Xia, Jianguo

2018-06-07

Biological networks play increasingly important roles in omics data integration and systems biology. Over the past decade, many excellent tools have been developed to support creation, analysis and visualization of biological networks. However, important limitations remain: most tools are standalone programs, the majority of them focus on protein-protein interaction (PPI) or metabolic networks, and visualizations often suffer from 'hairball' effects when networks become large. To help address these limitations, we developed OmicsNet - a novel web-based tool that allows users to easily create different types of molecular interaction networks and visually explore them in a three-dimensional (3D) space. Users can upload one or multiple lists of molecules of interest (genes/proteins, microRNAs, transcription factors or metabolites) to create and merge different types of biological networks. The 3D network visualization system was implemented using the powerful Web Graphics Library (WebGL) technology that works natively in most major browsers. OmicsNet supports force-directed layout, multi-layered perspective layout, as well as spherical layout to help visualize and navigate complex networks. A rich set of functions have been implemented to allow users to perform coloring, shading, topology analysis, and enrichment analysis. OmicsNet is freely available at http://www.omicsnet.ca.

MORE: mixed optimization for reverse engineering--an application to modeling biological networks response via sparse systems of nonlinear differential equations.

Science.gov (United States)

Sambo, Francesco; de Oca, Marco A Montes; Di Camillo, Barbara; Toffolo, Gianna; Stützle, Thomas

2012-01-01

Reverse engineering is the problem of inferring the structure of a network of interactions between biological variables from a set of observations. In this paper, we propose an optimization algorithm, called MORE, for the reverse engineering of biological networks from time series data. The model inferred by MORE is a sparse system of nonlinear differential equations, complex enough to realistically describe the dynamics of a biological system. MORE tackles separately the discrete component of the problem, the determination of the biological network topology, and the continuous component of the problem, the strength of the interactions. This approach allows us both to enforce system sparsity, by globally constraining the number of edges, and to integrate a priori information about the structure of the underlying interaction network. Experimental results on simulated and real-world networks show that the mixed discrete/continuous optimization approach of MORE significantly outperforms standard continuous optimization and that MORE is competitive with the state of the art in terms of accuracy of the inferred networks.

Color encoding in biologically-inspired convolutional neural networks.

Science.gov (United States)

Rafegas, Ivet; Vanrell, Maria

2018-05-11

Convolutional Neural Networks have been proposed as suitable frameworks to model biological vision. Some of these artificial networks showed representational properties that rival primate performances in object recognition. In this paper we explore how color is encoded in a trained artificial network. It is performed by estimating a color selectivity index for each neuron, which allows us to describe the neuron activity to a color input stimuli. The index allows us to classify whether they are color selective or not and if they are of a single or double color. We have determined that all five convolutional layers of the network have a large number of color selective neurons. Color opponency clearly emerges in the first layer, presenting 4 main axes (Black-White, Red-Cyan, Blue-Yellow and Magenta-Green), but this is reduced and rotated as we go deeper into the network. In layer 2 we find a denser hue sampling of color neurons and opponency is reduced almost to one new main axis, the Bluish-Orangish coinciding with the dataset bias. In layers 3, 4 and 5 color neurons are similar amongst themselves, presenting different type of neurons that detect specific colored objects (e.g., orangish faces), specific surrounds (e.g., blue sky) or specific colored or contrasted object-surround configurations (e.g. blue blob in a green surround). Overall, our work concludes that color and shape representation are successively entangled through all the layers of the studied network, revealing certain parallelisms with the reported evidences in primate brains that can provide useful insight into intermediate hierarchical spatio-chromatic representations. Copyright © 2018 Elsevier Ltd. All rights reserved.

Integrating external biological knowledge in the construction of regulatory networks from time-series expression data

Directory of Open Access Journals (Sweden)

Lo Kenneth

2012-08-01

Full Text Available Abstract Background Inference about regulatory networks from high-throughput genomics data is of great interest in systems biology. We present a Bayesian approach to infer gene regulatory networks from time series expression data by integrating various types of biological knowledge. Results We formulate network construction as a series of variable selection problems and use linear regression to model the data. Our method summarizes additional data sources with an informative prior probability distribution over candidate regression models. We extend the Bayesian model averaging (BMA variable selection method to select regulators in the regression framework. We summarize the external biological knowledge by an informative prior probability distribution over the candidate regression models. Conclusions We demonstrate our method on simulated data and a set of time-series microarray experiments measuring the effect of a drug perturbation on gene expression levels, and show that it outperforms leading regression-based methods in the literature.

CAFE: aCcelerated Alignment-FrEe sequence analysis.

Science.gov (United States)

Lu, Yang Young; Tang, Kujin; Ren, Jie; Fuhrman, Jed A; Waterman, Michael S; Sun, Fengzhu

2017-07-03

Alignment-free genome and metagenome comparisons are increasingly important with the development of next generation sequencing (NGS) technologies. Recently developed state-of-the-art k-mer based alignment-free dissimilarity measures including CVTree, $d_2^*$ and $d_2^S$ are more computationally expensive than measures based solely on the k-mer frequencies. Here, we report a standalone software, aCcelerated Alignment-FrEe sequence analysis (CAFE), for efficient calculation of 28 alignment-free dissimilarity measures. CAFE allows for both assembled genome sequences and unassembled NGS shotgun reads as input, and wraps the output in a standard PHYLIP format. In downstream analyses, CAFE can also be used to visualize the pairwise dissimilarity measures, including dendrograms, heatmap, principal coordinate analysis and network display. CAFE serves as a general k-mer based alignment-free analysis platform for studying the relationships among genomes and metagenomes, and is freely available at https://github.com/younglululu/CAFE. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

Validation of the CLIC alignment strategy on short range

CERN Document Server

Mainaud Durand, H; Griffet, S; Kemppinen, J; Rude, V; Sosin, M

2012-01-01

The pre-alignment of CLIC consists of aligning the components of linacs and beam delivery systems (BDS) in the most accurate possible way, so that a first pilot beam can circulate and allow the implementation of the beam based alignment. Taking into account the precision and accuracy needed: 10 µm rms over sliding windows of 200m, this pre-alignment must be active and it can be divided into two parts: the determination of a straight reference over 20 km, thanks to a metrological network and the determination of the component positions with respect to this reference, and their adjustment. The second part is the object of the paper, describing the steps of the proposed strategy: firstly the fiducialisation of the different components of CLIC; secondly, the alignment of these components on common supports and thirdly the active alignment of these supports using sensors and actuators. These steps have been validated on a test setup over a length of 4m, and the obtained results are analysed.

S100A4 and its role in metastasis – computational integration of data on biological networks.

Science.gov (United States)

Buetti-Dinh, Antoine; Pivkin, Igor V; Friedman, Ran

2015-08-01

Characterising signal transduction networks is fundamental to our understanding of biology. However, redundancy and different types of feedback mechanisms make it difficult to understand how variations of the network components contribute to a biological process. In silico modelling of signalling interactions therefore becomes increasingly useful for the development of successful therapeutic approaches. Unfortunately, quantitative information cannot be obtained for all of the proteins or complexes that comprise the network, which limits the usability of computational models. We developed a flexible computational framework for the analysis of biological signalling networks. We demonstrate our approach by studying the mechanism of metastasis promotion by the S100A4 protein, and suggest therapeutic strategies. The advantage of the proposed method is that only limited information (interaction type between species) is required to set up a steady-state network model. This permits a straightforward integration of experimental information where the lack of details are compensated by efficient sampling of the parameter space. We investigated regulatory properties of the S100A4 network and the role of different key components. The results show that S100A4 enhances the activity of matrix metalloproteinases (MMPs), causing higher cell dissociation. Moreover, it leads to an increased stability of the pathological state. Thus, avoiding metastasis in S100A4-expressing tumours requires multiple target inhibition. Moreover, the analysis could explain the previous failure of MMP inhibitors in clinical trials. Finally, our method is applicable to a wide range of biological questions that can be represented as directional networks.

Reverse engineering biological networks :applications in immune responses to bio-toxins.

Energy Technology Data Exchange (ETDEWEB)

Martino, Anthony A.; Sinclair, Michael B.; Davidson, George S.; Haaland, David Michael; Timlin, Jerilyn Ann; Thomas, Edward Victor; Slepoy, Alexander; Zhang, Zhaoduo; May, Elebeoba Eni; Martin, Shawn Bryan; Faulon, Jean-Loup Michel

2005-12-01

Our aim is to determine the network of events, or the regulatory network, that defines an immune response to a bio-toxin. As a model system, we are studying T cell regulatory network triggered through tyrosine kinase receptor activation using a combination of pathway stimulation and time-series microarray experiments. Our approach is composed of five steps (1) microarray experiments and data error analysis, (2) data clustering, (3) data smoothing and discretization, (4) network reverse engineering, and (5) network dynamics analysis and fingerprint identification. The technological outcome of this study is a suite of experimental protocols and computational tools that reverse engineer regulatory networks provided gene expression data. The practical biological outcome of this work is an immune response fingerprint in terms of gene expression levels. Inferring regulatory networks from microarray data is a new field of investigation that is no more than five years old. To the best of our knowledge, this work is the first attempt that integrates experiments, error analyses, data clustering, inference, and network analysis to solve a practical problem. Our systematic approach of counting, enumeration, and sampling networks matching experimental data is new to the field of network reverse engineering. The resulting mathematical analyses and computational tools lead to new results on their own and should be useful to others who analyze and infer networks.

CytoGEDEVO

DEFF Research Database (Denmark)

Malek, Maximilian; Ibragimov, Rashid; Albrecht, Mario

2016-01-01

MOTIVATION: In the systems biology era, high-throughput omics technologies have enabled the unraveling of the interplay of some biological entities on a large scale (e.g. genes, proteins, metabolites or RNAs). Huge biological networks have emerged, where nodes correspond to these entities and edges...... computational approaches have been developed previously to solve the network alignment problem, but only a few concentrate on the usability of the implemented tools for the evaluation of protein-protein interactions by the end-users (biologists and medical researchers). RESULTS: We have created Cyto......GEDEVO, a Cytoscape app for visual and user-assisted network alignment. It extends the previous GEDEVO methodology for global pairwise network alignments with new graphical and functional features. Our main focus was on the usability, even by non-programmers and the interpretability of the network alignment results...

Enhancement of COPD biological networks using a web-based collaboration interface [v2; ref status: indexed, http://f1000r.es/5ew

Directory of Open Access Journals (Sweden)

The sbv IMPROVER project team (in alphabetical order

2015-05-01

Full Text Available The construction and application of biological network models is an approach that offers a holistic way to understand biological processes involved in disease. Chronic obstructive pulmonary disease (COPD is a progressive inflammatory disease of the airways for which therapeutic options currently are limited after diagnosis, even in its earliest stage. COPD network models are important tools to better understand the biological components and processes underlying initial disease development. With the increasing amounts of literature that are now available, crowdsourcing approaches offer new forms of collaboration for researchers to review biological findings, which can be applied to the construction and verification of complex biological networks. We report the construction of 50 biological network models relevant to lung biology and early COPD using an integrative systems biology and collaborative crowd-verification approach. By combining traditional literature curation with a data-driven approach that predicts molecular activities from transcriptomics data, we constructed an initial COPD network model set based on a previously published non-diseased lung-relevant model set. The crowd was given the opportunity to enhance and refine the networks on a website (https://bionet.sbvimprover.com/ and to add mechanistic detail, as well as critically review existing evidence and evidence added by other users, so as to enhance the accuracy of the biological representation of the processes captured in the networks. Finally, scientists and experts in the field discussed and refined the networks during an in-person jamboree meeting. Here, we describe examples of the changes made to three of these networks: Neutrophil Signaling, Macrophage Signaling, and Th1-Th2 Signaling. We describe an innovative approach to biological network construction that combines literature and data mining and a crowdsourcing approach to generate a comprehensive set of COPD

Statistical assessment of crosstalk enrichment between gene groups in biological networks.

Science.gov (United States)

McCormack, Theodore; Frings, Oliver; Alexeyenko, Andrey; Sonnhammer, Erik L L

2013-01-01

Analyzing groups of functionally coupled genes or proteins in the context of global interaction networks has become an important aspect of bioinformatic investigations. Assessing the statistical significance of crosstalk enrichment between or within groups of genes can be a valuable tool for functional annotation of experimental gene sets. Here we present CrossTalkZ, a statistical method and software to assess the significance of crosstalk enrichment between pairs of gene or protein groups in large biological networks. We demonstrate that the standard z-score is generally an appropriate and unbiased statistic. We further evaluate the ability of four different methods to reliably recover crosstalk within known biological pathways. We conclude that the methods preserving the second-order topological network properties perform best. Finally, we show how CrossTalkZ can be used to annotate experimental gene sets using known pathway annotations and that its performance at this task is superior to gene enrichment analysis (GEA). CrossTalkZ (available at http://sonnhammer.sbc.su.se/download/software/CrossTalkZ/) is implemented in C++, easy to use, fast, accepts various input file formats, and produces a number of statistics. These include z-score, p-value, false discovery rate, and a test of normality for the null distributions.

DeDaL: Cytoscape 3 app for producing and morphing data-driven and structure-driven network layouts.

Science.gov (United States)

Czerwinska, Urszula; Calzone, Laurence; Barillot, Emmanuel; Zinovyev, Andrei

2015-08-14

Visualization and analysis of molecular profiling data together with biological networks are able to provide new mechanistic insights into biological functions. Currently, it is possible to visualize high-throughput data on top of pre-defined network layouts, but they are not always adapted to a given data analysis task. A network layout based simultaneously on the network structure and the associated multidimensional data might be advantageous for data visualization and analysis in some cases. We developed a Cytoscape app, which allows constructing biological network layouts based on the data from molecular profiles imported as values of node attributes. DeDaL is a Cytoscape 3 app, which uses linear and non-linear algorithms of dimension reduction to produce data-driven network layouts based on multidimensional data (typically gene expression). DeDaL implements several data pre-processing and layout post-processing steps such as continuous morphing between two arbitrary network layouts and aligning one network layout with respect to another one by rotating and mirroring. The combination of all these functionalities facilitates the creation of insightful network layouts representing both structural network features and correlation patterns in multivariate data. We demonstrate the added value of applying DeDaL in several practical applications, including an example of a large protein-protein interaction network. DeDaL is a convenient tool for applying data dimensionality reduction methods and for designing insightful data displays based on data-driven layouts of biological networks, built within Cytoscape environment. DeDaL is freely available for downloading at http://bioinfo-out.curie.fr/projects/dedal/.

Network analysis reveals stage-specific changes in zebrafish embryo development using time course whole transcriptome profiling and prior biological knowledge.

Science.gov (United States)

Zhang, Yuji

2015-01-01

Molecular networks act as the backbone of molecular activities within cells, offering a unique opportunity to better understand the mechanism of diseases. While network data usually constitute only static network maps, integrating them with time course gene expression information can provide clues to the dynamic features of these networks and unravel the mechanistic driver genes characterizing cellular responses. Time course gene expression data allow us to broadly "watch" the dynamics of the system. However, one challenge in the analysis of such data is to establish and characterize the interplay among genes that are altered at different time points in the context of a biological process or functional category. Integrative analysis of these data sources will lead us a more complete understanding of how biological entities (e.g., genes and proteins) coordinately perform their biological functions in biological systems. In this paper, we introduced a novel network-based approach to extract functional knowledge from time-dependent biological processes at a system level using time course mRNA sequencing data in zebrafish embryo development. The proposed method was applied to investigate 1α, 25(OH)2D3-altered mechanisms in zebrafish embryo development. We applied the proposed method to a public zebrafish time course mRNA-Seq dataset, containing two different treatments along four time points. We constructed networks between gene ontology biological process categories, which were enriched in differential expressed genes between consecutive time points and different conditions. The temporal propagation of 1α, 25-Dihydroxyvitamin D3-altered transcriptional changes started from a few genes that were altered initially at earlier stage, to large groups of biological coherent genes at later stages. The most notable biological processes included neuronal and retinal development and generalized stress response. In addition, we also investigated the relationship among

Precise synaptic efficacy alignment suggests potentiation dominated learning

Directory of Open Access Journals (Sweden)

Christoph eHartmann

2016-01-01

Full Text Available Recent evidence suggests that parallel synapses from the same axonal branch onto the same dendritic branch have almost identical strength. It has been proposed that this alignment is only possible through learning rules that integrate activity over long time spans. However, learning mechanisms such as spike-timing-dependent plasticity (STDP are commonly assumed to be temporally local. Here, we propose that the combination of temporally local STDP and a multiplicative synaptic normalization mechanism is sufficient to explain the alignment of parallel synapses.To address this issue, we introduce three increasingly complex models: First, we model the idealized interaction of STDP and synaptic normalization in a single neuron as a simple stochastic process and derive analytically that the alignment effect can be described by a so-called Kesten process. From this we can derive that synaptic efficacy alignment requires potentiation-dominated learning regimes. We verify these conditions in a single-neuron model with independent spiking activities but more realistic synapses. As expected, we only observe synaptic efficacy alignment for long-term potentiation-biased STDP. Finally, we explore how well the findings transfer to recurrent neural networks where the learning mechanisms interact with the correlated activity of the network. We find that due to the self-reinforcing correlations in recurrent circuits under STDP, alignment occurs for both long-term potentiation- and depression-biased STDP, because the learning will be potentiation dominated in both cases due to the potentiating events induced by correlated activity. This is in line with recent results demonstrating a dominance of potentiation over depression during waking and normalization during sleep. This leads us to predict that individual spine pairs will be more similar in the morning than they are after sleep depriviation.In conclusion, we show that synaptic normalization in conjunction with

Mechanical property and biological performance of electrospun silk fibroin-polycaprolactone scaffolds with aligned fibers.

Science.gov (United States)

Yuan, Han; Shi, Hongfei; Qiu, Xushen; Chen, Yixin

2016-01-01

The mechanical strength, biocompatibility, and sterilizability of silk fibroin allow it to be a possible candidate as a natural bone regenerate material. To improve mechanical character and reinforce the cell movement induction, silk fibroin (SF)-polycaprolactone (PCL) alloy was fabricated by electrospinning techniques with a rotating collector to form aligned fibrous scaffolds and random-oriented scaffolds. The scanning electron microscope image of the scaffold and the mechanical properties of the scaffold were investigated by tensile mechanical tests, which were compared to random-oriented scaffolds. Furthermore, mesenchymal stem cells were planted on these scaffolds to investigate the biocompatibility, elongation, and cell movement in situ. Scanning electron microscopy shows that 91% fibers on the aligned fibroin scaffold were distributed between the dominant direction ±10°. With an ideal support for stem cell proliferation in vitro, the aligned fibrous scaffold induces cell elongation at a length of 236.46 ± 82 μm and distribution along the dominant fiber direction with a cell alignment angle at 6.57° ± 4.45°. Compared with random-oriented scaffolds made by artificial materials, aligned SF-PCL scaffolds could provide a moderate mesenchymal stem cell engraftment interface and speed up early stage cell movement toward the bone defect.

Biologically plausible learning in neural networks: a lesson from bacterial chemotaxis.

Science.gov (United States)

Shimansky, Yury P

2009-12-01

Learning processes in the brain are usually associated with plastic changes made to optimize the strength of connections between neurons. Although many details related to biophysical mechanisms of synaptic plasticity have been discovered, it is unclear how the concurrent performance of adaptive modifications in a huge number of spatial locations is organized to minimize a given objective function. Since direct experimental observation of even a relatively small subset of such changes is not feasible, computational modeling is an indispensable investigation tool for solving this problem. However, the conventional method of error back-propagation (EBP) employed for optimizing synaptic weights in artificial neural networks is not biologically plausible. This study based on computational experiments demonstrated that such optimization can be performed rather efficiently using the same general method that bacteria employ for moving closer to an attractant or away from a repellent. With regard to neural network optimization, this method consists of regulating the probability of an abrupt change in the direction of synaptic weight modification according to the temporal gradient of the objective function. Neural networks utilizing this method (regulation of modification probability, RMP) can be viewed as analogous to swimming in the multidimensional space of their parameters in the flow of biochemical agents carrying information about the optimality criterion. The efficiency of RMP is comparable to that of EBP, while RMP has several important advantages. Since the biological plausibility of RMP is beyond a reasonable doubt, the RMP concept provides a constructive framework for the experimental analysis of learning in natural neural networks.

Aligning protein sequence and analysing substitution pattern using ...

Indian Academy of Sciences (India)

Prakash

Aligning protein sequences using a score matrix has became a routine but valuable method in modern biological ..... the amino acids according to their substitution behaviour ...... which may cause great change (e.g. prolonging the helix) in.

MANGO: a new approach to multiple sequence alignment.

Science.gov (United States)

Zhang, Zefeng; Lin, Hao; Li, Ming

2007-01-01

Multiple sequence alignment is a classical and challenging task for biological sequence analysis. The problem is NP-hard. The full dynamic programming takes too much time. The progressive alignment heuristics adopted by most state of the art multiple sequence alignment programs suffer from the 'once a gap, always a gap' phenomenon. Is there a radically new way to do multiple sequence alignment? This paper introduces a novel and orthogonal multiple sequence alignment method, using multiple optimized spaced seeds and new algorithms to handle these seeds efficiently. Our new algorithm processes information of all sequences as a whole, avoiding problems caused by the popular progressive approaches. Because the optimized spaced seeds are provably significantly more sensitive than the consecutive k-mers, the new approach promises to be more accurate and reliable. To validate our new approach, we have implemented MANGO: Multiple Alignment with N Gapped Oligos. Experiments were carried out on large 16S RNA benchmarks showing that MANGO compares favorably, in both accuracy and speed, against state-of-art multiple sequence alignment methods, including ClustalW 1.83, MUSCLE 3.6, MAFFT 5.861, Prob-ConsRNA 1.11, Dialign 2.2.1, DIALIGN-T 0.2.1, T-Coffee 4.85, POA 2.0 and Kalign 2.0.

eMatchSite: sequence order-independent structure alignments of ligand binding pockets in protein models.

Directory of Open Access Journals (Sweden)

Michal Brylinski

2014-09-01

Full Text Available Detecting similarities between ligand binding sites in the absence of global homology between target proteins has been recognized as one of the critical components of modern drug discovery. Local binding site alignments can be constructed using sequence order-independent techniques, however, to achieve a high accuracy, many current algorithms for binding site comparison require high-quality experimental protein structures, preferably in the bound conformational state. This, in turn, complicates proteome scale applications, where only various quality structure models are available for the majority of gene products. To improve the state-of-the-art, we developed eMatchSite, a new method for constructing sequence order-independent alignments of ligand binding sites in protein models. Large-scale benchmarking calculations using adenine-binding pockets in crystal structures demonstrate that eMatchSite generates accurate alignments for almost three times more protein pairs than SOIPPA. More importantly, eMatchSite offers a high tolerance to structural distortions in ligand binding regions in protein models. For example, the percentage of correctly aligned pairs of adenine-binding sites in weakly homologous protein models is only 4-9% lower than those aligned using crystal structures. This represents a significant improvement over other algorithms, e.g. the performance of eMatchSite in recognizing similar binding sites is 6% and 13% higher than that of SiteEngine using high- and moderate-quality protein models, respectively. Constructing biologically correct alignments using predicted ligand binding sites in protein models opens up the possibility to investigate drug-protein interaction networks for complete proteomes with prospective systems-level applications in polypharmacology and rational drug repositioning. eMatchSite is freely available to the academic community as a web-server and a stand-alone software distribution at http://www.brylinski.org/ematchsite.

Protein alignment algorithms with an efficient backtracking routine on multiple GPUs

Directory of Open Access Journals (Sweden)

Kierzynka Michal

2011-05-01

Full Text Available Abstract Background Pairwise sequence alignment methods are widely used in biological research. The increasing number of sequences is perceived as one of the upcoming challenges for sequence alignment methods in the nearest future. To overcome this challenge several GPU (Graphics Processing Unit computing approaches have been proposed lately. These solutions show a great potential of a GPU platform but in most cases address the problem of sequence database scanning and computing only the alignment score whereas the alignment itself is omitted. Thus, the need arose to implement the global and semiglobal Needleman-Wunsch, and Smith-Waterman algorithms with a backtracking procedure which is needed to construct the alignment. Results In this paper we present the solution that performs the alignment of every given sequence pair, which is a required step for progressive multiple sequence alignment methods, as well as for DNA recognition at the DNA assembly stage. Performed tests show that the implementation, with performance up to 6.3 GCUPS on a single GPU for affine gap penalties, is very efficient in comparison to other CPU and GPU-based solutions. Moreover, multiple GPUs support with load balancing makes the application very scalable. Conclusions The article shows that the backtracking procedure of the sequence alignment algorithms may be designed to fit in with the GPU architecture. Therefore, our algorithm, apart from scores, is able to compute pairwise alignments. This opens a wide range of new possibilities, allowing other methods from the area of molecular biology to take advantage of the new computational architecture. Performed tests show that the efficiency of the implementation is excellent. Moreover, the speed of our GPU-based algorithms can be almost linearly increased when using more than one graphics card.

A Multilevel Gamma-Clustering Layout Algorithm for Visualization of Biological Networks

Science.gov (United States)

Hruz, Tomas; Lucas, Christoph; Laule, Oliver; Zimmermann, Philip

2013-01-01

Visualization of large complex networks has become an indispensable part of systems biology, where organisms need to be considered as one complex system. The visualization of the corresponding network is challenging due to the size and density of edges. In many cases, the use of standard visualization algorithms can lead to high running times and poorly readable visualizations due to many edge crossings. We suggest an approach that analyzes the structure of the graph first and then generates a new graph which contains specific semantic symbols for regular substructures like dense clusters. We propose a multilevel gamma-clustering layout visualization algorithm (MLGA) which proceeds in three subsequent steps: (i) a multilevel γ-clustering is used to identify the structure of the underlying network, (ii) the network is transformed to a tree, and (iii) finally, the resulting tree which shows the network structure is drawn using a variation of a force-directed algorithm. The algorithm has a potential to visualize very large networks because it uses modern clustering heuristics which are optimized for large graphs. Moreover, most of the edges are removed from the visual representation which allows keeping the overview over complex graphs with dense subgraphs. PMID:23864855

Towards the prediction of essential genes by integration of network topology, cellular localization and biological process information

Directory of Open Access Journals (Sweden)

Lemke Ney

2009-09-01

Full Text Available Abstract Background The identification of essential genes is important for the understanding of the minimal requirements for cellular life and for practical purposes, such as drug design. However, the experimental techniques for essential genes discovery are labor-intensive and time-consuming. Considering these experimental constraints, a computational approach capable of accurately predicting essential genes would be of great value. We therefore present here a machine learning-based computational approach relying on network topological features, cellular localization and biological process information for prediction of essential genes. Results We constructed a decision tree-based meta-classifier and trained it on datasets with individual and grouped attributes-network topological features, cellular compartments and biological processes-to generate various predictors of essential genes. We showed that the predictors with better performances are those generated by datasets with integrated attributes. Using the predictor with all attributes, i.e., network topological features, cellular compartments and biological processes, we obtained the best predictor of essential genes that was then used to classify yeast genes with unknown essentiality status. Finally, we generated decision trees by training the J48 algorithm on datasets with all network topological features, cellular localization and biological process information to discover cellular rules for essentiality. We found that the number of protein physical interactions, the nuclear localization of proteins and the number of regulating transcription factors are the most important factors determining gene essentiality. Conclusion We were able to demonstrate that network topological features, cellular localization and biological process information are reliable predictors of essential genes. Moreover, by constructing decision trees based on these data, we could discover cellular rules governing

A framework to find the logic backbone of a biological network.

Science.gov (United States)

Maheshwari, Parul; Albert, Réka

2017-12-06

Cellular behaviors are governed by interaction networks among biomolecules, for example gene regulatory and signal transduction networks. An often used dynamic modeling framework for these networks, Boolean modeling, can obtain their attractors (which correspond to cell types and behaviors) and their trajectories from an initial state (e.g. a resting state) to the attractors, for example in response to an external signal. The existing methods however do not elucidate the causal relationships between distant nodes in the network. In this work, we propose a simple logic framework, based on categorizing causal relationships as sufficient or necessary, as a complement to Boolean networks. We identify and explore the properties of complex subnetworks that are distillable into a single logic relationship. We also identify cyclic subnetworks that ensure the stabilization of the state of participating nodes regardless of the rest of the network. We identify the logic backbone of biomolecular networks, consisting of external signals, self-sustaining cyclic subnetworks (stable motifs), and output nodes. Furthermore, we use the logic framework to identify crucial nodes whose override can drive the system from one steady state to another. We apply these techniques to two biological networks: the epithelial-to-mesenchymal transition network corresponding to a developmental process exploited in tumor invasion, and the network of abscisic acid induced stomatal closure in plants. We find interesting subnetworks with logical implications in these networks. Using these subgraphs and motifs, we efficiently reduce both networks to succinct backbone structures. The logic representation identifies the causal relationships between distant nodes and subnetworks. This knowledge can form the basis of network control or used in the reverse engineering of networks.

Mobile and replicated alignment of arrays in data-parallel programs

Science.gov (United States)

Chatterjee, Siddhartha; Gilbert, John R.; Schreiber, Robert

1993-01-01

When a data-parallel language like FORTRAN 90 is compiled for a distributed-memory machine, aggregate data objects (such as arrays) are distributed across the processor memories. The mapping determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: first, an alignment that maps all the objects to an abstract template, and then a distribution that maps the template to the processors. We solve two facets of the problem of finding alignments that reduce residual communication: we determine alignments that vary in loops, and objects that should have replicated alignments. We show that loop-dependent mobile alignment is sometimes necessary for optimum performance, and we provide algorithms with which a compiler can determine good mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself (via spread operations) or can be used to improve performance. We propose an algorithm based on network flow that determines which objects to replicate so as to minimize the total amount of broadcast communication in replication. This work on mobile and replicated alignment extends our earlier work on determining static alignment.

Modeling electrical conductivities of nanocomposites with aligned carbon nanotubes

International Nuclear Information System (INIS)

Bao, W S; Meguid, S A; Zhu, Z H; Meguid, M J

2011-01-01

We have developed an improved three-dimensional (3D) percolation model to investigate the effect of the alignment of carbon nanotubes (CNTs) on the electrical conductivity of nanocomposites. In this model, both intrinsic and contact resistances are considered, and a new method of resistor network recognition that employs periodically connective paths is developed. This method leads to a reduction in the size effect of the representative cuboid in our Monte Carlo simulations. With this new technique, we were able to effectively analyze the effects of the CNT alignment upon the electrical conductivity of nanocomposites. Our model predicted that the peak value of the conductivity occurs for partially aligned rather than perfectly aligned CNTs. It has also identified the value of the peak and the corresponding alignment for different volume fractions of CNTs. Our model works well for both multi-wall CNTs (MWCNTs) and single-wall CNTs (SWCNTs), and the numerical results show a quantitative agreement with existing experimental observations.

A Network Biology Approach to Discover the Molecular Biomarker Associated with Hepatocellular Carcinoma

Directory of Open Access Journals (Sweden)

Liwei Zhuang

2014-01-01

Full Text Available In recent years, high throughput technologies such as microarray platform have provided a new avenue for hepatocellular carcinoma (HCC investigation. Traditionally, gene sets enrichment analysis of survival related genes is commonly used to reveal the underlying functional mechanisms. However, this approach usually produces too many candidate genes and cannot discover detailed signaling transduction cascades, which greatly limits their clinical application such as biomarker development. In this study, we have proposed a network biology approach to discover novel biomarkers from multidimensional omics data. This approach effectively combines clinical survival data with topological characteristics of human protein interaction networks and patients expression profiling data. It can produce novel network based biomarkers together with biological understanding of molecular mechanism. We have analyzed eighty HCC expression profiling arrays and identified that extracellular matrix and programmed cell death are the main themes related to HCC progression. Compared with traditional enrichment analysis, this approach can provide concrete and testable hypothesis on functional mechanism. Furthermore, the identified subnetworks can potentially be used as suitable targets for therapeutic intervention in HCC.

Aligning Metabolic Pathways Exploiting Binary Relation of Reactions.

Directory of Open Access Journals (Sweden)

Yiran Huang

Full Text Available Metabolic pathway alignment has been widely used to find one-to-one and/or one-to-many reaction mappings to identify the alternative pathways that have similar functions through different sets of reactions, which has important applications in reconstructing phylogeny and understanding metabolic functions. The existing alignment methods exhaustively search reaction sets, which may become infeasible for large pathways. To address this problem, we present an effective alignment method for accurately extracting reaction mappings between two metabolic pathways. We show that connected relation between reactions can be formalized as binary relation of reactions in metabolic pathways, and the multiplications of zero-one matrices for binary relations of reactions can be accomplished in finite steps. By utilizing the multiplications of zero-one matrices for binary relation of reactions, we efficiently obtain reaction sets in a small number of steps without exhaustive search, and accurately uncover biologically relevant reaction mappings. Furthermore, we introduce a measure of topological similarity of nodes (reactions by comparing the structural similarity of the k-neighborhood subgraphs of the nodes in aligning metabolic pathways. We employ this similarity metric to improve the accuracy of the alignments. The experimental results on the KEGG database show that when compared with other state-of-the-art methods, in most cases, our method obtains better performance in the node correctness and edge correctness, and the number of the edges of the largest common connected subgraph for one-to-one reaction mappings, and the number of correct one-to-many reaction mappings. Our method is scalable in finding more reaction mappings with better biological relevance in large metabolic pathways.

Biologically Inspired Intercellular Slot Synchronization

Directory of Open Access Journals (Sweden)

Alexander Tyrrell

2009-01-01

Full Text Available The present article develops a decentralized interbase station slot synchronization algorithm suitable for cellular mobile communication systems. The proposed cellular firefly synchronization (CelFSync algorithm is derived from the theory of pulse-coupled oscillators, common to describe synchronization phenomena in biological systems, such as the spontaneous synchronization of fireflies. In order to maintain synchronization among base stations (BSs, even when there is no direct link between adjacent BSs, some selected user terminals (UTs participate in the network synchronization process. Synchronization emerges by exchanging two distinct synchronization words, one transmitted by BSs and the other by active UTs, without any a priori assumption on the initial timing misalignments of BSs and UTs. In large-scale networks with inter-BS site distances up to a few kilometers, propagation delays severely affect the attainable timing accuracy of CelFSync. We show that by an appropriate combination of CelFSync with the timing advance procedure, which aligns uplink transmission of UTs to arrive simultaneously at the BS, a timing accuracy within a fraction of the inter-BS propagation delay is retained.

Using Variable-Length Aligned Fragment Pairs and an Improved Transition Function for Flexible Protein Structure Alignment.

Science.gov (United States)

Cao, Hu; Lu, Yonggang

2017-01-01

With the rapid growth of known protein 3D structures in number, how to efficiently compare protein structures becomes an essential and challenging problem in computational structural biology. At present, many protein structure alignment methods have been developed. Among all these methods, flexible structure alignment methods are shown to be superior to rigid structure alignment methods in identifying structure similarities between proteins, which have gone through conformational changes. It is also found that the methods based on aligned fragment pairs (AFPs) have a special advantage over other approaches in balancing global structure similarities and local structure similarities. Accordingly, we propose a new flexible protein structure alignment method based on variable-length AFPs. Compared with other methods, the proposed method possesses three main advantages. First, it is based on variable-length AFPs. The length of each AFP is separately determined to maximally represent a local similar structure fragment, which reduces the number of AFPs. Second, it uses local coordinate systems, which simplify the computation at each step of the expansion of AFPs during the AFP identification. Third, it decreases the number of twists by rewarding the situation where nonconsecutive AFPs share the same transformation in the alignment, which is realized by dynamic programming with an improved transition function. The experimental data show that compared with FlexProt, FATCAT, and FlexSnap, the proposed method can achieve comparable results by introducing fewer twists. Meanwhile, it can generate results similar to those of the FATCAT method in much less running time due to the reduced number of AFPs.

Loosening the shackles of scientific disciplines with network science. Reply to comments on "Network science of biological systems at different scales: A review"

Science.gov (United States)

Gosak, Marko; Markovič, Rene; Dolenšek, Jurij; Rupnik, Marjan Slak; Marhl, Marko; Stožer, Andraž; Perc, Matjaž

2018-03-01

We would like to thank all the experts for their insightful and very interesting comments that have been submitted in response to our review "Network science of biological systems at different scales" [1]. We are delighted with the number of comments that have been written, and even more so with the positive opinions that these comments communicate to the wider audience [2-9]. Although methods of network science have long proven their value in relevantly addressing various challenges in the biological sciences, such interdisciplinary research often still struggles for funding and recognition at many academic levels.

Recapitulating phylogenies using k-mers: from trees to networks.

Science.gov (United States)

Bernard, Guillaume; Ragan, Mark A; Chan, Cheong Xin

2016-01-01

Ernst Haeckel based his landmark Tree of Life on the supposed ontogenic recapitulation of phylogeny, i.e. that successive embryonic stages during the development of an organism re-trace the morphological forms of its ancestors over the course of evolution. Much of this idea has since been discredited. Today, phylogenies are often based on families of molecular sequences. The standard approach starts with a multiple sequence alignment, in which the sequences are arranged relative to each other in a way that maximises a measure of similarity position-by-position along their entire length. A tree (or sometimes a network) is then inferred. Rigorous multiple sequence alignment is computationally demanding, and evolutionary processes that shape the genomes of many microbes (bacteria, archaea and some morphologically simple eukaryotes) can add further complications. In particular, recombination, genome rearrangement and lateral genetic transfer undermine the assumptions that underlie multiple sequence alignment, and imply that a tree-like structure may be too simplistic. Here, using genome sequences of 143 bacterial and archaeal genomes, we construct a network of phylogenetic relatedness based on the number of shared k -mers (subsequences at fixed length k ). Our findings suggest that the network captures not only key aspects of microbial genome evolution as inferred from a tree, but also features that are not treelike. The method is highly scalable, allowing for investigation of genome evolution across a large number of genomes. Instead of using specific regions or sequences from genome sequences, or indeed Haeckel's idea of ontogeny, we argue that genome phylogenies can be inferred using k -mers from whole-genome sequences. Representing these networks dynamically allows biological questions of interest to be formulated and addressed quickly and in a visually intuitive manner.

Logic-based models in systems biology: a predictive and parameter-free network analysis method.

Science.gov (United States)

Wynn, Michelle L; Consul, Nikita; Merajver, Sofia D; Schnell, Santiago

2012-11-01

Highly complex molecular networks, which play fundamental roles in almost all cellular processes, are known to be dysregulated in a number of diseases, most notably in cancer. As a consequence, there is a critical need to develop practical methodologies for constructing and analysing molecular networks at a systems level. Mathematical models built with continuous differential equations are an ideal methodology because they can provide a detailed picture of a network's dynamics. To be predictive, however, differential equation models require that numerous parameters be known a priori and this information is almost never available. An alternative dynamical approach is the use of discrete logic-based models that can provide a good approximation of the qualitative behaviour of a biochemical system without the burden of a large parameter space. Despite their advantages, there remains significant resistance to the use of logic-based models in biology. Here, we address some common concerns and provide a brief tutorial on the use of logic-based models, which we motivate with biological examples.

Installation and alignment of the DAΦNE accelerators

International Nuclear Information System (INIS)

Biscari, C.; Sgamma, F.

1998-01-01

Installation, alignment and survey of the magnetic elements and vacuum chambers of DAΦNE are described. The networks of the Damping Ring and two Main Rings are described, focusing the techniques chosen to obtain the required precision. A description of the mechanical measurements, coupled to the magnetic ones, to refer the magnetic axis of quadrupoles and sextupoles to their fiducial is underlined: emPHIasis is put on the strategy to couple precision with quickness. The results of first PHIase alignment job and its refinement are analyzed using the orbit measurement

VANESA - A Software Application for the Visualization and Analysis of Networks in Systems Biology Applications

Directory of Open Access Journals (Sweden)

Brinkrolf Christoph

2014-06-01

Full Text Available VANESA is a modeling software for the automatic reconstruction and analysis of biological networks based on life-science database information. Using VANESA, scientists are able to model any kind of biological processes and systems as biological networks. It is now possible for scientists to automatically reconstruct important molecular systems with information from the databases KEGG, MINT, IntAct, HPRD, and BRENDA. Additionally, experimental results can be expanded with database information to better analyze the investigated elements and processes in an overall context. Users also have the possibility to use graph theoretical approaches in VANESA to identify regulatory structures and significant actors within the modeled systems. These structures can then be further investigated in the Petri net environment of VANESA. It is platform-independent, free-of-charge, and available at http://vanesa.sf.net.

Root Systems Biology: Integrative Modeling across Scales, from Gene Regulatory Networks to the Rhizosphere1

Science.gov (United States)

Hill, Kristine; Porco, Silvana; Lobet, Guillaume; Zappala, Susan; Mooney, Sacha; Draye, Xavier; Bennett, Malcolm J.

2013-01-01

Genetic and genomic approaches in model organisms have advanced our understanding of root biology over the last decade. Recently, however, systems biology and modeling have emerged as important approaches, as our understanding of root regulatory pathways has become more complex and interpreting pathway outputs has become less intuitive. To relate root genotype to phenotype, we must move beyond the examination of interactions at the genetic network scale and employ multiscale modeling approaches to predict emergent properties at the tissue, organ, organism, and rhizosphere scales. Understanding the underlying biological mechanisms and the complex interplay between systems at these different scales requires an integrative approach. Here, we describe examples of such approaches and discuss the merits of developing models to span multiple scales, from network to population levels, and to address dynamic interactions between plants and their environment. PMID:24143806

A Novel Joint Spatial-Code Clustered Interference Alignment Scheme for Large-Scale Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zhilu Wu

2015-01-01

Full Text Available Interference alignment (IA has been put forward as a promising technique which can mitigate interference and effectively increase the throughput of wireless sensor networks (WSNs. However, the number of users is strictly restricted by the IA feasibility condition, and the interference leakage will become so strong that the quality of service will degrade significantly when there are more users than that IA can support. In this paper, a novel joint spatial-code clustered (JSCC-IA scheme is proposed to solve this problem. In the proposed scheme, the users are clustered into several groups so that feasible IA can be achieved within each group. In addition, each group is assigned a pseudo noise (PN code in order to suppress the inter-group interference via the code dimension. The analytical bit error rate (BER expressions of the proposed JSCC-IA scheme are formulated for the systems with identical and different propagation delays, respectively. To further improve the performance of the JSCC-IA scheme in asymmetric networks, a random grouping selection (RGS algorithm is developed to search for better grouping combinations. Numerical results demonstrate that the proposed JSCC-IA scheme is capable of accommodating many more users to communicate simultaneously in the same frequency band with better performance.

TCS: a new multiple sequence alignment reliability measure to estimate alignment accuracy and improve phylogenetic tree reconstruction.

Science.gov (United States)

Chang, Jia-Ming; Di Tommaso, Paolo; Notredame, Cedric

2014-06-01

Multiple sequence alignment (MSA) is a key modeling procedure when analyzing biological sequences. Homology and evolutionary modeling are the most common applications of MSAs. Both are known to be sensitive to the underlying MSA accuracy. In this work, we show how this problem can be partly overcome using the transitive consistency score (TCS), an extended version of the T-Coffee scoring scheme. Using this local evaluation function, we show that one can identify the most reliable portions of an MSA, as judged from BAliBASE and PREFAB structure-based reference alignments. We also show how this measure can be used to improve phylogenetic tree reconstruction using both an established simulated data set and a novel empirical yeast data set. For this purpose, we describe a novel lossless alternative to site filtering that involves overweighting the trustworthy columns. Our approach relies on the T-Coffee framework; it uses libraries of pairwise alignments to evaluate any third party MSA. Pairwise projections can be produced using fast or slow methods, thus allowing a trade-off between speed and accuracy. We compared TCS with Heads-or-Tails, GUIDANCE, Gblocks, and trimAl and found it to lead to significantly better estimates of structural accuracy and more accurate phylogenetic trees. The software is available from www.tcoffee.org/Projects/tcs. © The Author 2014. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Aligning physical learning spaces with the curriculum: AMEE Guide No. 107.

Science.gov (United States)

Nordquist, Jonas; Sundberg, Kristina; Laing, Andrew

2016-08-01

This Guide explores emerging issues on the alignment of learning spaces with the changing curriculum in medical education. As technology and new teaching methods have altered the nature of learning in medical education, it is necessary to re-think how physical learning spaces are aligned with the curriculum. The better alignment of learning spaces with the curriculum depends on more directly engaged leadership from faculty and the community of medical education for briefing the requirements for the design of all kinds of learning spaces. However, there is a lack of precedent and well-established processes as to how new kinds of learning spaces should be programmed. Such programmes are essential aspects of optimizing the intended experience of the curriculum. Faculty and the learning community need better tools and instruments to support their leadership role in briefing and programming. A Guide to critical concepts for exploring the alignment of curriculum and learning spaces is provided. The idea of a networked learning landscape is introduced as a way of assessing and evaluating the alignment of physical spaces to the emerging curriculum. The concept is used to explore how technology has widened the range of spaces and places in which learning happens as well as enabling new styles of learning. The networked learning landscaped is explored through four different scales within which learning is accommodated: the classroom, the building, the campus, and the city. High-level guidance on the process of briefing for the networked learning landscape is provided, to take into account the wider scale of learning spaces and the impact of technology. Key to a successful measurement process is argued to be the involvement of relevant academic stakeholders who can identify the strategic direction and purpose for the design of the learning environments in relation to the emerging demands of the curriculum.

CellNetVis: a web tool for visualization of biological networks using force-directed layout constrained by cellular components.

Science.gov (United States)

Heberle, Henry; Carazzolle, Marcelo Falsarella; Telles, Guilherme P; Meirelles, Gabriela Vaz; Minghim, Rosane

2017-09-13

The advent of "omics" science has brought new perspectives in contemporary biology through the high-throughput analyses of molecular interactions, providing new clues in protein/gene function and in the organization of biological pathways. Biomolecular interaction networks, or graphs, are simple abstract representations where the components of a cell (e.g. proteins, metabolites etc.) are represented by nodes and their interactions are represented by edges. An appropriate visualization of data is crucial for understanding such networks, since pathways are related to functions that occur in specific regions of the cell. The force-directed layout is an important and widely used technique to draw networks according to their topologies. Placing the networks into cellular compartments helps to quickly identify where network elements are located and, more specifically, concentrated. Currently, only a few tools provide the capability of visually organizing networks by cellular compartments. Most of them cannot handle large and dense networks. Even for small networks with hundreds of nodes the available tools are not able to reposition the network while the user is interacting, limiting the visual exploration capability. Here we propose CellNetVis, a web tool to easily display biological networks in a cell diagram employing a constrained force-directed layout algorithm. The tool is freely available and open-source. It was originally designed for networks generated by the Integrated Interactome System and can be used with networks from others databases, like InnateDB. CellNetVis has demonstrated to be applicable for dynamic investigation of complex networks over a consistent representation of a cell on the Web, with capabilities not matched elsewhere.

Sequential Optimization of Global Sequence Alignments Relative to Different Cost Functions

KAUST Repository

Odat, Enas M.

2011-05-01

The purpose of this dissertation is to present a methodology to model global sequence alignment problem as directed acyclic graph which helps to extract all possible optimal alignments. Moreover, a mechanism to sequentially optimize sequence alignment problem relative to different cost functions is suggested. Sequence alignment is mostly important in computational biology. It is used to find evolutionary relationships between biological sequences. There are many algo- rithms that have been developed to solve this problem. The most famous algorithms are Needleman-Wunsch and Smith-Waterman that are based on dynamic program- ming. In dynamic programming, problem is divided into a set of overlapping sub- problems and then the solution of each subproblem is found. Finally, the solutions to these subproblems are combined into a final solution. In this thesis it has been proved that for two sequences of length m and n over a fixed alphabet, the suggested optimization procedure requires O(mn) arithmetic operations per cost function on a single processor machine. The algorithm has been simulated using C#.Net programming language and a number of experiments have been done to verify the proved statements. The results of these experiments show that the number of optimal alignments is reduced after each step of optimization. Furthermore, it has been verified that as the sequence length increased linearly then the number of optimal alignments increased exponentially which also depends on the cost function that is used. Finally, the number of executed operations increases polynomially as the sequence length increase linearly.

PR2ALIGN: a stand-alone software program and a web-server for protein sequence alignment using weighted biochemical properties of amino acids.

Science.gov (United States)

Kuznetsov, Igor B; McDuffie, Michael

2015-05-07

Alignment of amino acid sequences is the main sequence comparison method used in computational molecular biology. The selection of the amino acid substitution matrix best suitable for a given alignment problem is one of the most important decisions the user has to make. In a conventional amino acid substitution matrix all elements are fixed and their values cannot be easily adjusted. Moreover, most existing amino acid substitution matrices account for the average (dis)similarities between amino acid types and do not distinguish the contribution of a specific biochemical property to these (dis)similarities. PR2ALIGN is a stand-alone software program and a web-server that provide the functionality for implementing flexible user-specified alignment scoring functions and aligning pairs of amino acid sequences based on the comparison of the profiles of biochemical properties of these sequences. Unlike the conventional sequence alignment methods that use 20x20 fixed amino acid substitution matrices, PR2ALIGN uses a set of weighted biochemical properties of amino acids to measure the distance between pairs of aligned residues and to find an optimal minimal distance global alignment. The user can provide any number of amino acid properties and specify a weight for each property. The higher the weight for a given property, the more this property affects the final alignment. We show that in many cases the approach implemented in PR2ALIGN produces better quality pair-wise alignments than the conventional matrix-based approach. PR2ALIGN will be helpful for researchers who wish to align amino acid sequences by using flexible user-specified alignment scoring functions based on the biochemical properties of amino acids instead of the amino acid substitution matrix. To the best of the authors' knowledge, there are no existing stand-alone software programs or web-servers analogous to PR2ALIGN. The software is freely available from http://pr2align.rit.albany.edu.

Hidden Markov models and other machine learning approaches in computational molecular biology

Energy Technology Data Exchange (ETDEWEB)

Baldi, P. [California Inst. of Tech., Pasadena, CA (United States)

1995-12-31

This tutorial was one of eight tutorials selected to be presented at the Third International Conference on Intelligent Systems for Molecular Biology which was held in the United Kingdom from July 16 to 19, 1995. Computational tools are increasingly needed to process the massive amounts of data, to organize and classify sequences, to detect weak similarities, to separate coding from non-coding regions, and reconstruct the underlying evolutionary history. The fundamental problem in machine learning is the same as in scientific reasoning in general, as well as statistical modeling: to come up with a good model for the data. In this tutorial four classes of models are reviewed. They are: Hidden Markov models; artificial Neural Networks; Belief Networks; and Stochastic Grammars. When dealing with DNA and protein primary sequences, Hidden Markov models are one of the most flexible and powerful alignments and data base searches. In this tutorial, attention is focused on the theory of Hidden Markov Models, and how to apply them to problems in molecular biology.

A rank-based sequence aligner with applications in phylogenetic analysis.

Directory of Open Access Journals (Sweden)

Liviu P Dinu

Full Text Available Recent tools for aligning short DNA reads have been designed to optimize the trade-off between correctness and speed. This paper introduces a method for assigning a set of short DNA reads to a reference genome, under Local Rank Distance (LRD. The rank-based aligner proposed in this work aims to improve correctness over speed. However, some indexing strategies to speed up the aligner are also investigated. The LRD aligner is improved in terms of speed by storing [Formula: see text]-mer positions in a hash table for each read. Another improvement, that produces an approximate LRD aligner, is to consider only the positions in the reference that are likely to represent a good positional match of the read. The proposed aligner is evaluated and compared to other state of the art alignment tools in several experiments. A set of experiments are conducted to determine the precision and the recall of the proposed aligner, in the presence of contaminated reads. In another set of experiments, the proposed aligner is used to find the order, the family, or the species of a new (or unknown organism, given only a set of short Next-Generation Sequencing DNA reads. The empirical results show that the aligner proposed in this work is highly accurate from a biological point of view. Compared to the other evaluated tools, the LRD aligner has the important advantage of being very accurate even for a very low base coverage. Thus, the LRD aligner can be considered as a good alternative to standard alignment tools, especially when the accuracy of the aligner is of high importance. Source code and UNIX binaries of the aligner are freely available for future development and use at http://lrd.herokuapp.com/aligners. The software is implemented in C++ and Java, being supported on UNIX and MS Windows.

CellNet: Network Biology Applied to Stem Cell Engineering

Science.gov (United States)

Cahan, Patrick; Li, Hu; Morris, Samantha A.; da Rocha, Edroaldo Lummertz; Daley, George Q.; Collins, James J.

2014-01-01

SUMMARY Somatic cell reprogramming, directed differentiation of pluripotent stem cells, and direct conversions between differentiated cell lineages represent powerful approaches to engineer cells for research and regenerative medicine. We have developed CellNet, a network biology platform that more accurately assesses the fidelity of cellular engineering than existing methodologies and generates hypotheses for improving cell derivations. Analyzing expression data from 56 published reports, we found that cells derived via directed differentiation more closely resemble their in vivo counterparts than products of direct conversion, as reflected by the establishment of target cell-type gene regulatory networks (GRNs). Furthermore, we discovered that directly converted cells fail to adequately silence expression programs of the starting population, and that the establishment of unintended GRNs is common to virtually every cellular engineering paradigm. CellNet provides a platform for quantifying how closely engineered cell populations resemble their target cell type and a rational strategy to guide enhanced cellular engineering. PMID:25126793

CellNet: network biology applied to stem cell engineering.

Science.gov (United States)

Cahan, Patrick; Li, Hu; Morris, Samantha A; Lummertz da Rocha, Edroaldo; Daley, George Q; Collins, James J

2014-08-14

Somatic cell reprogramming, directed differentiation of pluripotent stem cells, and direct conversions between differentiated cell lineages represent powerful approaches to engineer cells for research and regenerative medicine. We have developed CellNet, a network biology platform that more accurately assesses the fidelity of cellular engineering than existing methodologies and generates hypotheses for improving cell derivations. Analyzing expression data from 56 published reports, we found that cells derived via directed differentiation more closely resemble their in vivo counterparts than products of direct conversion, as reflected by the establishment of target cell-type gene regulatory networks (GRNs). Furthermore, we discovered that directly converted cells fail to adequately silence expression programs of the starting population and that the establishment of unintended GRNs is common to virtually every cellular engineering paradigm. CellNet provides a platform for quantifying how closely engineered cell populations resemble their target cell type and a rational strategy to guide enhanced cellular engineering. Copyright © 2014 Elsevier Inc. All rights reserved.

YAHA: fast and flexible long-read alignment with optimal breakpoint detection.

Science.gov (United States)

Faust, Gregory G; Hall, Ira M

2012-10-01

With improved short-read assembly algorithms and the recent development of long-read sequencers, split mapping will soon be the preferred method for structural variant (SV) detection. Yet, current alignment tools are not well suited for this. We present YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints. YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from http://faculty.virginia.edu/irahall/YAHA. imh4y@virginia.edu.

Notes on a PDE system for biological network formation

KAUST Repository

Haskovec, Jan

2016-01-22

We present new analytical and numerical results for the elliptic–parabolic system of partial differential equations proposed by Hu and Cai, which models the formation of biological transport networks. The model describes the pressure field using a Darcy’s type equation and the dynamics of the conductance network under pressure force effects. Randomness in the material structure is represented by a linear diffusion term and conductance relaxation by an algebraic decay term. The analytical part extends the results of Haskovec et al. (2015) regarding the existence of weak and mild solutions to the whole range of meaningful relaxation exponents. Moreover, we prove finite time extinction or break-down of solutions in the spatially one-dimensional setting for certain ranges of the relaxation exponent. We also construct stationary solutions for the case of vanishing diffusion and critical value of the relaxation exponent, using a variational formulation and a penalty method. The analytical part is complemented by extensive numerical simulations. We propose a discretization based on mixed finite elements and study the qualitative properties of network structures for various parameter values. Furthermore, we indicate numerically that some analytical results proved for the spatially one-dimensional setting are likely to be valid also in several space dimensions.

Reachability Analysis in Probabilistic Biological Networks.

Science.gov (United States)

Gabr, Haitham; Todor, Andrei; Dobra, Alin; Kahveci, Tamer

2015-01-01

Extra-cellular molecules trigger a response inside the cell by initiating a signal at special membrane receptors (i.e., sources), which is then transmitted to reporters (i.e., targets) through various chains of interactions among proteins. Understanding whether such a signal can reach from membrane receptors to reporters is essential in studying the cell response to extra-cellular events. This problem is drastically complicated due to the unreliability of the interaction data. In this paper, we develop a novel method, called PReach (Probabilistic Reachability), that precisely computes the probability that a signal can reach from a given collection of receptors to a given collection of reporters when the underlying signaling network is uncertain. This is a very difficult computational problem with no known polynomial-time solution. PReach represents each uncertain interaction as a bi-variate polynomial. It transforms the reachability problem to a polynomial multiplication problem. We introduce novel polynomial collapsing operators that associate polynomial terms with possible paths between sources and targets as well as the cuts that separate sources from targets. These operators significantly shrink the number of polynomial terms and thus the running time. PReach has much better time complexity than the recent solutions for this problem. Our experimental results on real data sets demonstrate that this improvement leads to orders of magnitude of reduction in the running time over the most recent methods. Availability: All the data sets used, the software implemented and the alignments found in this paper are available at http://bioinformatics.cise.ufl.edu/PReach/.

Survey, alignment, and beam stability at the Advanced Light Source

International Nuclear Information System (INIS)

Krebs, G.F.

1997-10-01

This paper describes survey and alignment at the Lawrence Berkeley Laboratories Advanced Light Source (ALS) accelerators from 1993 to 1997. The ALS is a third generation light source requiring magnet alignment to within 150 microns. To accomplish this, a network of monuments was established and maintained. Monthly elevation surveys show the movement of the floor over time. Inclinometers have recently been employed to give real time information about magnet, vacuum tank and magnet girder motion in the ALS storage ring

Copper-encapsulated vertically aligned carbon nanotube arrays.

Science.gov (United States)

Stano, Kelly L; Chapla, Rachel; Carroll, Murphy; Nowak, Joshua; McCord, Marian; Bradford, Philip D

2013-11-13

A new procedure is described for the fabrication of vertically aligned carbon nanotubes (VACNTs) that are decorated, and even completely encapsulated, by a dense network of copper nanoparticles. The process involves the conformal deposition of pyrolytic carbon (Py-C) to stabilize the aligned carbon-nanotube structure during processing. The stabilized arrays are mildly functionalized using oxygen plasma treatment to improve wettability, and they are then infiltrated with an aqueous, supersaturated Cu salt solution. Once dried, the salt forms a stabilizing crystal network throughout the array. After calcination and H2 reduction, Cu nanoparticles are left decorating the CNT surfaces. Studies were carried out to determine the optimal processing parameters to maximize Cu content in the composite. These included the duration of Py-C deposition and system process pressure as well as the implementation of subsequent and multiple Cu salt solution infiltrations. The optimized procedure yielded a nanoscale hybrid material where the anisotropic alignment from the VACNT array was preserved, and the mass of the stabilized arrays was increased by over 24-fold because of the addition of Cu. The procedure has been adapted for other Cu salts and can also be used for other metal salts altogether, including Ni, Co, Fe, and Ag. The resulting composite is ideally suited for application in thermal management devices because of its low density, mechanical integrity, and potentially high thermal conductivity. Additionally, further processing of the material via pressing and sintering can yield consolidated, dense bulk composites.

Ontology-supported research on vaccine efficacy, safety and integrative biological networks.

Science.gov (United States)

He, Yongqun

2014-07-01

While vaccine efficacy and safety research has dramatically progressed with the methods of in silico prediction and data mining, many challenges still exist. A formal ontology is a human- and computer-interpretable set of terms and relations that represent entities in a specific domain and how these terms relate to each other. Several community-based ontologies (including Vaccine Ontology, Ontology of Adverse Events and Ontology of Vaccine Adverse Events) have been developed to support vaccine and adverse event representation, classification, data integration, literature mining of host-vaccine interaction networks, and analysis of vaccine adverse events. The author further proposes minimal vaccine information standards and their ontology representations, ontology-based linked open vaccine data and meta-analysis, an integrative One Network ('OneNet') Theory of Life, and ontology-based approaches to study and apply the OneNet theory. In the Big Data era, these proposed strategies provide a novel framework for advanced data integration and analysis of fundamental biological networks including vaccine immune mechanisms.

Why Traditional Expository Teaching-Learning Approaches May Founder? An Experimental Examination of Neural Networks in Biology Learning

Science.gov (United States)

Lee, Jun-Ki; Kwon, Yong-Ju

2011-01-01

Using functional magnetic resonance imaging (fMRI), this study investigates and discusses neurological explanations for, and the educational implications of, the neural network activations involved in hypothesis-generating and hypothesis-understanding for biology education. Two sets of task paradigms about biological phenomena were designed:…

AlignMe—a membrane protein sequence alignment web server

Science.gov (United States)

Stamm, Marcus; Staritzbichler, René; Khafizov, Kamil; Forrest, Lucy R.

2014-01-01

We present a web server for pair-wise alignment of membrane protein sequences, using the program AlignMe. The server makes available two operational modes of AlignMe: (i) sequence to sequence alignment, taking two sequences in fasta format as input, combining information about each sequence from multiple sources and producing a pair-wise alignment (PW mode); and (ii) alignment of two multiple sequence alignments to create family-averaged hydropathy profile alignments (HP mode). For the PW sequence alignment mode, four different optimized parameter sets are provided, each suited to pairs of sequences with a specific similarity level. These settings utilize different types of inputs: (position-specific) substitution matrices, secondary structure predictions and transmembrane propensities from transmembrane predictions or hydrophobicity scales. In the second (HP) mode, each input multiple sequence alignment is converted into a hydrophobicity profile averaged over the provided set of sequence homologs; the two profiles are then aligned. The HP mode enables qualitative comparison of transmembrane topologies (and therefore potentially of 3D folds) of two membrane proteins, which can be useful if the proteins have low sequence similarity. In summary, the AlignMe web server provides user-friendly access to a set of tools for analysis and comparison of membrane protein sequences. Access is available at http://www.bioinfo.mpg.de/AlignMe PMID:24753425

Quantum Processes and Dynamic Networks in Physical and Biological Systems.

Science.gov (United States)

Dudziak, Martin Joseph

Quantum theory since its earliest formulations in the Copenhagen Interpretation has been difficult to integrate with general relativity and with classical Newtonian physics. There has been traditionally a regard for quantum phenomena as being a limiting case for a natural order that is fundamentally classical except for microscopic extrema where quantum mechanics must be applied, more as a mathematical reconciliation rather than as a description and explanation. Macroscopic sciences including the study of biological neural networks, cellular energy transports and the broad field of non-linear and chaotic systems point to a quantum dimension extending across all scales of measurement and encompassing all of Nature as a fundamentally quantum universe. Theory and observation lead to a number of hypotheses all of which point to dynamic, evolving networks of fundamental or elementary processes as the underlying logico-physical structure (manifestation) in Nature and a strongly quantized dimension to macroscalar processes such as are found in biological, ecological and social systems. The fundamental thesis advanced and presented herein is that quantum phenomena may be the direct consequence of a universe built not from objects and substance but from interacting, interdependent processes collectively operating as sets and networks, giving rise to systems that on microcosmic or macroscopic scales function wholistically and organically, exhibiting non-locality and other non -classical phenomena. The argument is made that such effects as non-locality are not aberrations or departures from the norm but ordinary consequences of the process-network dynamics of Nature. Quantum processes are taken to be the fundamental action-events within Nature; rather than being the exception quantum theory is the rule. The argument is also presented that the study of quantum physics could benefit from the study of selective higher-scale complex systems, such as neural processes in the brain

Conceptual framework alignment between primary literature and education in animal behaviour

Science.gov (United States)

Bierema, Andrea Marie-Kryger

In 1963, Tinbergen revolutionized the study of animal behaviour in his paper On aims and methods of ethology (Zeitschrift Tierpsycholgie, 20, 410-433) by revamping the conceptual framework of the discipline. His framework suggests an integration of four questions: causation, ontogeny, survival value, and evolution. The National Research Council Committee (U.S.) on Undergraduate Biology Education to Prepare Research Scientists for the 21st Century published BIO2010: Transforming Undergraduate Education for Future Research Biologists (Washington, DC: The National Academies Press, 2003), which suggests alignment between current research and undergraduate education. Unfortunately, alignment has been rarely studied in college biology, especially for fundamental concepts. The purpose of this study, therefore, is to determine if the conceptual framework used by animal behaviour scientists, as presented in current primary literature, aligns with what students are exposed to in undergraduate biology education. After determining the most commonly listed textbooks from randomlyselected animal behaviour syllabi, four of the most popular textbooks, as well as the course descriptions provided in the collected syllabi, underwent content analysis in order to determine the extent that each of Tinbergen's four questions is being applied in education. Mainstream animal behaviour journal articles from 2013 were also assessed via content analysis in order to evaluate the current research framework. It was discovered that over 80% of the textbook text covered only two of Tinbergen's questions (survival value and causation). The other two questions, evolution and ontogeny, were rarely described in the text. A similar trend was found in journal articles. Therefore, alignment is occurring between primary literature and education, but neither aligns with the established conceptual framework of the discipline. According to course descriptions, many instructors intend to use an integrated

Multiple alignment analysis on phylogenetic tree of the spread of SARS epidemic using distance method

Science.gov (United States)

Amiroch, S.; Pradana, M. S.; Irawan, M. I.; Mukhlash, I.

2017-09-01

Multiple Alignment (MA) is a particularly important tool for studying the viral genome and determine the evolutionary process of the specific virus. Application of MA in the case of the spread of the Severe acute respiratory syndrome (SARS) epidemic is an interesting thing because this virus epidemic a few years ago spread so quickly that medical attention in many countries. Although there has been a lot of software to process multiple sequences, but the use of pairwise alignment to process MA is very important to consider. In previous research, the alignment between the sequences to process MA algorithm, Super Pairwise Alignment, but in this study used a dynamic programming algorithm Needleman wunchs simulated in Matlab. From the analysis of MA obtained and stable region and unstable which indicates the position where the mutation occurs, the system network topology that produced the phylogenetic tree of the SARS epidemic distance method, and system area networks mutation.

A comparative analysis on computational methods for fitting an ERGM to biological network data

Directory of Open Access Journals (Sweden)

Sudipta Saha

2015-03-01

Full Text Available Exponential random graph models (ERGM based on graph theory are useful in studying global biological network structure using its local properties. However, computational methods for fitting such models are sensitive to the type, structure and the number of the local features of a network under study. In this paper, we compared computational methods for fitting an ERGM with local features of different types and structures. Two commonly used methods, such as the Markov Chain Monte Carlo Maximum Likelihood Estimation and the Maximum Pseudo Likelihood Estimation are considered for estimating the coefficients of network attributes. We compared the estimates of observed network to our random simulated network using both methods under ERGM. The motivation was to ascertain the extent to which an observed network would deviate from a randomly simulated network if the physical numbers of attributes were approximately same. Cut-off points of some common attributes of interest for different order of nodes were determined through simulations. We implemented our method to a known regulatory network database of Escherichia coli (E. coli.

Usefulness and limitations of dK random graph models to predict interactions and functional homogeneity in biological networks under a pseudo-likelihood parameter estimation approach

Directory of Open Access Journals (Sweden)

Luan Yihui

2009-09-01

Full Text Available Abstract Background Many aspects of biological functions can be modeled by biological networks, such as protein interaction networks, metabolic networks, and gene coexpression networks. Studying the statistical properties of these networks in turn allows us to infer biological function. Complex statistical network models can potentially more accurately describe the networks, but it is not clear whether such complex models are better suited to find biologically meaningful subnetworks. Results Recent studies have shown that the degree distribution of the nodes is not an adequate statistic in many molecular networks. We sought to extend this statistic with 2nd and 3rd order degree correlations and developed a pseudo-likelihood approach to estimate the parameters. The approach was used to analyze the MIPS and BIOGRID yeast protein interaction networks, and two yeast coexpression networks. We showed that 2nd order degree correlation information gave better predictions of gene interactions in both protein interaction and gene coexpression networks. However, in the biologically important task of predicting functionally homogeneous modules, degree correlation information performs marginally better in the case of the MIPS and BIOGRID protein interaction networks, but worse in the case of gene coexpression networks. Conclusion Our use of dK models showed that incorporation of degree correlations could increase predictive power in some contexts, albeit sometimes marginally, but, in all contexts, the use of third-order degree correlations decreased accuracy. However, it is possible that other parameter estimation methods, such as maximum likelihood, will show the usefulness of incorporating 2nd and 3rd degree correlations in predicting functionally homogeneous modules.

Usefulness and limitations of dK random graph models to predict interactions and functional homogeneity in biological networks under a pseudo-likelihood parameter estimation approach.

Science.gov (United States)

Wang, Wenhui; Nunez-Iglesias, Juan; Luan, Yihui; Sun, Fengzhu

2009-09-03

Many aspects of biological functions can be modeled by biological networks, such as protein interaction networks, metabolic networks, and gene coexpression networks. Studying the statistical properties of these networks in turn allows us to infer biological function. Complex statistical network models can potentially more accurately describe the networks, but it is not clear whether such complex models are better suited to find biologically meaningful subnetworks. Recent studies have shown that the degree distribution of the nodes is not an adequate statistic in many molecular networks. We sought to extend this statistic with 2nd and 3rd order degree correlations and developed a pseudo-likelihood approach to estimate the parameters. The approach was used to analyze the MIPS and BIOGRID yeast protein interaction networks, and two yeast coexpression networks. We showed that 2nd order degree correlation information gave better predictions of gene interactions in both protein interaction and gene coexpression networks. However, in the biologically important task of predicting functionally homogeneous modules, degree correlation information performs marginally better in the case of the MIPS and BIOGRID protein interaction networks, but worse in the case of gene coexpression networks. Our use of dK models showed that incorporation of degree correlations could increase predictive power in some contexts, albeit sometimes marginally, but, in all contexts, the use of third-order degree correlations decreased accuracy. However, it is possible that other parameter estimation methods, such as maximum likelihood, will show the usefulness of incorporating 2nd and 3rd degree correlations in predicting functionally homogeneous modules.

Visual analysis of transcriptome data in the context of anatomical structures and biological networks

Directory of Open Access Journals (Sweden)

Astrid eJunker

2012-11-01

Full Text Available The complexity and temporal as well as spatial resolution of transcriptome datasets is constantly increasing due to extensive technological developments. Here we present methods for advanced visualization and intuitive exploration of transcriptomics data as necessary prerequisites in order to facilitate the gain of biological knowledge. Color-coding of structural images based on the expression level enables a fast visual data analysis in the background of the examined biological system. The network-based exploration of these visualizations allows for comparative analysis of genes with specific transcript patterns and supports the extraction of functional relationships even from large datasets. In order to illustrate the presented methods, the tool HIVE was applied for visualization and exploration of database-retrieved expression data for master regulators of Arabidopsis thaliana flower and seed development in the context of corresponding tissue-specific regulatory networks.

Kajian Literatur Sinkronisasi Waktu Dengan Network Time Protocol Untuk Pemantauan Aktivitas Jaringan Telekomunikasi

Directory of Open Access Journals (Sweden)

Ahmad Budi Setiawan

2015-12-01

Abstract Network providers are providing services or networks that enable the implementation of electronic transactions. Each network operator is required to align the time in electronic transactions. The purpose is to provide time alignment of the time standard and provide a time frame for all forms of electronic transactions with the principles of accuracy and traceability. Indonesian Time Alignment System uses the principle of traceability and accuracy principles. The protocols used in the alignment of the time server in Indonesia-based Network Time Protocol. This study discusses the implementation of time synchronization with a network time protocol as a form of telecommunications network security monitoring. The method used in this study is a descriptive narrative on the implementation of time synchronization. Results of this study are input to the policy in the security of electronic transactions through time synchronization

Architecture and biological applications of artificial neural networks: a tuberculosis perspective.

Science.gov (United States)

Darsey, Jerry A; Griffin, William O; Joginipelli, Sravanthi; Melapu, Venkata Kiran

2015-01-01

Advancement of science and technology has prompted researchers to develop new intelligent systems that can solve a variety of problems such as pattern recognition, prediction, and optimization. The ability of the human brain to learn in a fashion that tolerates noise and error has attracted many researchers and provided the starting point for the development of artificial neural networks: the intelligent systems. Intelligent systems can acclimatize to the environment or data and can maximize the chances of success or improve the efficiency of a search. Due to massive parallelism with large numbers of interconnected processers and their ability to learn from the data, neural networks can solve a variety of challenging computational problems. Neural networks have the ability to derive meaning from complicated and imprecise data; they are used in detecting patterns, and trends that are too complex for humans, or other computer systems. Solutions to the toughest problems will not be found through one narrow specialization; therefore we need to combine interdisciplinary approaches to discover the solutions to a variety of problems. Many researchers in different disciplines such as medicine, bioinformatics, molecular biology, and pharmacology have successfully applied artificial neural networks. This chapter helps the reader in understanding the basics of artificial neural networks, their applications, and methodology; it also outlines the network learning process and architecture. We present a brief outline of the application of neural networks to medical diagnosis, drug discovery, gene identification, and protein structure prediction. We conclude with a summary of the results from our study on tuberculosis data using neural networks, in diagnosing active tuberculosis, and predicting chronic vs. infiltrative forms of tuberculosis.

An appraisal of biological responses and network of environmental interactions in non-mining and mining impacted coastal waters

Digital Repository Service at National Institute of Oceanography (India)

Fernandes, C.E.G.; Malik, A; Jineesh, V.K.; Fernandes, S.O.; Das, A; Pandey, S.S.; Kanolkar, G.; Sujith, P.P.; Velip, D.; Shaikh, S.; Helekar, S.; Gonsalves, M.J.B.D.; Nair, S.; LokaBharathi, P.A

iron brought from the hinterlands. We hypothesize that there could be a shift in biological response along with changes in network of interactions between environmental and biological variables in these mining and non-mining impacted regions, lying 160...

A Brief Introduction to Chinese Biological Biological

Institute of Scientific and Technical Information of China (English)

无

2005-01-01

Chinese Biological Abstracts sponsored by the Library, the Shanghai Institutes for Biological Sciences, the Biological Documentation and Information Network, all of the Chinese Academy of Sciences, commenced publication in 1987 and was initiated to provide access to the Chinese information in the field of biology.

Recurrent Convolutional Neural Networks: A Better Model of Biological Object Recognition.

Science.gov (United States)

Spoerer, Courtney J; McClure, Patrick; Kriegeskorte, Nikolaus

2017-01-01

Feedforward neural networks provide the dominant model of how the brain performs visual object recognition. However, these networks lack the lateral and feedback connections, and the resulting recurrent neuronal dynamics, of the ventral visual pathway in the human and non-human primate brain. Here we investigate recurrent convolutional neural networks with bottom-up (B), lateral (L), and top-down (T) connections. Combining these types of connections yields four architectures (B, BT, BL, and BLT), which we systematically test and compare. We hypothesized that recurrent dynamics might improve recognition performance in the challenging scenario of partial occlusion. We introduce two novel occluded object recognition tasks to test the efficacy of the models, digit clutter (where multiple target digits occlude one another) and digit debris (where target digits are occluded by digit fragments). We find that recurrent neural networks outperform feedforward control models (approximately matched in parametric complexity) at recognizing objects, both in the absence of occlusion and in all occlusion conditions. Recurrent networks were also found to be more robust to the inclusion of additive Gaussian noise. Recurrent neural networks are better in two respects: (1) they are more neurobiologically realistic than their feedforward counterparts; (2) they are better in terms of their ability to recognize objects, especially under challenging conditions. This work shows that computer vision can benefit from using recurrent convolutional architectures and suggests that the ubiquitous recurrent connections in biological brains are essential for task performance.

Spreadsheet-based program for alignment of overlapping DNA sequences.

Science.gov (United States)

Anbazhagan, R; Gabrielson, E

1999-06-01

Molecular biology laboratories frequently face the challenge of aligning small overlapping DNA sequences derived from a long DNA segment. Here, we present a short program that can be used to adapt Excel spreadsheets as a tool for aligning DNA sequences, regardless of their orientation. The program runs on any Windows or Macintosh operating system computer with Excel 97 or Excel 98. The program is available for use as an Excel file, which can be downloaded from the BioTechniques Web site. Upon execution, the program opens a specially designed customized workbook and is capable of identifying overlapping regions between two sequence fragments and displaying the sequence alignment. It also performs a number of specialized functions such as recognition of restriction enzyme cutting sites and CpG island mapping without costly specialized software.

Protein alignment using cellulose nanocrystals: practical considerations and range of application

International Nuclear Information System (INIS)

Denisov, Alexey Y.; Kloser, Elisabeth; Gray, Derek G.; Mittermaier, Anthony K.

2010-01-01

Cellulose nanocrystals (CNCs) form liquid crystals in aqueous solution that confer alignment to macromolecules and permit the measurement of residual dipolar couplings. CNCs possess many attractive features as an alignment medium. They are inexpensive, non-toxic, chemically inert, and robust to denaturants and temperature. Despite these advantages, CNCs are seldom employed as an alignment medium and the range of their applicability has not yet been explored. We have re-examined the use of CNCs in biomolecular NMR by analyzing the effects concentration, ionic strength, and temperature on molecular alignment. Stable alignment was obtained over wide ranges of temperature (10-70 o C) and pH (2.5-8.0), which makes CNCs potentially very useful in studies of thermophilic proteins and acid-stabilized molecules. Notably, we find that CNC suspensions are very sensitive to the concentrations of biological buffers, which must be taken into account when they are used in NMR analyses. These results have led us to develop a general procedure for preparing aligned samples with CNCs. Using the SH3 domain from the Fyn tyrosine kinase as a model system, we find that CNCs produce an alignment frame collinear with that of the commonly used Pf1 bacteriophage alignment medium, but of opposite magnitude.

Students Mental Representation of Biology Diagrams/Pictures Conventions Based on Formation of Causal Network

Science.gov (United States)

Sampurno, A. W.; Rahmat, A.; Diana, S.

2017-09-01

Diagrams/pictures conventions is one form of visual media that often used to assist students in understanding the biological concepts. The effectiveness of use diagrams/pictures in biology learning at school level has also been mostly reported. This study examines the ability of high school students in reading diagrams/pictures biological convention which is described by Mental Representation based on formation of causal networks. The study involved 30 students 11th grade MIA senior high school Banten Indonesia who are studying the excretory system. MR data obtained by Instrument worksheet, developed based on CNET-protocol, in which there are diagrams/drawings of nephron structure and urinary mechanism. Three patterns formed MR, namely Markov chain, feedback control with a single measurement, and repeated feedback control with multiple measurement. The third pattern is the most dominating pattern, differences in the pattern of MR reveal the difference in how and from which point the students begin to uncover important information contained in the diagram to establish a causal networks. Further analysis shows that a difference in the pattern of MR relate to how complex the students process the information contained in the diagrams/pictures.

A Network Biology Approach Identifies Molecular Cross-Talk between Normal Prostate Epithelial and Prostate Carcinoma Cells.

Science.gov (United States)

Trevino, Victor; Cassese, Alberto; Nagy, Zsuzsanna; Zhuang, Xiaodong; Herbert, John; Antczak, Philipp; Clarke, Kim; Davies, Nicholas; Rahman, Ayesha; Campbell, Moray J; Guindani, Michele; Bicknell, Roy; Vannucci, Marina; Falciani, Francesco

2016-04-01

The advent of functional genomics has enabled the genome-wide characterization of the molecular state of cells and tissues, virtually at every level of biological organization. The difficulty in organizing and mining this unprecedented amount of information has stimulated the development of computational methods designed to infer the underlying structure of regulatory networks from observational data. These important developments had a profound impact in biological sciences since they triggered the development of a novel data-driven investigative approach. In cancer research, this strategy has been particularly successful. It has contributed to the identification of novel biomarkers, to a better characterization of disease heterogeneity and to a more in depth understanding of cancer pathophysiology. However, so far these approaches have not explicitly addressed the challenge of identifying networks representing the interaction of different cell types in a complex tissue. Since these interactions represent an essential part of the biology of both diseased and healthy tissues, it is of paramount importance that this challenge is addressed. Here we report the definition of a network reverse engineering strategy designed to infer directional signals linking adjacent cell types within a complex tissue. The application of this inference strategy to prostate cancer genome-wide expression profiling data validated the approach and revealed that normal epithelial cells exert an anti-tumour activity on prostate carcinoma cells. Moreover, by using a Bayesian hierarchical model integrating genetics and gene expression data and combining this with survival analysis, we show that the expression of putative cell communication genes related to focal adhesion and secretion is affected by epistatic gene copy number variation and it is predictive of patient survival. Ultimately, this study represents a generalizable approach to the challenge of deciphering cell communication networks

A Network Biology Approach Identifies Molecular Cross-Talk between Normal Prostate Epithelial and Prostate Carcinoma Cells.

Directory of Open Access Journals (Sweden)

Victor Trevino

2016-04-01

Full Text Available The advent of functional genomics has enabled the genome-wide characterization of the molecular state of cells and tissues, virtually at every level of biological organization. The difficulty in organizing and mining this unprecedented amount of information has stimulated the development of computational methods designed to infer the underlying structure of regulatory networks from observational data. These important developments had a profound impact in biological sciences since they triggered the development of a novel data-driven investigative approach. In cancer research, this strategy has been particularly successful. It has contributed to the identification of novel biomarkers, to a better characterization of disease heterogeneity and to a more in depth understanding of cancer pathophysiology. However, so far these approaches have not explicitly addressed the challenge of identifying networks representing the interaction of different cell types in a complex tissue. Since these interactions represent an essential part of the biology of both diseased and healthy tissues, it is of paramount importance that this challenge is addressed. Here we report the definition of a network reverse engineering strategy designed to infer directional signals linking adjacent cell types within a complex tissue. The application of this inference strategy to prostate cancer genome-wide expression profiling data validated the approach and revealed that normal epithelial cells exert an anti-tumour activity on prostate carcinoma cells. Moreover, by using a Bayesian hierarchical model integrating genetics and gene expression data and combining this with survival analysis, we show that the expression of putative cell communication genes related to focal adhesion and secretion is affected by epistatic gene copy number variation and it is predictive of patient survival. Ultimately, this study represents a generalizable approach to the challenge of deciphering cell

Alignment for new Subaru ring

International Nuclear Information System (INIS)

Zhang, Ch.; Matsui, S.; Hashimoto, S.

1999-01-01

The New SUBARU is a synchrotron light source being constructed at the SPring-8 site. The main facility is a 1.5 GeV electron storage ring that provides light beam in the region from VUV to soft X-ray using SPring-8's 1 GeV linac as an injector. The ring, with a circumference of about 119 meters, is composed of six bending cells. Each bending cell has two normal dipoles of 34 degree and one inverse dipole of -8 degree. The ring has six straight sections: two very long straight sections for a 11-m long undulator and an optical klystron, four short straight sections for a 2.3-m undulator, a super-conducting wiggler, rf cavity and injection, etc. The magnets of the storage ring are composed of 12 dipoles (BMs), 6 invert dipoles (BIs), 56 quadrupoles and 44 sextupoles, etc. For the magnet alignment, positions of the dipoles (the BMs and BIs) are determined by network survey method. The multipoles, which are mounted on girders between the dipoles, are aligned with a laser-CCD camera system. This article presents the methodology used to position the different components and particularly to assure the precise alignment of the multipoles. (authors)

Push-Pull and Feedback Mechanisms Can Align Signaling System Outputs with Inputs.

Science.gov (United States)

Andrews, Steven S; Peria, William J; Yu, Richard C; Colman-Lerner, Alejandro; Brent, Roger

2016-11-23

Many cell signaling systems, including the yeast pheromone response system, exhibit "dose-response alignment" (DoRA), in which output of one or more downstream steps closely matches the fraction of occupied receptors. DoRA can improve the fidelity of transmitted dose information. Here, we searched systematically for biochemical network topologies that produced DoRA. Most networks, including many containing feedback and feedforward loops, could not produce DoRA. However, networks including "push-pull" mechanisms, in which the active form of a signaling species stimulates downstream activity and the nominally inactive form reduces downstream activity, enabled perfect DoRA. Networks containing feedbacks enabled DoRA, but only if they also compared feedback to input and adjusted output to match. Our results establish push-pull as a non-feedback mechanism to align output with variable input and maximize information transfer in signaling systems. They also suggest genetic approaches to determine whether particular signaling systems use feedback or push-pull control. Copyright © 2016 Elsevier Inc. All rights reserved.

From protein interactions to functional annotation: graph alignment in Herpes

Czech Academy of Sciences Publication Activity Database

Kolář, Michal; Lassig, M.; Berg, J.

2008-01-01

Roč. 2, č. 90 (2008), e-e ISSN 1752-0509 Institutional research plan: CEZ:AV0Z50520514 Keywords : graph alignment * functional annotation * protein orthology Subject RIV: EB - Genetics ; Molecular Biology Impact factor: 3.706, year: 2008

Positioning and aligning CNTs by external magnetic field to assist localised epoxy cure

Directory of Open Access Journals (Sweden)

Ariu G.

2016-01-01

Full Text Available This work focuses on the generation of conductive networks through the localised alignment of nano fillers, such as multi-walled carbon nanotubes (MWCNTs. The feasibility of alignment and positioning of functionalised MWCNTs by external DC magnetic fields was investigated. The aim of this manipulation is to enhance resin curing through AC induction heating due to hysteresis losses from the nanotubes. Experimental analyses focused on in-depth assessment of the nanotube functionalisation, processing and characterisation of magnetic, rheological and cure kinetics properties of the MWCNT solution. The study has shown that an external magnetic field has great potential for positioning and alignment of CNTs. The study demonstrated potential for creating well-ordered architectures with an unprecedented level of control of network geometry. Magnetic characterisation indicated cobalt-plated nanotubes to be the most suitable candidate for magnetic alignment due to their high magnetic sensitivity. Epoxy/metal-plated CNT nanocomposite systems were validated by thermal analysis as induction heating mediums. The curing process could therefore be optimised by the use of dielectric resins. This study offers a first step towards the proof of concept of this technique as a novel repair technology.

Positioning and aligning CNTs by external magnetic field to assist localised epoxy cure

Science.gov (United States)

Ariu, G.; Hamerton, I.; Ivanov, D.

2016-01-01

This work focuses on the generation of conductive networks through the localised alignment of nano fillers, such as multi-walled carbon nanotubes (MWCNTs). The feasibility of alignment and positioning of functionalised MWCNTs by external DC magnetic fields was investigated. The aim of this manipulation is to enhance resin curing through AC induction heating due to hysteresis losses from the nanotubes. Experimental analyses focused on in-depth assessment of the nanotube functionalisation, processing and characterisation of magnetic, rheological and cure kinetics properties of the MWCNT solution. The study has shown that an external magnetic field has great potential for positioning and alignment of CNTs. The study demonstrated potential for creating well-ordered architectures with an unprecedented level of control of network geometry. Magnetic characterisation indicated cobalt-plated nanotubes to be the most suitable candidate for magnetic alignment due to their high magnetic sensitivity. Epoxy/metal-plated CNT nanocomposite systems were validated by thermal analysis as induction heating mediums. The curing process could therefore be optimised by the use of dielectric resins. This study offers a first step towards the proof of concept of this technique as a novel repair technology.

MUON DETECTORS: ALIGNMENT

CERN Multimedia

G.Gomez.

Since June of 2009, the muon alignment group has focused on providing new alignment constants and on finalizing the hardware alignment reconstruction. Alignment constants for DTs and CSCs were provided for CRAFT09 data reprocessing. For DT chambers, the track-based alignment was repeated using CRAFT09 cosmic ray muons and validated using segment extrapolation and split cosmic tools. One difference with respect to the previous alignment is that only five degrees of freedom were aligned, leaving the rotation around the local x-axis to be better determined by the hardware system. Similarly, DT chambers poorly aligned by tracks (due to limited statistics) were aligned by a combination of photogrammetry and hardware-based alignment. For the CSC chambers, the hardware system provided alignment in global z and rotations about local x. Entire muon endcap rings were further corrected in the transverse plane (global x and y) by the track-based alignment. Single chamber track-based alignment suffers from poor statistic...

Dislocation content of geometrically necessary boundaries aligned with slip planes in rolled aluminium

DEFF Research Database (Denmark)

Hong, Chuanshi; Huang, Xiaoxu; Winther, Grethe

2013-01-01

Previous studies have revealed that dislocation structures in metals with medium-to-high stacking fault energy, depend on the grain orientation and therefore on the slip systems. In the present work, the dislocations in eight slip-plane-aligned geometrically necessary boundaries (GNBs) in three...... expected active dominate. The dislocations predicted inactive are primarily attributed to dislocation reactions in the boundary. Two main types of dislocation networks in the boundaries were identified: (1) a hexagonal network of the three dislocations in the slip plane with which the boundary was aligned......; two of these come from the active slip systems, the third is attributed to dislocation reactions (2) a network of three dislocations from both of the active slip planes; two of these react to form Lomer locks. The results indicate a systematic boundary formation process for the GNBs. Redundant...

MUMmer4: A fast and versatile genome alignment system.

Directory of Open Access Journals (Sweden)

Guillaume Marçais

2018-01-01

Full Text Available The MUMmer system and the genome sequence aligner nucmer included within it are among the most widely used alignment packages in genomics. Since the last major release of MUMmer version 3 in 2004, it has been applied to many types of problems including aligning whole genome sequences, aligning reads to a reference genome, and comparing different assemblies of the same genome. Despite its broad utility, MUMmer3 has limitations that can make it difficult to use for large genomes and for the very large sequence data sets that are common today. In this paper we describe MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing of input query sequences. With a theoretical limit on the input size of 141Tbp, MUMmer4 can now work with input sequences of any biologically realistic length. We show that as a result of these enhancements, the nucmer program in MUMmer4 is easily able to handle alignments of large genomes; we illustrate this with an alignment of the human and chimpanzee genomes, which allows us to compute that the two species are 98% identical across 96% of their length. With the enhancements described here, MUMmer4 can also be used to efficiently align reads to reference genomes, although it is less sensitive and accurate than the dedicated read aligners. The nucmer aligner in MUMmer4 can now be called from scripting languages such as Perl, Python and Ruby. These improvements make MUMer4 one the most versatile genome alignment packages available.

Measuring and aligning accelerator components to the nanometre scale

CERN Document Server

Catalán Lasheras, N; Modena, M

2014-01-01

First tests have shown that the precision and accuracy required for linear colliders and other future accelerators of 10 micrometers is costly and lengthy with a process based on independent fiducializations of single components. Indeed, the systematic and random errors at each step add up during the process with the final accuracy of each component center well above the target. A new EC-funded training network named PACMAN (a study on Particle Accelerator Components Metrology and Alignment to the Nanometer scale) will propose and develop an alternative solution integrating all the alignment steps and a large number of technologies at the same time and location, in order to gain the required precision and accuracy. The network composed of seven industrial partners and nine universities and research centers will be based at CERN where ten doctoral students will explore the technology limitations of metrology. They will develop new techniques to measure magnetic and microwave fields, optical and non-contact sen...

AlignMiner: a Web-based tool for detection of divergent regions in multiple sequence alignments of conserved sequences

Directory of Open Access Journals (Sweden)

Claros M Gonzalo

2010-06-01

Full Text Available Abstract Background Multiple sequence alignments are used to study gene or protein function, phylogenetic relations, genome evolution hypotheses and even gene polymorphisms. Virtually without exception, all available tools focus on conserved segments or residues. Small divergent regions, however, are biologically important for specific quantitative polymerase chain reaction, genotyping, molecular markers and preparation of specific antibodies, and yet have received little attention. As a consequence, they must be selected empirically by the researcher. AlignMiner has been developed to fill this gap in bioinformatic analyses. Results AlignMiner is a Web-based application for detection of conserved and divergent regions in alignments of conserved sequences, focusing particularly on divergence. It accepts alignments (protein or nucleic acid obtained using any of a variety of algorithms, which does not appear to have a significant impact on the final results. AlignMiner uses different scoring methods for assessing conserved/divergent regions, Entropy being the method that provides the highest number of regions with the greatest length, and Weighted being the most restrictive. Conserved/divergent regions can be generated either with respect to the consensus sequence or to one master sequence. The resulting data are presented in a graphical interface developed in AJAX, which provides remarkable user interaction capabilities. Users do not need to wait until execution is complete and can.even inspect their results on a different computer. Data can be downloaded onto a user disk, in standard formats. In silico and experimental proof-of-concept cases have shown that AlignMiner can be successfully used to designing specific polymerase chain reaction primers as well as potential epitopes for antibodies. Primer design is assisted by a module that deploys several oligonucleotide parameters for designing primers "on the fly". Conclusions AlignMiner can be used

Application of hierarchical dissociated neural network in closed-loop hybrid system integrating biological and mechanical intelligence.

Directory of Open Access Journals (Sweden)

Yongcheng Li

Full Text Available Neural networks are considered the origin of intelligence in organisms. In this paper, a new design of an intelligent system merging biological intelligence with artificial intelligence was created. It was based on a neural controller bidirectionally connected to an actual mobile robot to implement a novel vehicle. Two types of experimental preparations were utilized as the neural controller including 'random' and '4Q' (cultured neurons artificially divided into four interconnected parts neural network. Compared to the random cultures, the '4Q' cultures presented absolutely different activities, and the robot controlled by the '4Q' network presented better capabilities in search tasks. Our results showed that neural cultures could be successfully employed to control an artificial agent; the robot performed better and better with the stimulus because of the short-term plasticity. A new framework is provided to investigate the bidirectional biological-artificial interface and develop new strategies for a future intelligent system using these simplified model systems.

Application of Hierarchical Dissociated Neural Network in Closed-Loop Hybrid System Integrating Biological and Mechanical Intelligence

Science.gov (United States)

Zhang, Bin; Wang, Yuechao; Li, Hongyi

2015-01-01

Neural networks are considered the origin of intelligence in organisms. In this paper, a new design of an intelligent system merging biological intelligence with artificial intelligence was created. It was based on a neural controller bidirectionally connected to an actual mobile robot to implement a novel vehicle. Two types of experimental preparations were utilized as the neural controller including ‘random’ and ‘4Q’ (cultured neurons artificially divided into four interconnected parts) neural network. Compared to the random cultures, the ‘4Q’ cultures presented absolutely different activities, and the robot controlled by the ‘4Q’ network presented better capabilities in search tasks. Our results showed that neural cultures could be successfully employed to control an artificial agent; the robot performed better and better with the stimulus because of the short-term plasticity. A new framework is provided to investigate the bidirectional biological-artificial interface and develop new strategies for a future intelligent system using these simplified model systems. PMID:25992579

Application of hierarchical dissociated neural network in closed-loop hybrid system integrating biological and mechanical intelligence.

Science.gov (United States)

Li, Yongcheng; Sun, Rong; Zhang, Bin; Wang, Yuechao; Li, Hongyi

2015-01-01

Neural networks are considered the origin of intelligence in organisms. In this paper, a new design of an intelligent system merging biological intelligence with artificial intelligence was created. It was based on a neural controller bidirectionally connected to an actual mobile robot to implement a novel vehicle. Two types of experimental preparations were utilized as the neural controller including 'random' and '4Q' (cultured neurons artificially divided into four interconnected parts) neural network. Compared to the random cultures, the '4Q' cultures presented absolutely different activities, and the robot controlled by the '4Q' network presented better capabilities in search tasks. Our results showed that neural cultures could be successfully employed to control an artificial agent; the robot performed better and better with the stimulus because of the short-term plasticity. A new framework is provided to investigate the bidirectional biological-artificial interface and develop new strategies for a future intelligent system using these simplified model systems.

A Systems Biology Analysis Unfolds the Molecular Pathways and Networks of Two Proteobacteria in Spaceflight and Simulated Microgravity Conditions.

Science.gov (United States)

Roy, Raktim; Shilpa, P Phani; Bagh, Sangram

2016-09-01

Bacteria are important organisms for space missions due to their increased pathogenesis in microgravity that poses risks to the health of astronauts and for projected synthetic biology applications at the space station. We understand little about the effect, at the molecular systems level, of microgravity on bacteria, despite their significant incidence. In this study, we proposed a systems biology pipeline and performed an analysis on published gene expression data sets from multiple seminal studies on Pseudomonas aeruginosa and Salmonella enterica serovar Typhimurium under spaceflight and simulated microgravity conditions. By applying gene set enrichment analysis on the global gene expression data, we directly identified a large number of new, statistically significant cellular and metabolic pathways involved in response to microgravity. Alteration of metabolic pathways in microgravity has rarely been reported before, whereas in this analysis metabolic pathways are prevalent. Several of those pathways were found to be common across studies and species, indicating a common cellular response in microgravity. We clustered genes based on their expression patterns using consensus non-negative matrix factorization. The genes from different mathematically stable clusters showed protein-protein association networks with distinct biological functions, suggesting the plausible functional or regulatory network motifs in response to microgravity. The newly identified pathways and networks showed connection with increased survival of pathogens within macrophages, virulence, and antibiotic resistance in microgravity. Our work establishes a systems biology pipeline and provides an integrated insight into the effect of microgravity at the molecular systems level. Systems biology-Microgravity-Pathways and networks-Bacteria. Astrobiology 16, 677-689.

Automated insertion of sequences into a ribosomal RNA alignment: An application of computational linguistics in molecular biology

Energy Technology Data Exchange (ETDEWEB)

Taylor, Ronald C. [Case Western Reserve Univ., Cleveland, OH (United States)

1991-11-01

This thesis involved the construction of (1) a grammar that incorporates knowledge on base invariancy and secondary structure in a molecule and (2) a parser engine that uses the grammar to position bases into the structural subunits of the molecule. These concepts were combined with a novel pinning technique to form a tool that semi-automates insertion of a new species into the alignment for the 16S rRNA molecule (a component of the ribosome) maintained by Dr. Carl Woese`s group at the University of Illinois at Urbana. The tool was tested on species extracted from the alignment and on a group of entirely new species. The results were very encouraging, and the tool should be substantial aid to the curators of the 16S alignment. The construction of the grammar was itself automated, allowing application of the tool to alignments for other molecules. The logic programming language Prolog was used to construct all programs involved. The computational linguistics approach used here was found to be a useful way to attach the problem of insertion into an alignment.

Automated insertion of sequences into a ribosomal RNA alignment: An application of computational linguistics in molecular biology

Energy Technology Data Exchange (ETDEWEB)

Taylor, R.C.

1991-11-01

This thesis involved the construction of (1) a grammar that incorporates knowledge on base invariancy and secondary structure in a molecule and (2) a parser engine that uses the grammar to position bases into the structural subunits of the molecule. These concepts were combined with a novel pinning technique to form a tool that semi-automates insertion of a new species into the alignment for the 16S rRNA molecule (a component of the ribosome) maintained by Dr. Carl Woese's group at the University of Illinois at Urbana. The tool was tested on species extracted from the alignment and on a group of entirely new species. The results were very encouraging, and the tool should be substantial aid to the curators of the 16S alignment. The construction of the grammar was itself automated, allowing application of the tool to alignments for other molecules. The logic programming language Prolog was used to construct all programs involved. The computational linguistics approach used here was found to be a useful way to attach the problem of insertion into an alignment.

A Non-Homogeneous Dynamic Bayesian Network with Sequentially Coupled Interaction Parameters for Applications in Systems and Synthetic Biology

NARCIS (Netherlands)

Grzegorczyk, Marco; Husmeier, Dirk

2012-01-01

An important and challenging problem in systems biology is the inference of gene regulatory networks from short non-stationary time series of transcriptional profiles. A popular approach that has been widely applied to this end is based on dynamic Bayesian networks (DBNs), although traditional

A review of active learning approaches to experimental design for uncovering biological networks

Science.gov (United States)

2017-01-01

Various types of biological knowledge describe networks of interactions among elementary entities. For example, transcriptional regulatory networks consist of interactions among proteins and genes. Current knowledge about the exact structure of such networks is highly incomplete, and laboratory experiments that manipulate the entities involved are conducted to test hypotheses about these networks. In recent years, various automated approaches to experiment selection have been proposed. Many of these approaches can be characterized as active machine learning algorithms. Active learning is an iterative process in which a model is learned from data, hypotheses are generated from the model to propose informative experiments, and the experiments yield new data that is used to update the model. This review describes the various models, experiment selection strategies, validation techniques, and successful applications described in the literature; highlights common themes and notable distinctions among methods; and identifies likely directions of future research and open problems in the area. PMID:28570593

Formatt: Correcting protein multiple structural alignments by incorporating sequence alignment

Directory of Open Access Journals (Sweden)

Daniels Noah M

2012-10-01

Full Text Available Abstract Background The quality of multiple protein structure alignments are usually computed and assessed based on geometric functions of the coordinates of the backbone atoms from the protein chains. These purely geometric methods do not utilize directly protein sequence similarity, and in fact, determining the proper way to incorporate sequence similarity measures into the construction and assessment of protein multiple structure alignments has proved surprisingly difficult. Results We present Formatt, a multiple structure alignment based on the Matt purely geometric multiple structure alignment program, that also takes into account sequence similarity when constructing alignments. We show that Formatt outperforms Matt and other popular structure alignment programs on the popular HOMSTRAD benchmark. For the SABMark twilight zone benchmark set that captures more remote homology, Formatt and Matt outperform other programs; depending on choice of embedded sequence aligner, Formatt produces either better sequence and structural alignments with a smaller core size than Matt, or similarly sized alignments with better sequence similarity, for a small cost in average RMSD. Conclusions Considering sequence information as well as purely geometric information seems to improve quality of multiple structure alignments, though defining what constitutes the best alignment when sequence and structural measures would suggest different alignments remains a difficult open question.

An Overview of DNA Microarray Grid Alignment and Foreground Separation Approaches

Directory of Open Access Journals (Sweden)

Bajcsy Peter

2006-01-01

Full Text Available This paper overviews DNA microarray grid alignment and foreground separation approaches. Microarray grid alignment and foreground separation are the basic processing steps of DNA microarray images that affect the quality of gene expression information, and hence impact our confidence in any data-derived biological conclusions. Thus, understanding microarray data processing steps becomes critical for performing optimal microarray data analysis. In the past, the grid alignment and foreground separation steps have not been covered extensively in the survey literature. We present several classifications of existing algorithms, and describe the fundamental principles of these algorithms. Challenges related to automation and reliability of processed image data are outlined at the end of this overview paper.

Contextual Hub Analysis Tool (CHAT): A Cytoscape app for identifying contextually relevant hubs in biological networks.

Science.gov (United States)

Muetze, Tanja; Goenawan, Ivan H; Wiencko, Heather L; Bernal-Llinares, Manuel; Bryan, Kenneth; Lynn, David J

2016-01-01

Highly connected nodes (hubs) in biological networks are topologically important to the structure of the network and have also been shown to be preferentially associated with a range of phenotypes of interest. The relative importance of a hub node, however, can change depending on the biological context. Here, we report a Cytoscape app, the Contextual Hub Analysis Tool (CHAT), which enables users to easily construct and visualize a network of interactions from a gene or protein list of interest, integrate contextual information, such as gene expression or mass spectrometry data, and identify hub nodes that are more highly connected to contextual nodes (e.g. genes or proteins that are differentially expressed) than expected by chance. In a case study, we use CHAT to construct a network of genes that are differentially expressed in Dengue fever, a viral infection. CHAT was used to identify and compare contextual and degree-based hubs in this network. The top 20 degree-based hubs were enriched in pathways related to the cell cycle and cancer, which is likely due to the fact that proteins involved in these processes tend to be highly connected in general. In comparison, the top 20 contextual hubs were enriched in pathways commonly observed in a viral infection including pathways related to the immune response to viral infection. This analysis shows that such contextual hubs are considerably more biologically relevant than degree-based hubs and that analyses which rely on the identification of hubs solely based on their connectivity may be biased towards nodes that are highly connected in general rather than in the specific context of interest. CHAT is available for Cytoscape 3.0+ and can be installed via the Cytoscape App Store ( http://apps.cytoscape.org/apps/chat).

Windows .NET Network Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST

Directory of Open Access Journals (Sweden)

Oliver Melvin J

2005-04-01

Full Text Available Abstract Background BLAST is one of the most common and useful tools for Genetic Research. This paper describes a software application we have termed Windows .NET Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST, which enhances the BLAST utility by improving usability, fault recovery, and scalability in a Windows desktop environment. Our goal was to develop an easy to use, fault tolerant, high-throughput BLAST solution that incorporates a comprehensive BLAST result viewer with curation and annotation functionality. Results W.ND-BLAST is a comprehensive Windows-based software toolkit that targets researchers, including those with minimal computer skills, and provides the ability increase the performance of BLAST by distributing BLAST queries to any number of Windows based machines across local area networks (LAN. W.ND-BLAST provides intuitive Graphic User Interfaces (GUI for BLAST database creation, BLAST execution, BLAST output evaluation and BLAST result exportation. This software also provides several layers of fault tolerance and fault recovery to prevent loss of data if nodes or master machines fail. This paper lays out the functionality of W.ND-BLAST. W.ND-BLAST displays close to 100% performance efficiency when distributing tasks to 12 remote computers of the same performance class. A high throughput BLAST job which took 662.68 minutes (11 hours on one average machine was completed in 44.97 minutes when distributed to 17 nodes, which included lower performance class machines. Finally, there is a comprehensive high-throughput BLAST Output Viewer (BOV and Annotation Engine components, which provides comprehensive exportation of BLAST hits to text files, annotated fasta files, tables, or association files. Conclusion W.ND-BLAST provides an interactive tool that allows scientists to easily utilizing their available computing resources for high throughput and comprehensive sequence analyses. The install package for W.ND-BLAST is

Qualitative reasoning for biological network inference from systematic perturbation experiments.

Science.gov (United States)

Badaloni, Silvana; Di Camillo, Barbara; Sambo, Francesco

2012-01-01

The systematic perturbation of the components of a biological system has been proven among the most informative experimental setups for the identification of causal relations between the components. In this paper, we present Systematic Perturbation-Qualitative Reasoning (SPQR), a novel Qualitative Reasoning approach to automate the interpretation of the results of systematic perturbation experiments. Our method is based on a qualitative abstraction of the experimental data: for each perturbation experiment, measured values of the observed variables are modeled as lower, equal or higher than the measurements in the wild type condition, when no perturbation is applied. The algorithm exploits a set of IF-THEN rules to infer causal relations between the variables, analyzing the patterns of propagation of the perturbation signals through the biological network, and is specifically designed to minimize the rate of false positives among the inferred relations. Tested on both simulated and real perturbation data, SPQR indeed exhibits a significantly higher precision than the state of the art.

RNA structure alignment by a unit-vector approach.

Science.gov (United States)

Capriotti, Emidio; Marti-Renom, Marc A

2008-08-15

The recent discovery of tiny RNA molecules such as microRNAs and small interfering RNA are transforming the view of RNA as a simple information transfer molecule. Similar to proteins, the native three-dimensional structure of RNA determines its biological activity. Therefore, classifying the current structural space is paramount for functionally annotating RNA molecules. The increasing numbers of RNA structures deposited in the PDB requires more accurate, automatic and benchmarked methods for RNA structure comparison. In this article, we introduce a new algorithm for RNA structure alignment based on a unit-vector approach. The algorithm has been implemented in the SARA program, which results in RNA structure pairwise alignments and their statistical significance. The SARA program has been implemented to be of general applicability even when no secondary structure can be calculated from the RNA structures. A benchmark against the ARTS program using a set of 1275 non-redundant pairwise structure alignments results in inverted approximately 6% extra alignments with at least 50% structurally superposed nucleotides and base pairs. A first attempt to perform RNA automatic functional annotation based on structure alignments indicates that SARA can correctly assign the deepest SCOR classification to >60% of the query structures. The SARA program is freely available through a World Wide Web server http://sgu.bioinfo.cipf.es/services/SARA/. Supplementary data are available at Bioinformatics online.

MUON DETECTORS: ALIGNMENT

CERN Multimedia

G.Gomez

2010-01-01

The main developments in muon alignment since March 2010 have been the production, approval and deployment of alignment constants for the ICHEP data reprocessing. In the barrel, a new geometry, combining information from both hardware and track-based alignment systems, has been developed for the first time. The hardware alignment provides an initial DT geometry, which is then anchored as a rigid solid, using the link alignment system, to a reference frame common to the tracker. The “GlobalPositionRecords” for both the Tracker and Muon systems are being used for the first time, and the initial tracker-muon relative positioning, based on the link alignment, yields good results within the photogrammetry uncertainties of the Tracker and alignment ring positions. For the first time, the optical and track-based alignments show good agreement between them; the optical alignment being refined by the track-based alignment. The resulting geometry is the most complete to date, aligning all 250 DTs, ...

Cryo-EM image alignment based on nonuniform fast Fourier transform

International Nuclear Information System (INIS)

Yang Zhengfan; Penczek, Pawel A.

2008-01-01

In single particle analysis, two-dimensional (2-D) alignment is a fundamental step intended to put into register various particle projections of biological macromolecules collected at the electron microscope. The efficiency and quality of three-dimensional (3-D) structure reconstruction largely depends on the computational speed and alignment accuracy of this crucial step. In order to improve the performance of alignment, we introduce a new method that takes advantage of the highly accurate interpolation scheme based on the gridding method, a version of the nonuniform fast Fourier transform, and utilizes a multi-dimensional optimization algorithm for the refinement of the orientation parameters. Using simulated data, we demonstrate that by using less than half of the sample points and taking twice the runtime, our new 2-D alignment method achieves dramatically better alignment accuracy than that based on quadratic interpolation. We also apply our method to image to volume registration, the key step in the single particle EM structure refinement protocol. We find that in this case the accuracy of the method not only surpasses the accuracy of the commonly used real-space implementation, but results are achieved in much shorter time, making gridding-based alignment a perfect candidate for efficient structure determination in single particle analysis

Cryo-EM image alignment based on nonuniform fast Fourier transform.

Science.gov (United States)

Yang, Zhengfan; Penczek, Pawel A

2008-08-01

In single particle analysis, two-dimensional (2-D) alignment is a fundamental step intended to put into register various particle projections of biological macromolecules collected at the electron microscope. The efficiency and quality of three-dimensional (3-D) structure reconstruction largely depends on the computational speed and alignment accuracy of this crucial step. In order to improve the performance of alignment, we introduce a new method that takes advantage of the highly accurate interpolation scheme based on the gridding method, a version of the nonuniform fast Fourier transform, and utilizes a multi-dimensional optimization algorithm for the refinement of the orientation parameters. Using simulated data, we demonstrate that by using less than half of the sample points and taking twice the runtime, our new 2-D alignment method achieves dramatically better alignment accuracy than that based on quadratic interpolation. We also apply our method to image to volume registration, the key step in the single particle EM structure refinement protocol. We find that in this case the accuracy of the method not only surpasses the accuracy of the commonly used real-space implementation, but results are achieved in much shorter time, making gridding-based alignment a perfect candidate for efficient structure determination in single particle analysis.

Systems Biology as an Integrated Platform for Bioinformatics, Systems Synthetic Biology, and Systems Metabolic Engineering

Science.gov (United States)

Chen, Bor-Sen; Wu, Chia-Chou

2013-01-01

Systems biology aims at achieving a system-level understanding of living organisms and applying this knowledge to various fields such as synthetic biology, metabolic engineering, and medicine. System-level understanding of living organisms can be derived from insight into: (i) system structure and the mechanism of biological networks such as gene regulation, protein interactions, signaling, and metabolic pathways; (ii) system dynamics of biological networks, which provides an understanding of stability, robustness, and transduction ability through system identification, and through system analysis methods; (iii) system control methods at different levels of biological networks, which provide an understanding of systematic mechanisms to robustly control system states, minimize malfunctions, and provide potential therapeutic targets in disease treatment; (iv) systematic design methods for the modification and construction of biological networks with desired behaviors, which provide system design principles and system simulations for synthetic biology designs and systems metabolic engineering. This review describes current developments in systems biology, systems synthetic biology, and systems metabolic engineering for engineering and biology researchers. We also discuss challenges and future prospects for systems biology and the concept of systems biology as an integrated platform for bioinformatics, systems synthetic biology, and systems metabolic engineering. PMID:24709875

Systems Biology as an Integrated Platform for Bioinformatics, Systems Synthetic Biology, and Systems Metabolic Engineering

Directory of Open Access Journals (Sweden)

Bor-Sen Chen

2013-10-01

Full Text Available Systems biology aims at achieving a system-level understanding of living organisms and applying this knowledge to various fields such as synthetic biology, metabolic engineering, and medicine. System-level understanding of living organisms can be derived from insight into: (i system structure and the mechanism of biological networks such as gene regulation, protein interactions, signaling, and metabolic pathways; (ii system dynamics of biological networks, which provides an understanding of stability, robustness, and transduction ability through system identification, and through system analysis methods; (iii system control methods at different levels of biological networks, which provide an understanding of systematic mechanisms to robustly control system states, minimize malfunctions, and provide potential therapeutic targets in disease treatment; (iv systematic design methods for the modification and construction of biological networks with desired behaviors, which provide system design principles and system simulations for synthetic biology designs and systems metabolic engineering. This review describes current developments in systems biology, systems synthetic biology, and systems metabolic engineering for engineering and biology researchers. We also discuss challenges and future prospects for systems biology and the concept of systems biology as an integrated platform for bioinformatics, systems synthetic biology, and systems metabolic engineering.

Consistent robustness analysis (CRA) identifies biologically relevant properties of regulatory network models.

Science.gov (United States)

Saithong, Treenut; Painter, Kevin J; Millar, Andrew J

2010-12-16

A number of studies have previously demonstrated that "goodness of fit" is insufficient in reliably classifying the credibility of a biological model. Robustness and/or sensitivity analysis is commonly employed as a secondary method for evaluating the suitability of a particular model. The results of such analyses invariably depend on the particular parameter set tested, yet many parameter values for biological models are uncertain. Here, we propose a novel robustness analysis that aims to determine the "common robustness" of the model with multiple, biologically plausible parameter sets, rather than the local robustness for a particular parameter set. Our method is applied to two published models of the Arabidopsis circadian clock (the one-loop [1] and two-loop [2] models). The results reinforce current findings suggesting the greater reliability of the two-loop model and pinpoint the crucial role of TOC1 in the circadian network. Consistent Robustness Analysis can indicate both the relative plausibility of different models and also the critical components and processes controlling each model.

Review of alignment activities for indus-1 and 2 at CAT

International Nuclear Information System (INIS)

Nema, P.K.; Sahu, R.K.; Prasad, V.

1999-01-01

Survey and alignment activities at CAT (Centre for Advanced Technology - India) are related to two accelerator projects called INDUS-1 and INDUS -2. Former is a 450 MeV SRS and latter is a 2.5 GeV SRS. Both the machines use a 450/700 MeV booster synchrotron and 20 MeV pre-injector microtron for injection. Indus-1 was commissioned with 100 mA stored beam current in May 1999. Indus-2 is under construction and expected to be commissioned within next 4 years. Survey and alignment work of booster synchrotron and Indus-1 (storage ring) was accomplished using optical surveying techniques with software ECDS-2 of Kern. That was possible due to small size of machines of Indus-1. For Indus-2 with circumference of 172.47 m, the network surveying and alignment scheme has been planned. Indus-2 is a high brilliance machine and this puts more stringent requirements on alignment. This paper describes methodology and performance results of Indus-1 alignment and strategy for Indus-2. (authors)

Evolutionary rates at codon sites may be used to align sequences and infer protein domain function

Directory of Open Access Journals (Sweden)

Hazelhurst Scott

2010-03-01

Full Text Available Abstract Background Sequence alignments form part of many investigations in molecular biology, including the determination of phylogenetic relationships, the prediction of protein structure and function, and the measurement of evolutionary rates. However, to obtain meaningful results, a significant degree of sequence similarity is required to ensure that the alignments are accurate and the inferences correct. Limitations arise when sequence similarity is low, which is particularly problematic when working with fast-evolving genes, evolutionary distant taxa, genomes with nucleotide biases, and cases of convergent evolution. Results A novel approach was conceptualized to address the "low sequence similarity" alignment problem. We developed an alignment algorithm termed FIRE (Functional Inference using the Rates of Evolution, which aligns sequences using the evolutionary rate at codon sites, as measured by the dN/dS ratio, rather than nucleotide or amino acid residues. FIRE was used to test the hypotheses that evolutionary rates can be used to align sequences and that the alignments may be used to infer protein domain function. Using a range of test data, we found that aligning domains based on evolutionary rates was possible even when sequence similarity was very low (for example, antibody variable regions. Furthermore, the alignment has the potential to infer protein domain function, indicating that domains with similar functions are subject to similar evolutionary constraints. These data suggest that an evolutionary rate-based approach to sequence analysis (particularly when combined with structural data may be used to study cases of convergent evolution or when sequences have very low similarity. However, when aligning homologous gene sets with sequence similarity, FIRE did not perform as well as the best traditional alignment algorithms indicating that the conventional approach of aligning residues as opposed to evolutionary rates remains the

Biological neural networks as model systems for designing future parallel processing computers

Science.gov (United States)

Ross, Muriel D.

1991-01-01

One of the more interesting debates of the present day centers on whether human intelligence can be simulated by computer. The author works under the premise that neurons individually are not smart at all. Rather, they are physical units which are impinged upon continuously by other matter that influences the direction of voltage shifts across the units membranes. It is only the action of a great many neurons, billions in the case of the human nervous system, that intelligent behavior emerges. What is required to understand even the simplest neural system is painstaking analysis, bit by bit, of the architecture and the physiological functioning of its various parts. The biological neural network studied, the vestibular utricular and saccular maculas of the inner ear, are among the most simple of the mammalian neural networks to understand and model. While there is still a long way to go to understand even this most simple neural network in sufficient detail for extrapolation to computers and robots, a start was made. Moreover, the insights obtained and the technologies developed help advance the understanding of the more complex neural networks that underlie human intelligence.

Visual data mining of biological networks: one size does not fit all.

Directory of Open Access Journals (Sweden)

Chiara Pastrello

Full Text Available High-throughput technologies produce massive amounts of data. However, individual methods yield data specific to the technique used and biological setup. The integration of such diverse data is necessary for the qualitative analysis of information relevant to hypotheses or discoveries. It is often useful to integrate these datasets using pathways and protein interaction networks to get a broader view of the experiment. The resulting network needs to be able to focus on either the large-scale picture or on the more detailed small-scale subsets, depending on the research question and goals. In this tutorial, we illustrate a workflow useful to integrate, analyze, and visualize data from different sources, and highlight important features of tools to support such analyses.

BioCreative V track 4: a shared task for the extraction of causal network information using the Biological Expression Language.

Science.gov (United States)

Rinaldi, Fabio; Ellendorff, Tilia Renate; Madan, Sumit; Clematide, Simon; van der Lek, Adrian; Mevissen, Theo; Fluck, Juliane

2016-01-01

Automatic extraction of biological network information is one of the most desired and most complex tasks in biological and medical text mining. Track 4 at BioCreative V attempts to approach this complexity using fragments of large-scale manually curated biological networks, represented in Biological Expression Language (BEL), as training and test data. BEL is an advanced knowledge representation format which has been designed to be both human readable and machine processable. The specific goal of track 4 was to evaluate text mining systems capable of automatically constructing BEL statements from given evidence text, and of retrieving evidence text for given BEL statements. Given the complexity of the task, we designed an evaluation methodology which gives credit to partially correct statements. We identified various levels of information expressed by BEL statements, such as entities, functions, relations, and introduced an evaluation framework which rewards systems capable of delivering useful BEL fragments at each of these levels. The aim of this evaluation method is to help identify the characteristics of the systems which, if combined, would be most useful for achieving the overall goal of automatically constructing causal biological networks from text. © The Author(s) 2016. Published by Oxford University Press.

Large Scale Proteomic Data and Network-Based Systems Biology Approaches to Explore the Plant World.

Science.gov (United States)

Di Silvestre, Dario; Bergamaschi, Andrea; Bellini, Edoardo; Mauri, PierLuigi

2018-06-03

The investigation of plant organisms by means of data-derived systems biology approaches based on network modeling is mainly characterized by genomic data, while the potential of proteomics is largely unexplored. This delay is mainly caused by the paucity of plant genomic/proteomic sequences and annotations which are fundamental to perform mass-spectrometry (MS) data interpretation. However, Next Generation Sequencing (NGS) techniques are contributing to filling this gap and an increasing number of studies are focusing on plant proteome profiling and protein-protein interactions (PPIs) identification. Interesting results were obtained by evaluating the topology of PPI networks in the context of organ-associated biological processes as well as plant-pathogen relationships. These examples foreshadow well the benefits that these approaches may provide to plant research. Thus, in addition to providing an overview of the main-omic technologies recently used on plant organisms, we will focus on studies that rely on concepts of module, hub and shortest path, and how they can contribute to the plant discovery processes. In this scenario, we will also consider gene co-expression networks, and some examples of integration with metabolomic data and genome-wide association studies (GWAS) to select candidate genes will be mentioned.

Identifying Natural Alignments Between Ambulatory Surgery Centers and Local Health Systems: Building Broader Communities of Surgical Care.

Science.gov (United States)

Funk, Russell J; Owen-Smith, Jason; Landon, Bruce E; Birkmeyer, John D; Hollingsworth, John M

2017-02-01

To develop and compare methods for identifying natural alignments between ambulatory surgery centers (ASCs) and hospitals that anchor local health systems. Using all-payer data from Florida's State Ambulatory Surgery and Inpatient Databases (2005-2009), we developed 3 methods for identifying alignments between ASCS and hospitals. The first, a geographic proximity approach, used spatial data to assign an ASC to its nearest hospital neighbor. The second, a predominant affiliation approach, assigned an ASC to the hospital with which it shared a plurality of surgeons. The third, a network community approach, linked an ASC with a larger group of hospitals held together by naturally occurring physician networks. We compared each method in terms of its ability to capture meaningful and stable affiliations and its administrative simplicity. Although the proximity approach was simplest to implement and produced the most durable alignments, ASC surgeon's loyalty to the assigned hospital was low with this method. The predominant affiliation and network community approaches performed better and nearly equivalently on these metrics, capturing more meaningful affiliations between ASCs and hospitals. However, the latter's alignments were least durable, and it was complex to administer. We describe 3 methods for identifying natural alignments between ASCs and hospitals, each with strengths and weaknesses. These methods will help health system managers identify ASCs with which to partner. Moreover, health services researchers and policy analysts can use them to study broader communities of surgical care.

Cell cycle gene expression networks discovered using systems biology: Significance in carcinogenesis

Science.gov (United States)

Scott, RE; Ghule, PN; Stein, JL; Stein, GS

2015-01-01

The early stages of carcinogenesis are linked to defects in the cell cycle. A series of cell cycle checkpoints are involved in this process. The G1/S checkpoint that serves to integrate the control of cell proliferation and differentiation is linked to carcinogenesis and the mitotic spindle checkpoint with the development of chromosomal instability. This paper presents the outcome of systems biology studies designed to evaluate if networks of covariate cell cycle gene transcripts exist in proliferative mammalian tissues including mice, rats and humans. The GeneNetwork website that contains numerous gene expression datasets from different species, sexes and tissues represents the foundational resource for these studies (www.genenetwork.org). In addition, WebGestalt, a gene ontology tool, facilitated the identification of expression networks of genes that co-vary with key cell cycle targets, especially Cdc20 and Plk1 (www.bioinfo.vanderbilt.edu/webgestalt). Cell cycle expression networks of such covariate mRNAs exist in multiple proliferative tissues including liver, lung, pituitary, adipose and lymphoid tissues among others but not in brain or retina that have low proliferative potential. Sixty-three covariate cell cycle gene transcripts (mRNAs) compose the average cell cycle network with p = e−13 to e−36. Cell cycle expression networks show species, sex and tissue variability and they are enriched in mRNA transcripts associated with mitosis many of which are associated with chromosomal instability. PMID:25808367

Alignment Exemplars and Current Opportunities for Collaboration ANADP

OpenAIRE

Walters, Tyler O.; Greer, Chris; Hartman, Cathy; Skinner, Katherine; Jung, Joachim

2014-01-01

Aligning National Approaches to Digital Preservation: An Action Assembly Biblioteca de Catalunya (National Library of Catalonia) November 18-20, 2013, Barcelona, Spain Auburn University Council on Library and Information Resources (CLIR) Digital Curation Centre (DCC) Digital Preservation Network (DPN) Joint Information Systems Committee (JISC) University of North Texas Virginia Tech Interuniversity Consortium for Political and Social Research (ICPSR) Innovative Inte...

Optimizing multiple sequence alignments using a genetic algorithm based on three objectives: structural information, non-gaps percentage and totally conserved columns.

Science.gov (United States)

Ortuño, Francisco M; Valenzuela, Olga; Rojas, Fernando; Pomares, Hector; Florido, Javier P; Urquiza, Jose M; Rojas, Ignacio

2013-09-01

Multiple sequence alignments (MSAs) are widely used approaches in bioinformatics to carry out other tasks such as structure predictions, biological function analyses or phylogenetic modeling. However, current tools usually provide partially optimal alignments, as each one is focused on specific biological features. Thus, the same set of sequences can produce different alignments, above all when sequences are less similar. Consequently, researchers and biologists do not agree about which is the most suitable way to evaluate MSAs. Recent evaluations tend to use more complex scores including further biological features. Among them, 3D structures are increasingly being used to evaluate alignments. Because structures are more conserved in proteins than sequences, scores with structural information are better suited to evaluate more distant relationships between sequences. The proposed multiobjective algorithm, based on the non-dominated sorting genetic algorithm, aims to jointly optimize three objectives: STRIKE score, non-gaps percentage and totally conserved columns. It was significantly assessed on the BAliBASE benchmark according to the Kruskal-Wallis test (P algorithm also outperforms other aligners, such as ClustalW, Multiple Sequence Alignment Genetic Algorithm (MSA-GA), PRRP, DIALIGN, Hidden Markov Model Training (HMMT), Pattern-Induced Multi-sequence Alignment (PIMA), MULTIALIGN, Sequence Alignment Genetic Algorithm (SAGA), PILEUP, Rubber Band Technique Genetic Algorithm (RBT-GA) and Vertical Decomposition Genetic Algorithm (VDGA), according to the Wilcoxon signed-rank test (P 0.05) with the advantage of being able to use less structures. Structural information is included within the objective function to evaluate more accurately the obtained alignments. The source code is available at http://www.ugr.es/~fortuno/MOSAStrE/MO-SAStrE.zip.

HAlign-II: efficient ultra-large multiple sequence alignment and phylogenetic tree reconstruction with distributed and parallel computing.

Science.gov (United States)

Wan, Shixiang; Zou, Quan

2017-01-01

Multiple sequence alignment (MSA) plays a key role in biological sequence analyses, especially in phylogenetic tree construction. Extreme increase in next-generation sequencing results in shortage of efficient ultra-large biological sequence alignment approaches for coping with different sequence types. Distributed and parallel computing represents a crucial technique for accelerating ultra-large (e.g. files more than 1 GB) sequence analyses. Based on HAlign and Spark distributed computing system, we implement a highly cost-efficient and time-efficient HAlign-II tool to address ultra-large multiple biological sequence alignment and phylogenetic tree construction. The experiments in the DNA and protein large scale data sets, which are more than 1GB files, showed that HAlign II could save time and space. It outperformed the current software tools. HAlign-II can efficiently carry out MSA and construct phylogenetic trees with ultra-large numbers of biological sequences. HAlign-II shows extremely high memory efficiency and scales well with increases in computing resource. THAlign-II provides a user-friendly web server based on our distributed computing infrastructure. HAlign-II with open-source codes and datasets was established at http://lab.malab.cn/soft/halign.

Exploring candidate biological functions by Boolean Function Networks for Saccharomyces cerevisiae.

Directory of Open Access Journals (Sweden)

Maria Simak

Full Text Available The great amount of gene expression data has brought a big challenge for the discovery of Gene Regulatory Network (GRN. For network reconstruction and the investigation of regulatory relations, it is desirable to ensure directness of links between genes on a map, infer their directionality and explore candidate biological functions from high-throughput transcriptomic data. To address these problems, we introduce a Boolean Function Network (BFN model based on techniques of hidden Markov model (HMM, likelihood ratio test and Boolean logic functions. BFN consists of two consecutive tests to establish links between pairs of genes and check their directness. We evaluate the performance of BFN through the application to S. cerevisiae time course data. BFN produces regulatory relations which show consistency with succession of cell cycle phases. Furthermore, it also improves sensitivity and specificity when compared with alternative methods of genetic network reverse engineering. Moreover, we demonstrate that BFN can provide proper resolution for GO enrichment of gene sets. Finally, the Boolean functions discovered by BFN can provide useful insights for the identification of control mechanisms of regulatory processes, which is the special advantage of the proposed approach. In combination with low computational complexity, BFN can serve as an efficient screening tool to reconstruct genes relations on the whole genome level. In addition, the BFN approach is also feasible to a wide range of time course datasets.

Biologically based neural network for mobile robot navigation

Science.gov (United States)

Torres Muniz, Raul E.

1999-01-01

The new tendency in mobile robots is to crete non-Cartesian system based on reactions to their environment. This emerging technology is known as Evolutionary Robotics, which is combined with the Biorobotic field. This new approach brings cost-effective solutions, flexibility, robustness, and dynamism into the design of mobile robots. It also provides fast reactions to the sensory inputs, and new interpretation of the environment or surroundings of the mobile robot. The Subsumption Architecture (SA) and the action selection dynamics developed by Brooks and Maes, respectively, have successfully obtained autonomous mobile robots initiating this new trend of the Evolutionary Robotics. Their design keeps the mobile robot control simple. This work present a biologically inspired modification of these schemes. The hippocampal-CA3-based neural network developed by Williams Levy is used to implement the SA, while the action selection dynamics emerge from iterations of the levels of competence implemented with the HCA3. This replacement by the HCA3 results in a closer biological model than the SA, combining the Behavior-based intelligence theory with neuroscience. The design is kept simple, and it is implemented in the Khepera Miniature Mobile Robot. The used control scheme obtains an autonomous mobile robot that can be used to execute a mail delivery system and surveillance task inside a building floor.

The Latin American Biological Dosimetry Network (LBDNet): Argentina, Brazil, Chile, Cuba, Mexico, Peru, Uruguay

International Nuclear Information System (INIS)

Guerrero C, C.; Arceo M, C.; Di Giorgio, M.; Vallerga, M.; Radl, A.; Taja, M.; Seoane, A.; De Luca, J.; Stuck O, M.; Valdivia, P.

2010-10-01

Biological dosimetry is a necessary support for national radiation protection programs and emergency response schemes. The Latin American Biological Dosimetry Network (LBDNet) was formally founded in 2007 for mutual assistance in case of radiation emergencies and for providing support to other Latin American countries that do not have bio dosimetry laboratories. In the frame of the IAEA Technical Cooperation Projects RLA/9/54 and RLA/9/61 the following activities have been performed: a) An international intercomparison exercise organized during 2007-2008 included six European countries and LBDNet laboratories. Relevant parameters related with dose assessment were evaluated through triage and conventional scoring criteria. A new approach for statistical data analysis was developed including assessment of inter-laboratory reproducibility and intra-laboratory repeatability. Overall, the laboratory performance was satisfactory for mutual cooperation purposes. b) In 2009, LBDNet and two European countries carried out a digital image intercomparison exercise involving dose assessment from metaphase images distributed electronically through internet. The main objectives were to evaluate scoring feasibility on metaphase images and time response. In addition a re-examination phase was considered in which the most controversial images were discussed jointly, this allowed for the development of a homogeneous scoring criteria within the network. c) A further exercise was performed during 2009 involving the shipment of biological samples for biological dosimetry assessment. The aim of this exercise was to test the timely and properly sending and receiving blood samples under national and international regulations. A total of 14 laboratories participated in this joint IAEA, PAHO and WHO. (Author)

The Latin American Biological Dosimetry Network (LBDNet): Argentina, Brazil, Chile, Cuba, Mexico, Peru, Uruguay

Energy Technology Data Exchange (ETDEWEB)

Guerrero C, C.; Arceo M, C. [ININ, Carretera Mexico-Toluca s/n, Ocoyoacac 52750, Estado de Mexico (Mexico); Di Giorgio, M.; Vallerga, M.; Radl, A. [Autoridad Regulatoria Nuclear, Av. del Libertador 8250, C1429 BNP CABA (Argentina); Taja, M.; Seoane, A.; De Luca, J. [Universidad Nacionald de La Plata, Av. 7 No. 1776, La Plata 1900, Buenos Aires (Argentina); Stuck O, M. [Instituto de Radioproteccion y Dosimetria, Av. Salvador Allende s/n, Recreio dos Bandeirantes, Rio de Janeiro (Brazil); Valdivia, P., E-mail: lbdnet@googlegroups.co [Comision Chilena de Energia, Amutanegui 95, Santiago Centro, Santiago (Chile)

2010-10-15

Biological dosimetry is a necessary support for national radiation protection programs and emergency response schemes. The Latin American Biological Dosimetry Network (LBDNet) was formally founded in 2007 for mutual assistance in case of radiation emergencies and for providing support to other Latin American countries that do not have bio dosimetry laboratories. In the frame of the IAEA Technical Cooperation Projects RLA/9/54 and RLA/9/61 the following activities have been performed: a) An international intercomparison exercise organized during 2007-2008 included six European countries and LBDNet laboratories. Relevant parameters related with dose assessment were evaluated through triage and conventional scoring criteria. A new approach for statistical data analysis was developed including assessment of inter-laboratory reproducibility and intra-laboratory repeatability. Overall, the laboratory performance was satisfactory for mutual cooperation purposes. b) In 2009, LBDNet and two European countries carried out a digital image intercomparison exercise involving dose assessment from metaphase images distributed electronically through internet. The main objectives were to evaluate scoring feasibility on metaphase images and time response. In addition a re-examination phase was considered in which the most controversial images were discussed jointly, this allowed for the development of a homogeneous scoring criteria within the network. c) A further exercise was performed during 2009 involving the shipment of biological samples for biological dosimetry assessment. The aim of this exercise was to test the timely and properly sending and receiving blood samples under national and international regulations. A total of 14 laboratories participated in this joint IAEA, PAHO and WHO. (Author)

Simultaneous Wireless Information and Power Transfer for MIMO Interference Channel Networks Based on Interference Alignment

Directory of Open Access Journals (Sweden)

Anming Dong

2017-09-01

Full Text Available This paper considers power splitting (PS-based simultaneous wireless information and power transfer (SWIPT for multiple-input multiple-output (MIMO interference channel networks where multiple transceiver pairs share the same frequency spectrum. As the PS model is adopted, an individual receiver splits the received signal into two parts for information decoding (ID and energy harvesting (EH, respectively. Aiming to minimize the total transmit power, transmit precoders, receive filters and PS ratios are jointly designed under a predefined signal-to-interference-plus-noise ratio (SINR and EH constraints. The formulated joint transceiver design and power splitting problem is non-convex and thus difficult to solve directly. In order to effectively obtain its solution, the feasibility conditions of the formulated non-convex problem are first analyzed. Based on the analysis, an iterative algorithm is proposed by alternatively optimizing the transmitters together with the power splitting factors and the receivers based on semidefinite programming (SDP relaxation. Moreover, considering the prohibitive computational cost of the SDP for practical applications, a low-complexity suboptimal scheme is proposed by separately designing interference-suppressing transceivers based on interference alignment (IA and optimizing the transmit power allocation together with splitting factors. The transmit power allocation and receive power splitting problem is then recast as a convex optimization problem and solved efficiently. To further reduce the computational complexity, a low-complexity scheme is proposed by calculating the transmit power allocation and receive PS ratios in closed-form. Simulation results show the effectiveness of the proposed schemes in achieving SWIPT for MIMO interference channel (IC networks.

Quantitative utilization of prior biological knowledge in the Bayesian network modeling of gene expression data

Directory of Open Access Journals (Sweden)

Gao Shouguo

2011-08-01

Full Text Available Abstract Background Bayesian Network (BN is a powerful approach to reconstructing genetic regulatory networks from gene expression data. However, expression data by itself suffers from high noise and lack of power. Incorporating prior biological knowledge can improve the performance. As each type of prior knowledge on its own may be incomplete or limited by quality issues, integrating multiple sources of prior knowledge to utilize their consensus is desirable. Results We introduce a new method to incorporate the quantitative information from multiple sources of prior knowledge. It first uses the Naïve Bayesian classifier to assess the likelihood of functional linkage between gene pairs based on prior knowledge. In this study we included cocitation in PubMed and schematic similarity in Gene Ontology annotation. A candidate network edge reservoir is then created in which the copy number of each edge is proportional to the estimated likelihood of linkage between the two corresponding genes. In network simulation the Markov Chain Monte Carlo sampling algorithm is adopted, and samples from this reservoir at each iteration to generate new candidate networks. We evaluated the new algorithm using both simulated and real gene expression data including that from a yeast cell cycle and a mouse pancreas development/growth study. Incorporating prior knowledge led to a ~2 fold increase in the number of known transcription regulations recovered, without significant change in false positive rate. In contrast, without the prior knowledge BN modeling is not always better than a random selection, demonstrating the necessity in network modeling to supplement the gene expression data with additional information. Conclusion our new development provides a statistical means to utilize the quantitative information in prior biological knowledge in the BN modeling of gene expression data, which significantly improves the performance.

MUON DETECTORS: ALIGNMENT

CERN Multimedia

G.Gomez

2010-01-01

Most of the work in muon alignment since December 2009 has focused on the geometry reconstruction from the optical systems and improvements in the internal alignment of the DT chambers. The barrel optical alignment system has progressively evolved from reconstruction of single active planes to super-planes (December 09) to a new, full barrel reconstruction. Initial validation studies comparing this full barrel alignment at 0T with photogrammetry provide promising results. In addition, the method has been applied to CRAFT09 data, and the resulting alignment at 3.8T yields residuals from tracks (extrapolated from the tracker) which look smooth, suggesting a good internal barrel alignment with a small overall offset with respect to the tracker. This is a significant improvement, which should allow the optical system to provide a start-up alignment for 2010. The end-cap optical alignment has made considerable progress in the analysis of transfer line data. The next set of alignment constants for CSCs will there...

BFAST: an alignment tool for large scale genome resequencing.

Directory of Open Access Journals (Sweden)

Nils Homer

2009-11-01

Full Text Available The new generation of massively parallel DNA sequencers, combined with the challenge of whole human genome resequencing, result in the need for rapid and accurate alignment of billions of short DNA sequence reads to a large reference genome. Speed is obviously of great importance, but equally important is maintaining alignment accuracy of short reads, in the 25-100 base range, in the presence of errors and true biological variation.We introduce a new algorithm specifically optimized for this task, as well as a freely available implementation, BFAST, which can align data produced by any of current sequencing platforms, allows for user-customizable levels of speed and accuracy, supports paired end data, and provides for efficient parallel and multi-threaded computation on a computer cluster. The new method is based on creating flexible, efficient whole genome indexes to rapidly map reads to candidate alignment locations, with arbitrary multiple independent indexes allowed to achieve robustness against read errors and sequence variants. The final local alignment uses a Smith-Waterman method, with gaps to support the detection of small indels.We compare BFAST to a selection of large-scale alignment tools -- BLAT, MAQ, SHRiMP, and SOAP -- in terms of both speed and accuracy, using simulated and real-world datasets. We show BFAST can achieve substantially greater sensitivity of alignment in the context of errors and true variants, especially insertions and deletions, and minimize false mappings, while maintaining adequate speed compared to other current methods. We show BFAST can align the amount of data needed to fully resequence a human genome, one billion reads, with high sensitivity and accuracy, on a modest computer cluster in less than 24 hours. BFAST is available at (http://bfast.sourceforge.net.

Statistical alignment: computational properties, homology testing and goodness-of-fit