Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

FIDDLE: Efficient Assembly of Networks That Satisfy Desired Behavior

View through CrossRef
Abstract Background: Due to the complexity and redundancy of biological systems, computational models are difficult and laborious to create and update. Therefore, machine reading and automated model assembly are of great interest to computational and systems biologists. Here, we describe FIDDLE (Finding Interactions using Diagram Driven modeL Extension), the tool that we built with the goal to automatically assemble or extend models with the knowledge extracted from published literature. The two main methods developed as part of FIDDLE are called Breadth First Addition (BFA) and Depth First Addition (DFA), and they are based on network search algorithms. To assess the advantages and limitations of BFA and DFA, we applied them on Erdös-Rényi random networks (ER) and Barabási-Albert scale-free networks (BA) as models of biological networks. Starting with several different baseline models and different sets of candidate edges, we conducted a comprehensive evaluation of the BFA and DFA algorithms and their ability to either reconstruct a specified network structure or assemble models that reproduce the same behavior as defined golden models.Results: When BFA and DFA are applied to random networks, we are able to show that model extension with BFA is more specific and DFA is a more sensitive approach. When applied to scale-free networks, both BFA and DFA demonstrated very limited success. Conclusion: Results suggest that BFA is a better method for assembling abundant but mixed true and false information, while DFA will better assemble fewer and more truthful interactions. The limited success with scale-free networks suggests a fundamental difficulty with automatically creating biological models due to the inherent redundancy and complexity of biological networks. These methods represent an early attempt and a novel approach to truly autonomous model creation or extension given different types of knowledge. The source code is available at: https://bitbucket.org/biodesignlab/fiddle/.
Title: FIDDLE: Efficient Assembly of Networks That Satisfy Desired Behavior
Description:
Abstract Background: Due to the complexity and redundancy of biological systems, computational models are difficult and laborious to create and update.
Therefore, machine reading and automated model assembly are of great interest to computational and systems biologists.
Here, we describe FIDDLE (Finding Interactions using Diagram Driven modeL Extension), the tool that we built with the goal to automatically assemble or extend models with the knowledge extracted from published literature.
The two main methods developed as part of FIDDLE are called Breadth First Addition (BFA) and Depth First Addition (DFA), and they are based on network search algorithms.
To assess the advantages and limitations of BFA and DFA, we applied them on Erdös-Rényi random networks (ER) and Barabási-Albert scale-free networks (BA) as models of biological networks.
Starting with several different baseline models and different sets of candidate edges, we conducted a comprehensive evaluation of the BFA and DFA algorithms and their ability to either reconstruct a specified network structure or assemble models that reproduce the same behavior as defined golden models.
Results: When BFA and DFA are applied to random networks, we are able to show that model extension with BFA is more specific and DFA is a more sensitive approach.
When applied to scale-free networks, both BFA and DFA demonstrated very limited success.
Conclusion: Results suggest that BFA is a better method for assembling abundant but mixed true and false information, while DFA will better assemble fewer and more truthful interactions.
The limited success with scale-free networks suggests a fundamental difficulty with automatically creating biological models due to the inherent redundancy and complexity of biological networks.
These methods represent an early attempt and a novel approach to truly autonomous model creation or extension given different types of knowledge.
The source code is available at: https://bitbucket.
org/biodesignlab/fiddle/.

Related Results

RAMMER OG ROM
RAMMER OG ROM
Rammer og romUtvikling av toradarspel med utgangspunkt i overføring av låtspel frå hardingfele og fele. Prosjektet rører seg i feltet tradisjonsmusikk i Noreg og Sverige. Det har ...
Loop and uLoop assembly v4
Loop and uLoop assembly v4
This protocol is used for performing Type IIS assembly by either BsaI or SapI-mediated restriction/ligation using Loop assembly with either Loop or uLoop plasmids. Loop assembly ...
Loop assembly v2
Loop assembly v2
This protocol is used for performing Type IIS assembly by either BsaI or SapI-mediated restriction/ligation using Loop assembly. Loop assembly comprises8receiver plasmids in odd ...
Loop and uLoop assembly v5
Loop and uLoop assembly v5
This protocol is used for performing Type IIS assembly by either BsaI or SapI-mediated restriction/ligation using Loop assembly with either Loop or uLoop plasmids. Loop assembly ...
Loop assembly protocol v1.0 v1
Loop assembly protocol v1.0 v1
This protocol is used for performing Type IIS assembly by either BsaI or SapI-mediated restriction/ligation using the Loop assembly system. Loop assembly comprises8receiver plasm...
An Assembly Line Multi-Station Assembly Sequence Planning Method Based on Particle Swarm Optimization Algorithm
An Assembly Line Multi-Station Assembly Sequence Planning Method Based on Particle Swarm Optimization Algorithm
<p>Aiming at the problem that the existing assembly sequence planning methods are difficult to meet the multi-station assembly requirements of assembly line, an assembly sequ...
Grid‐enabled collaborative virtual assembly environment
Grid‐enabled collaborative virtual assembly environment
PurposeOwing to the numerous part models and massive datasets used in automobile assembly design, virtual assembly software cannot simulate a whole vehicle smoothly in real time. F...
Formulation and Search of Assembly Sequence Design Spaces for Efficient Use of Assembly Plant Resources for New Products
Formulation and Search of Assembly Sequence Design Spaces for Efficient Use of Assembly Plant Resources for New Products
Efficient procedures for generation of feasible assembly sequences and effective utilization of available assembly plant resources can greatly reduce the development time and cost ...

Back to Top