Structure Optimization for Large Gene Networks Based on Greedy Strategy

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In the last few years, gene networks have become one of most important tools to model biological processes. Among other utilities, these networks visually show biological relationships between genes. However, due to the large amount of the currently generated genetic data, their size has grown to the point of being unmanageable. To solve this problem, it is possible to use computational approaches, such as heuristics-based methods, to analyze and optimize gene network's structure by pruning irrelevant relationships. In this paper we present a new method, called GeSOp, to optimize large gene network structures. The method is able to perform a considerably prune of the irrelevant relationships comprising the input network. To do so, the method is based on a greedy heuristic to obtain the most relevant subnetwork. The performance of our method was tested by means of two experiments on gene networks obtained from different organisms. The first experiment shows how GeSOp is able not only to carry out a significant reduction in the size of the network, but also to maintain the biological information ratio. In the second experiment, the ability to improve the biological indicators of the network is checked. Hence, the results presented show that GeSOp is a reliable method to optimize and improve the structure of large gene networks.

Cite

CITATION STYLE

APA

Gómez-Vela, F., Rodriguez-Baena, D. S., & Vázquez-Noguera, J. L. (2018). Structure Optimization for Large Gene Networks Based on Greedy Strategy. Computational and Mathematical Methods in Medicine, 2018. https://doi.org/10.1155/2018/9674108

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free