RESUMO
Manually finding relationship networks among compounds can be a hard and time-consuming task. However, this process is fundamental when looking for a metabolic pathway that explains how multiple compounds are related, to identify relevant pathways in organisms, filling gaps on metabolic networks, or when new mechanisms for the synthesis of important compounds are sought. Here, we present PhDSeeker, a new tool for the automatic search of metabolic pathways. This tool is able to relate simultaneously several compounds. Furthermore, its flexibility allows it to be easily configured for addressing a wide range of situations. Solutions found are provided not only in plain text but also as interactive representations that can be analyzed in a web browser. Source code is available at https://github.com/sinc-lab/phdseeker. A web service is also available at https://sinc.unl.edu.ar/web-demo/phds/. Several fully documented study cases, including their settings and solutions files, are also provided as Supplementary Material.
Assuntos
Algoritmos , Biologia Computacional/métodos , Mineração de Dados/métodos , Redes e Vias Metabólicas , Metabolômica/métodos , Internet , SoftwareRESUMO
One of the current challenges in bioinformatics is to discover new ways to transform a set of compounds into specific products. The usual approach is finding the reactions to synthesize a particular product, from a given substrate, by means of classical searching algorithms. However, they have three main limitations: difficulty in handling large amounts of reactions and compounds; absence of a step that verifies the availability of substrates; and inability to find branched pathways. We present here a novel bio-inspired algorithm for synthesizing linear and branched metabolic pathways. It allows relating several compounds simultaneously, ensuring the availability of substrates for every reaction in the solution. Comparisons with classical searching algorithms and other recent metaheuristic approaches show clear advantages of this proposal, fully recovering well-known pathways. Furthermore, solutions found can be analyzed in a simple way through graphical representations on the web.
Assuntos
Formigas/metabolismo , Redes e Vias Metabólicas , Metabolômica/métodos , Algoritmos , Animais , Comportamento Animal , Estudos de ViabilidadeRESUMO
Metabolic pathway building is an active field of research, necessary to understand and manipulate the metabolism of organisms. There are different approaches, mainly based on classical search methods, to find linear sequences of reactions linking two compounds. However, an important limitation of these methods is the exponential increase of search trees when a large number of compounds and reactions is considered. Besides, such models do not take into account all substrates for each reaction during the search, leading to solutions that lack biological feasibility in many cases. This work proposes a new evolutionary algorithm that allows searching not only linear, but also branched metabolic pathways, formed by feasible reactions that relate multiple compounds simultaneously. Tests performed using several sets of reactions show that this algorithm is able to find feasible linear and branched metabolic pathways.
Assuntos
Algoritmos , Evolução Biológica , Biologia Computacional/métodos , Redes e Vias Metabólicas/fisiologiaRESUMO
The evolutionary metabolic synthesizer (EvoMS) is an evolutionary tool capable of finding novel metabolic pathways linking several compounds through feasible reactions. It allows system biologists to explore different alternatives for relating specific metabolites, offering the possibility of indicating the initial compound or allowing the algorithm to automatically select it. Searching process can be followed graphically through several plots of the evolutionary process. Metabolic pathways found are displayed in a web browser as directed graphs. In all cases, solutions are networks of reactions that produce linear or branched metabolic pathways which are feasible from the specified set of available compounds. Source code of EvoMS is available at http://sourceforge.net/projects/sourcesinc/files/evoms/. Subsets of reactions are provided, as well as four examples for searching metabolic pathways among several compounds. Available as a web service at http://fich.unl.edu.ar/sinc/web-demo/evoms/.
Assuntos
Evolução Biológica , MetabolismoRESUMO
Searching metabolic pathways that relate two compounds is a common task in bioinformatics. This is of particular interest when trying, for example, to discover metabolic relations among compounds clustered with a data mining technique. Search strategies find sequences to relate two or more states (compounds) using an appropriate set of transitions (reactions). Evolutionary algorithms carry out the search guided by a fitness function and explore multiple candidate solutions using stochastic operators. In this work we propose an evolutionary algorithm for searching metabolic pathways between two compounds. The operators and fitness function employed are described and the effect of mutation rate is studied. Performance of this algorithm is compared with two classical search strategies. Source code and dataset are available at http://sourceforge.net/projects/sourcesinc/files/eamp/