Loading…

Theoretical knock-outs on biological networks

In this work we formalize a method to compute the degree of importance of biological agents that participates on the dynamics of a biological phenomenon build upon a complex network. We call this new procedure by theoretical knock-out (KO). To devise this method, we make two approaches: algebraicall...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2015-12
Main Authors: Miranda, Pedro Jeferson, Sandro Ely de Souza Pinto, Murilo da Silva Baptista, Giuliano Gadioli La Guardia
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Miranda, Pedro Jeferson
Sandro Ely de Souza Pinto
Murilo da Silva Baptista
Giuliano Gadioli La Guardia
description In this work we formalize a method to compute the degree of importance of biological agents that participates on the dynamics of a biological phenomenon build upon a complex network. We call this new procedure by theoretical knock-out (KO). To devise this method, we make two approaches: algebraically and algorithmically. In both cases we compute a vector on an asymptotic state, called flux vector. The flux is given by a random walk on a directed graph that represents a biological phenomenon. This vector gives us the information about the relative flux of walkers on a vertex which represents a biological agent. With two vector of this kind, we can calculate the relative mean error between them by averaging over its coefficients. This quantity allows us to assess the degree of importance of each vertex of a complex network that evolves in time and has experimental background. We find out that this procedure can be applied in any sort of biological phenomena in which we can know the role and interrelationships of its agents. These results also provide experimental biologists to predict the order of importance of biological agents on a mounted complex network.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2083832565</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2083832565</sourcerecordid><originalsourceid>FETCH-proquest_journals_20838325653</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQDclIzS9KLclMTsxRyM7LT87WzS8tKVbIz1NIyszPyU8HS-SllpTnF2UX8zCwpiXmFKfyQmluBmU31xBnD92CovzC0tTikvis_NKiPKBUvJGBhbGFsZGpmakxcaoA8vQydw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2083832565</pqid></control><display><type>article</type><title>Theoretical knock-outs on biological networks</title><source>ProQuest - Publicly Available Content Database</source><creator>Miranda, Pedro Jeferson ; Sandro Ely de Souza Pinto ; Murilo da Silva Baptista ; Giuliano Gadioli La Guardia</creator><creatorcontrib>Miranda, Pedro Jeferson ; Sandro Ely de Souza Pinto ; Murilo da Silva Baptista ; Giuliano Gadioli La Guardia</creatorcontrib><description>In this work we formalize a method to compute the degree of importance of biological agents that participates on the dynamics of a biological phenomenon build upon a complex network. We call this new procedure by theoretical knock-out (KO). To devise this method, we make two approaches: algebraically and algorithmically. In both cases we compute a vector on an asymptotic state, called flux vector. The flux is given by a random walk on a directed graph that represents a biological phenomenon. This vector gives us the information about the relative flux of walkers on a vertex which represents a biological agent. With two vector of this kind, we can calculate the relative mean error between them by averaging over its coefficients. This quantity allows us to assess the degree of importance of each vertex of a complex network that evolves in time and has experimental background. We find out that this procedure can be applied in any sort of biological phenomena in which we can know the role and interrelationships of its agents. These results also provide experimental biologists to predict the order of importance of biological agents on a mounted complex network.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Flux ; Graph theory ; Random walk</subject><ispartof>arXiv.org, 2015-12</ispartof><rights>2015. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2083832565?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Miranda, Pedro Jeferson</creatorcontrib><creatorcontrib>Sandro Ely de Souza Pinto</creatorcontrib><creatorcontrib>Murilo da Silva Baptista</creatorcontrib><creatorcontrib>Giuliano Gadioli La Guardia</creatorcontrib><title>Theoretical knock-outs on biological networks</title><title>arXiv.org</title><description>In this work we formalize a method to compute the degree of importance of biological agents that participates on the dynamics of a biological phenomenon build upon a complex network. We call this new procedure by theoretical knock-out (KO). To devise this method, we make two approaches: algebraically and algorithmically. In both cases we compute a vector on an asymptotic state, called flux vector. The flux is given by a random walk on a directed graph that represents a biological phenomenon. This vector gives us the information about the relative flux of walkers on a vertex which represents a biological agent. With two vector of this kind, we can calculate the relative mean error between them by averaging over its coefficients. This quantity allows us to assess the degree of importance of each vertex of a complex network that evolves in time and has experimental background. We find out that this procedure can be applied in any sort of biological phenomena in which we can know the role and interrelationships of its agents. These results also provide experimental biologists to predict the order of importance of biological agents on a mounted complex network.</description><subject>Flux</subject><subject>Graph theory</subject><subject>Random walk</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQDclIzS9KLclMTsxRyM7LT87WzS8tKVbIz1NIyszPyU8HS-SllpTnF2UX8zCwpiXmFKfyQmluBmU31xBnD92CovzC0tTikvis_NKiPKBUvJGBhbGFsZGpmakxcaoA8vQydw</recordid><startdate>20151201</startdate><enddate>20151201</enddate><creator>Miranda, Pedro Jeferson</creator><creator>Sandro Ely de Souza Pinto</creator><creator>Murilo da Silva Baptista</creator><creator>Giuliano Gadioli La Guardia</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20151201</creationdate><title>Theoretical knock-outs on biological networks</title><author>Miranda, Pedro Jeferson ; Sandro Ely de Souza Pinto ; Murilo da Silva Baptista ; Giuliano Gadioli La Guardia</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20838325653</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Flux</topic><topic>Graph theory</topic><topic>Random walk</topic><toplevel>online_resources</toplevel><creatorcontrib>Miranda, Pedro Jeferson</creatorcontrib><creatorcontrib>Sandro Ely de Souza Pinto</creatorcontrib><creatorcontrib>Murilo da Silva Baptista</creatorcontrib><creatorcontrib>Giuliano Gadioli La Guardia</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest - Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Miranda, Pedro Jeferson</au><au>Sandro Ely de Souza Pinto</au><au>Murilo da Silva Baptista</au><au>Giuliano Gadioli La Guardia</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Theoretical knock-outs on biological networks</atitle><jtitle>arXiv.org</jtitle><date>2015-12-01</date><risdate>2015</risdate><eissn>2331-8422</eissn><abstract>In this work we formalize a method to compute the degree of importance of biological agents that participates on the dynamics of a biological phenomenon build upon a complex network. We call this new procedure by theoretical knock-out (KO). To devise this method, we make two approaches: algebraically and algorithmically. In both cases we compute a vector on an asymptotic state, called flux vector. The flux is given by a random walk on a directed graph that represents a biological phenomenon. This vector gives us the information about the relative flux of walkers on a vertex which represents a biological agent. With two vector of this kind, we can calculate the relative mean error between them by averaging over its coefficients. This quantity allows us to assess the degree of importance of each vertex of a complex network that evolves in time and has experimental background. We find out that this procedure can be applied in any sort of biological phenomena in which we can know the role and interrelationships of its agents. These results also provide experimental biologists to predict the order of importance of biological agents on a mounted complex network.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2015-12
issn 2331-8422
language eng
recordid cdi_proquest_journals_2083832565
source ProQuest - Publicly Available Content Database
subjects Flux
Graph theory
Random walk
title Theoretical knock-outs on biological networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T07%3A13%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Theoretical%20knock-outs%20on%20biological%20networks&rft.jtitle=arXiv.org&rft.au=Miranda,%20Pedro%20Jeferson&rft.date=2015-12-01&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2083832565%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20838325653%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2083832565&rft_id=info:pmid/&rfr_iscdi=true