<?xml version='1.0'?>
<!DOCTYPE art SYSTEM 'http://www.biomedcentral.com/xml/article.dtd'>
<art>
   <ui>1471-2105-13-S18-A7</ui>
   <ji>1471-2105</ji>
   <fm>
      <dochead>Meeting abstract</dochead>
      <bibl>
         <title>
            <p>A bioinformatics e-dating story: computational prediction and prioritization of receptor-ligand pairs</p>
         </title>
         <aug>
            <au ca="yes" id="A1"><snm>Iacucci</snm><fnm>Ernesto</fnm><insr iid="I1"/><email>ernesto.iacucci@gmail.com</email></au>
            <au id="A2"><snm>Tranchevent</snm><fnm>L&#233;on-Charles</fnm><insr iid="I1"/></au>
            <au id="A3"><snm>Popovic</snm><fnm>Dusan</fnm><insr iid="I1"/></au>
            <au id="A4"><snm>Pavlopoulos</snm><mi>A </mi><fnm>Georgios</fnm><insr iid="I1"/></au>
            <au id="A5"><snm>De Moor</snm><fnm>Bart</fnm><insr iid="I1"/></au>
            <au id="A6"><snm>Schneider</snm><fnm>Reinhard</fnm><insr iid="I2"/><insr iid="I3"/></au>
            <au id="A7"><snm>Moreau</snm><fnm>Yves</fnm><insr iid="I1"/></au>
         </aug>
         <insg>
            <ins id="I1"><p>IBBT Future Health Department / ESAT-SCD, KU Leuven, Kasteelpark Arenberg 10, 3001, Heverlee-Leuven, Belgium</p></ins>
            <ins id="I2"><p>Bioinformatics/Structural and Computational Biology, European Molecular Biology Laboratory, Meyerhofstrasse 1, 69117 Heidelberg, Germany</p></ins>
            <ins id="I3"><p>Luxembourg Centre for Systems Biomedicine (LCSB), University of Luxembourg, Campus Limpertsberg, 162 A, Avenue de la Fa&#239;encerie, 1511 Luxembourg, Germany</p></ins>
         </insg>
         <source>BMC Bioinformatics</source>
         
         
         <supplement><title><p>Highlights from the Eighth International Society for Computational Biology (ISCB) Student Council Symposium 2012</p></title><note>Meeting abstract</note></supplement><conference><title><p>Eighth International Society for Computational Biology (ISCB) Student Council Symposium 2012</p></title><location>Long Beach, CA, USA</location><date-range>13-14 July 2012</date-range><url>http://symposium.iscbsc.org/</url></conference><issn>1471-2105</issn>
         <pubdate>2012</pubdate>
         <volume>13</volume>
         <issue>Suppl 18</issue>
         <fpage>A7</fpage>
         <url>http://www.biomedcentral.com/1471-2105/13/S18/A7</url>
         <xrefbib><pubid idtype="doi">10.1186/1471-2105-13-S18-A7</pubid></xrefbib>
      </bibl>
      <history><pub><date><day>14</day><month>12</month><year>2012</year></date></pub></history>
      <cpyrt><year>2012</year><collab>Iacucci et al; licensee BioMed Central Ltd.</collab><note>This is an Open Access article distributed under the terms of the Creative Commons Attribution License (<url>http://creativecommons.org/licenses/by/2.0</url>), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</note></cpyrt>
   </fm>
   <bdy>
      <sec>
         <st>
            <p>Background</p>
         </st>
         <p>Regulation of cellular events is initiated, often, via extracellular signaling when a circulating protein ligand interacts with one or more membrane-bound protein receptors. Identification of receptor-ligand pairs is thus an important and difficult task to address as this form of interaction is transient and not well studied. In order to address this problem, we collect the most readily available data from repositories (expression, domain, pathway, sequence, and text-based), and apply a high through-put analysis to this problem.</p>
      </sec>
      <sec>
         <st>
            <p>Results</p>
         </st>
         <p>We have worked on the receptor-ligand pairing problem in three main studies. In our first study, using a LS-SVM classifier, we show that we are able to more aptly match members of the chemokine and tgf&#946; families than a previously published method <abbrgrp><abbr bid="B1">1</abbr></abbrgrp>. Notably, we are able to achieve an increase in recall of 0.76 over the 0.44 for the matching of receptor-ligands in the tgf&#946; family. In our subsequent study, we benchmarked several machine learning techniques, and essayed several parameters, on the receptior-ligand interaction prediction task. We found that we could reach a balanced accuracy of 0.84. In our final work, we produce a publicly available database of our results with respect to a text-based in silico prediction workflow. The resulting database, contains several key findings, particularly predictions in the GPCR family with a balanced accuracy of 0.96.</p>
      </sec>
      <sec>
         <st>
            <p>Conclusions</p>
         </st>
         <p>The receptor-ligand prediction task is an essential one, as the challenge of predicting such pairs is an important issue in wet-labs, biotech, and pharmaceutical companies. Through several studies, we have determined the most appropriate methodology to predict the receptor-ligand pairs and have made available high-quality predictions at our ReLianceDB website (<url>http://homes.esat.kuleuven.be/~bioiuser/ReLianceDB</url>), a tool to aid in performing effective and targeted research.</p>
      </sec>
   </bdy>
   <bm>
      <refgrp><bibl id="B1"><title><p>Inferring protein interactions from phylogenetic distance matrices</p></title><aug><au><snm>Gertz</snm><fnm>J</fnm></au><au><snm>Elfond</snm><fnm>G</fnm></au><au><snm>Shustrova</snm><fnm>A</fnm></au><au><snm>Weisinger</snm><fnm>M</fnm></au><au><snm>Pellegrini</snm><fnm>M</fnm></au><au><snm>Cokus</snm><fnm>S</fnm></au><au><snm>Rothschild</snm><fnm>B</fnm></au></aug><source>Bionformatics</source><pubdate>2003</pubdate><volume>19</volume><issue>16</issue><fpage>2039</fpage><lpage>2045</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1093/bioinformatics/btg278</pubid><pubid idtype="pmpid" link="fulltext">14594708</pubid></pubidlist></xrefbib></bibl></refgrp>
   </bm>
</art>