<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:creativeCommons="http://backend.userland.com/creativeCommonsRssModule" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/" version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:media="http://search.yahoo.com/mrss/">
  <channel>
    <title>Nature Precedings - Tag feed for graph theory</title>
    <link>http://precedings.nature.com/tags/graph%20theory</link>
    <description>Recently posted documents tagged with 'graph theory'</description>
    <dc:publisher>Nature Publishing Group</dc:publisher>
    <dc:language>en</dc:language>
    <prism:publicationName>Nature Precedings</prism:publicationName>
    <image>
      <title>Nature Precedings</title>
      <url>http://precedings.nature.com/images/header_logo.gif</url>
      <link>http://precedings.nature.com</link>
    </image>
    <atom:link type="application/rss+xml" rel="self" href="http://precedings.nature.com/tags/graph%20theory/feed"/>
    <item>
      <title>Connecting Seed Lists of Mammalian Proteins Using Steiner Trees</title>
      <link>http://precedings.nature.com/documents/1768/version/1</link>
      <description>Multivariate experiments and genomics studies applied to mammalian cells often produce lists of genes or proteins altered under treatment/disease vs. control/normal conditions. Such lists can be identified in known protein-protein interaction networks to produce subnetworks that &#8220;connect&#8221; the genes or proteins from the lists. Such subnetworks are valuable for biologists since they can suggest regulatory mechanisms that are altered under different conditions. Often such subnetworks are overloaded with links and nodes resulting in connectivity diagrams that are illegible due to edge overlap. In this study, we attempt to address this problem by implementing an approximation to the Steiner Tree problem to connect seed lists of mammalian proteins/genes using literature-based protein-protein interaction networks. To avoid over-representation of hubs in the resultant Steiner Trees we assign a cost to Steiner Vertices based on their connectivity degree. We applied the algorithm to lists of genes commonly mutated in colorectal cancer to demonstrate the usefulness of this approach.</description>
      <guid>http://precedings.nature.com/documents/1768/version/1</guid>
      <pubDate>Mon, 07 Apr 2008 16:22:36 UTC</pubDate>
      <dc:title>Connecting Seed Lists of Mammalian Proteins Using Steiner Trees</dc:title>
      <dc:identifier>hdl:10101/npre.2008.1768.1</dc:identifier>
      <dc:date>2008-04-07</dc:date>
      <dc:creator>Avi Ma'ayan</dc:creator>
      <prism:publicationName>Nature Precedings</prism:publicationName>
      <prism:publicationDate>2008-04-07T16:22:36Z</prism:publicationDate>
      <prism:category>Manuscript</prism:category>
      <prism:section>Biotechnology</prism:section>
      <prism:section>Cancer</prism:section>
      <prism:section>Molecular Cell Biology</prism:section>
      <prism:section>Bioinformatics</prism:section>
      <media:thumbnail url="http://precedings.nature.com/documents/1768/version/1/files/npre20081768-1.pdf.thumb.png"/>
      <creativeCommons:license>http://creativecommons.org/licenses/by/3.0/</creativeCommons:license>
    </item>
    <item>
      <title>Systems Pharmacology</title>
      <link>http://dx.doi.org/10.1038/npre.2008.1749.1</link>
      <description>The slides are from a presentation given by Professor Ravi Iyengar from Mount Sinai School of Medicine at the Drug Forum Meeting #9 that took place in Washington, DC on February 20-21, 2008. The slides describe two projects: one that was published last year, and the other unpublished. These projects used network analysis to explore the relationships between FDA approved drugs and a human protein-protein interaction network. </description>
      <guid>http://dx.doi.org/10.1038/npre.2008.1749.1</guid>
      <pubDate>Wed, 02 Apr 2008 19:57:56 UTC</pubDate>
      <dc:title>Systems Pharmacology</dc:title>
      <dc:identifier>doi:10.1038/npre.2008.1749.1</dc:identifier>
      <dc:date>2008-04-02</dc:date>
      <dc:creator>Ravi Iyengar</dc:creator>
      <prism:publicationName>Nature Precedings</prism:publicationName>
      <prism:publicationDate>2008-04-02T19:57:56Z</prism:publicationDate>
      <prism:category>Presentation</prism:category>
      <prism:section>Biotechnology</prism:section>
      <prism:section>Chemistry</prism:section>
      <prism:section>Pharmacology</prism:section>
      <prism:section>Bioinformatics</prism:section>
      <media:thumbnail url="http://precedings.nature.com/documents/1749/version/1/files/npre20081749-1.pdf.thumb.png"/>
      <creativeCommons:license>http://creativecommons.org/licenses/by/3.0/</creativeCommons:license>
    </item>
    <item>
      <title>Intracellular Regulatory Networks are close to Monotone Systems</title>
      <link>http://precedings.nature.com/documents/25/version/1</link>
      <description>Several meso-scale biological intracellular regulatory networks that have specified directionality of interactions have been recently assembled from experimental literature. Directed networks where links are characterized as positive or negative can be converted to systems of differential equations and analyzed as dynamical systems. Such analyses have shown that networks containing only sign-consistent loops, such as positive feed-forward and feedback loops function as monotone systems that display well-ordered behavior. Perturbations to monotone systems have unambiguous global effects and a predictability characteristic that confers advantages for robustness and adaptability. We find that three intracellular regulatory networks: bacterial and yeast transcriptional networks and a mammalian signaling network contain far more sign-consistent feedback and feed-forward loops than expected for shuffled networks. Inconsistent loops with negative links can be more easily removed from real regulatory networks as compared to shuffled networks. This topological feature in real networks emerges from the presence of hubs that are enriched for either negative or positive links, and is not due to a preference for double negative links in paths. These observations indicate that intracellular regulatory networks may be close to monotone systems and that this network topology contributes to the dynamic stability.</description>
      <guid>http://precedings.nature.com/documents/25/version/1</guid>
      <pubDate>Tue, 23 Jan 2007 16:58:17 UTC</pubDate>
      <dc:title>Intracellular Regulatory Networks are close to Monotone Systems</dc:title>
      <dc:identifier>hdl:10101/npre.2007.25.1</dc:identifier>
      <dc:date>2007-01-23</dc:date>
      <dc:creator>Avi Ma'ayan</dc:creator>
      <prism:publicationName>Nature Precedings</prism:publicationName>
      <prism:publicationDate>2007-01-23T16:58:17Z</prism:publicationDate>
      <prism:category>Manuscript</prism:category>
      <prism:section>Molecular Cell Biology</prism:section>
      <prism:section>Bioinformatics</prism:section>
      <media:thumbnail url="http://precedings.nature.com/documents/25/version/1/files/npre200725-1.pdf.thumb.png"/>
      <creativeCommons:license>http://creativecommons.org/licenses/by/2.5/</creativeCommons:license>
    </item>
    <item>
      <title>Dynamic Topology of Biological Networks</title>
      <link>http://dx.doi.org/10.1038/npre.2007.24.1</link>
      <description>The mammalian cell can be represented as a large modular network that consists of a central signal network that interacts with and regulates multiple cellular machines that are responsible for phenotypic behavior.  We have used graph-theory approaches to analyze signal flow through a network representing the hippocampal neuron and find that signal-induced connectivity results in the formation of many regulatory motifs. Information flow through the central signaling network is initiated by extra-cellular signals such as hormones binding to their receptors. The flow of information through the signaling network results in the appearance of regulatory motifs such as feedback loops, feedforward and bifan motifs. Within the large cellular networks, these regulatory motifs are juxtaposed next to each other in several formats such as the stacked configuration or the nested configuration. We have studied the dynamics of regulatory motifs by biochemical computation using ordinary differential equation models. Positive feedback loops can function as bistable switches. Nested feed-forward motifs can give rise to two emergent properties: coincidence detection and prolonged outputs for short inputs.  Bifan motifs can control response times, with some configurations working as delays and others promoting rapid responses. Bifan motifs can also act as filters. Feed-forward motifs lead to signal prolongation and thus function as a switch to alter cell state. The functional consequences of organization of motifs within networks as well as the properties of feedback, feedforward and bifans motifs are presented.  </description>
      <guid>http://dx.doi.org/10.1038/npre.2007.24.1</guid>
      <pubDate>Tue, 23 Jan 2007 13:01:12 UTC</pubDate>
      <dc:title>Dynamic Topology of Biological Networks</dc:title>
      <dc:identifier>doi:10.1038/npre.2007.24.1</dc:identifier>
      <dc:date>2007-01-23</dc:date>
      <dc:creator>Ravi Iyengar</dc:creator>
      <prism:publicationName>Nature Precedings</prism:publicationName>
      <prism:publicationDate>2007-01-23T13:01:12Z</prism:publicationDate>
      <prism:category>Presentation</prism:category>
      <prism:section>Molecular Cell Biology</prism:section>
      <prism:section>Neuroscience</prism:section>
      <prism:section>Pharmacology</prism:section>
      <prism:section>Bioinformatics</prism:section>
      <media:thumbnail url="http://precedings.nature.com/documents/24/version/1/files/npre200724-1.pdf.thumb.png"/>
      <creativeCommons:license>http://creativecommons.org/licenses/by/2.5/</creativeCommons:license>
    </item>
  </channel>
</rss>
