<?xml version='1.0'?>
<!DOCTYPE art SYSTEM 'http://www.biomedcentral.com/xml/article.dtd'>
<art>
   <ui>1687-4153-2007-79879</ui>
   <ji>1687-4153</ji>
   <fm>
      <dochead>Research Article</dochead>
      <bibl>
         <title>
            <p>Information-Theoretic Inference of Large Transcriptional Regulatory Networks</p>
         </title>
         <aug>
            <au ca="yes" id="A1"><snm>Meyer</snm><mi>E</mi><fnm>Patrick</fnm><insr iid="I1"/><email>pmeyer@ulb.ac.be</email></au>
            <au id="A2"><snm>Kontos</snm><fnm>Kevin</fnm><insr iid="I1"/><email>kkontos@ulb.ac.be</email></au>
            <au id="A3"><snm>Lafitte</snm><fnm>Frederic</fnm><insr iid="I1"/><email>flafitte@ulb.ac.be</email></au>
            <au id="A4"><snm>Bontempi</snm><fnm>Gianluca</fnm><insr iid="I1"/><email>gbonte@ulb.ac.be</email></au>
         </aug>
         <insg>
            <ins id="I1"><p>ULB Machine Learning Group, Computer Science Department, Universit&#233; Libre de Bruxelles, Brussels 1050, Belgium</p></ins>
         </insg>
         <source>EURASIP Journal on Bioinformatics and Systems Biology</source>
         <issn>1687-4153</issn>
         <pubdate>2007</pubdate>
         <volume>2007</volume>
         <issue>1</issue>
         <fpage>79879</fpage>
         <url>http://bsb.eurasipjournals.com/content/2007/1/79879</url>
         <xrefbib><pubid idtype="doi">10.1155/2007/79879</pubid></xrefbib>
      </bibl>
      <history><rec><date><day>26</day><month>1</month><year>2007</year></date></rec><acc><date><day>12</day><month>5</month><year>2007</year></date></acc><pub><date><day>24</day><month>6</month><year>2007</year></date></pub></history>
      <cpyrt><year>2007</year><collab>Patrick E. Meyer et al.</collab><note>This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</note></cpyrt>
      <abs>
         <sec>
            <st>
               <p/>
            </st>
            <p>The paper presents MRNET, an original method for inferring genetic networks from microarray data. The method is based on maximum relevance/minimum redundancy (MRMR), an effective information-theoretic technique for feature selection in supervised learning. The MRMR principle consists in selecting among the least redundant variables the ones that have the highest mutual information with the target. MRNET extends this feature selection principle to networks in order to infer gene-dependence relationships from microarray data. The paper assesses MRNET by benchmarking it against RELNET, CLR, and ARACNE, three state-of-the-art information-theoretic methods for large (up to several thousands of genes) network inference. Experimental results on thirty synthetically generated microarray datasets show that MRNET is competitive with these methods.</p>
         </sec>
      </abs>
   </fm>
   <bdy>
      <sec>
         <st>
            <p/>
         </st>
         <p>[<abbr bid="B1">1</abbr><abbr bid="B2">2</abbr><abbr bid="B3">3</abbr><abbr bid="B4">4</abbr><abbr bid="B5">5</abbr><abbr bid="B6">6</abbr><abbr bid="B7">7</abbr><abbr bid="B8">8</abbr><abbr bid="B9">9</abbr><abbr bid="B10">10</abbr><abbr bid="B11">11</abbr><abbr bid="B12">12</abbr><abbr bid="B13">13</abbr><abbr bid="B14">14</abbr><abbr bid="B15">15</abbr><abbr bid="B16">16</abbr><abbr bid="B17">17</abbr><abbr bid="B18">18</abbr><abbr bid="B19">19</abbr><abbr bid="B20">20</abbr><abbr bid="B21">21</abbr><abbr bid="B22">22</abbr><abbr bid="B23">23</abbr><abbr bid="B24">24</abbr><abbr bid="B25">25</abbr><abbr bid="B26">26</abbr><abbr bid="B27">27</abbr><abbr bid="B28">28</abbr>]</p>
      </sec>
   </bdy>
   <bm>
      <refgrp><bibl id="B1"><title><p>Genetic network modeling</p></title><aug><au><snm>van Someren</snm><fnm>EP</fnm></au><au><snm>Wessels</snm><fnm>LFA</fnm></au><au><snm>Backer</snm><fnm>E</fnm></au><au><snm>Reinders</snm><fnm>MJT</fnm></au></aug><source>Pharmacogenomics</source><pubdate>2002</pubdate><volume>3</volume><issue>4</issue><fpage>507</fpage><lpage>525</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1517/14622416.3.4.507</pubid><pubid idtype="pmpid" link="fulltext">12164774</pubid></pubidlist></xrefbib></bibl><bibl id="B2"><title><p>Reverse-engineering transcription control networks</p></title><aug><au><snm>Gardner</snm><fnm>TS</fnm></au><au><snm>Faith</snm><fnm>JJ</fnm></au></aug><source>Physics of Life Reviews</source><pubdate>2005</pubdate><volume>2</volume><issue>1</issue><fpage>65</fpage><lpage>88</lpage><xrefbib><pubid idtype="doi">10.1016/j.plrev.2005.01.001</pubid></xrefbib></bibl><bibl id="B3"><title><p>Approximating discrete probability distributions with dependence trees</p></title><aug><au><snm>Chow</snm><fnm>C</fnm></au><au><snm>Liu</snm><fnm>C</fnm></au></aug><source>IEEE Transactions on Information Theory</source><pubdate>1968</pubdate><volume>14</volume><issue>3</issue><fpage>462</fpage><lpage>467</lpage><xrefbib><pubid idtype="doi">10.1109/TIT.1968.1054142</pubid></xrefbib></bibl><bibl id="B4"><title><p>Mutual information relevance networks: functional genomic clustering using pairwise entropy measurements</p></title><aug><au><snm>Butte</snm><fnm>AJ</fnm></au><au><snm>Kohane</snm><fnm>IS</fnm></au></aug><source>Pacific Symposium on Biocomputing</source><pubdate>2000</pubdate><fpage>418</fpage><lpage>429</lpage></bibl><bibl id="B5"><title><p>ARACNE: an algorithm for the reconstruction of gene regulatory networks in a mammalian cellular context</p></title><aug><au><snm>Margolin</snm><fnm>AA</fnm></au><au><snm>Nemenman</snm><fnm>I</fnm></au><au><snm>Basso</snm><fnm>K</fnm></au><etal/></aug><source>BMC Bioinformatics</source><pubdate>2006</pubdate><volume>7</volume><issue>1</issue><fpage>S7</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1186/1471-2105-7-S1-S7</pubid><pubid idtype="pmcid">1764484</pubid><pubid idtype="pmpid" link="fulltext">17254312</pubid></pubidlist></xrefbib></bibl><bibl id="B6"><title><p>Large-scale mapping and validation of <it>Escherichia coli</it> transcriptional regulation from a compendium of expression profiles</p></title><aug><au><snm>Faith</snm><fnm>JJ</fnm></au><au><snm>Hayete</snm><fnm>B</fnm></au><au><snm>Thaden</snm><fnm>JT</fnm></au><etal/></aug><source>PLoS Biology</source><pubdate>2007</pubdate><volume>5</volume><issue>1</issue><fpage>e8</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1371/journal.pbio.0050008</pubid><pubid idtype="pmcid">1764438</pubid><pubid idtype="pmpid" link="fulltext">17214507</pubid></pubidlist></xrefbib></bibl><bibl id="B7"><aug><au><snm>Pearl</snm><fnm>J</fnm></au></aug><source>Probabilistic Reasoning in Intelligent Systems: Networks of Plausible</source><publisher>Morgan Kaufmann, San Fransisco, Calif, USA</publisher><pubdate>1988</pubdate></bibl><bibl id="B8"><title><p>Learning Bayesian networks from data: an information-theory based approach</p></title><aug><au><snm>Cheng</snm><fnm>J</fnm></au><au><snm>Greiner</snm><fnm>R</fnm></au><au><snm>Kelly</snm><fnm>J</fnm></au><au><snm>Bell</snm><fnm>D</fnm></au><au><snm>Liu</snm><fnm>W</fnm></au></aug><source>Artificial Intelligence</source><pubdate>2002</pubdate><volume>137</volume><issue>1-2</issue><fpage>43</fpage><lpage>90</lpage><xrefbib><pubid idtype="doi">10.1016/S0004-3702(02)00191-1</pubid></xrefbib></bibl><bibl id="B9"><title><p>Network information and connected correlations</p></title><aug><au><snm>Schneidman</snm><fnm>E</fnm></au><au><snm>Still</snm><fnm>S</fnm></au><au><snm>Berry</snm><fnm>MJ</fnm><suf>II</suf></au><au><snm>Bialek</snm><fnm>W</fnm></au></aug><source>Physical Review Letters</source><pubdate>2003</pubdate><volume>91</volume><issue>23</issue><fpage>4 pages</fpage></bibl><bibl id="B10"><title><p>Multivariate dependence, and genetic network inference</p></title><aug><au><snm>Nemenman</snm><fnm>I</fnm></au></aug><source>Tech. Rep. NSF-KITP-04-54</source><publisher>KITP, UCSB, Santa Barbara, Calif, USA</publisher><pubdate>2004</pubdate></bibl><bibl id="B11"><title><p>Application of the mutual information criterion for feature selection in computer-aided diagnosis</p></title><aug><au><snm>Tourassi</snm><fnm>GD</fnm></au><au><snm>Frederick</snm><fnm>ED</fnm></au><au><snm>Markey</snm><fnm>MK</fnm></au><au><snm>Floyd</snm><fnm>CE</fnm><suf>Jr.</suf></au></aug><source>Medical Physics</source><pubdate>2001</pubdate><volume>28</volume><issue>12</issue><fpage>2394</fpage><lpage>2402</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1118/1.1418724</pubid><pubid idtype="pmpid">11797941</pubid></pubidlist></xrefbib></bibl><bibl id="B12"><title><p>Minimum redundancy feature selection from microarray gene expression data</p></title><aug><au><snm>Ding</snm><fnm>C</fnm></au><au><snm>Peng</snm><fnm>H</fnm></au></aug><source>Journal of Bioinformatics and Computational Biology</source><pubdate>2005</pubdate><volume>3</volume><issue>2</issue><fpage>185</fpage><lpage>205</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1142/S0219720005001004</pubid><pubid idtype="pmpid" link="fulltext">15852500</pubid></pubidlist></xrefbib></bibl><bibl id="B13"><title><p>On the use of variable complementarity for feature selection in cancer classification</p></title><aug><au><snm>Meyer</snm><fnm>PE</fnm></au><au><snm>Bontempi</snm><fnm>G</fnm></au></aug><source>Applications of Evolutionary Computing: EvoWorkshops, Lecture Notes in Computer Science</source><publisher>Springer, Berlin, Germany</publisher><editor>Rothlauf F, Branke J, Cagnoniet S, et al.</editor><pubdate>2006</pubdate><volume>3907</volume><fpage>91</fpage><lpage>102</lpage><xrefbib><pubid idtype="doi">10.1007/11732242_9</pubid></xrefbib></bibl><bibl id="B14"><title><p>Biological network inference using redundancy analysis</p></title><aug><au><snm>Meyer</snm><fnm>PE</fnm></au><au><snm>Kontos</snm><fnm>K</fnm></au><au><snm>Bontempi</snm><fnm>G</fnm></au></aug><source>Proceedings of the 1st International Conference on Bioinformatics Research and Development (BIRD &apos;07), Berlin, Germany, March 2007</source><fpage>916</fpage><lpage>927</lpage></bibl><bibl id="B15"><title><p>Discovering functional relationships between RNA expression and chemotherapeutic susceptibility using relevance networks</p></title><aug><au><snm>Butte</snm><fnm>AJ</fnm></au><au><snm>Tamayo</snm><fnm>P</fnm></au><au><snm>Slonim</snm><fnm>D</fnm></au><au><snm>Golub</snm><fnm>TR</fnm></au><au><snm>Kohane</snm><fnm>IS</fnm></au></aug><source>Proceedings of the National Academy of Sciences of the United States of America</source><pubdate>2000</pubdate><volume>97</volume><issue>22</issue><fpage>12182</fpage><lpage>12186</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.220392197</pubid><pubid idtype="pmcid">17315</pubid><pubid idtype="pmpid" link="fulltext">11027309</pubid></pubidlist></xrefbib></bibl><bibl id="B16"><aug><au><snm>Cover</snm><fnm>TM</fnm></au><au><snm>Thomas</snm><fnm>JA</fnm></au></aug><source>Elements of Information Theory</source><publisher>John Wiley &amp; Sons, New York, NY, USA</publisher><pubdate>1990</pubdate></bibl><bibl id="B17"><title><p>Greedy and local search heuristics for unconstrained binary quadratic programming</p></title><aug><au><snm>Merz</snm><fnm>P</fnm></au><au><snm>Freisleben</snm><fnm>B</fnm></au></aug><source>Journal of Heuristics</source><pubdate>2002</pubdate><volume>8</volume><issue>2</issue><fpage>197</fpage><lpage>213</lpage><xrefbib><pubid idtype="doi">10.1023/A:1017912624016</pubid></xrefbib></bibl><bibl id="B18"><title><p>A Bayesian regression approach to the inference of regulatory networks from gene expression data</p></title><aug><au><snm>Rogers</snm><fnm>S</fnm></au><au><snm>Girolami</snm><fnm>M</fnm></au></aug><source>Bioinformatics</source><pubdate>2005</pubdate><volume>21</volume><issue>14</issue><fpage>3131</fpage><lpage>3137</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1093/bioinformatics/bti487</pubid><pubid idtype="pmpid" link="fulltext">15879452</pubid></pubidlist></xrefbib></bibl><bibl id="B19"><title><p>SynTReN: a generator of synthetic gene expression data for design and analysis of structure learning algorithms</p></title><aug><au><snm>van den Bulcke</snm><fnm>T</fnm></au><au><snm>van Leemput</snm><fnm>K</fnm></au><au><snm>Naudts</snm><fnm>B</fnm></au><etal/></aug><source>BMC Bioinformatics</source><pubdate>2006</pubdate><volume>7</volume><fpage>43</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1186/1471-2105-7-43</pubid><pubid idtype="pmcid">1373604</pubid><pubid idtype="pmpid" link="fulltext">16438721</pubid></pubidlist></xrefbib></bibl><bibl id="B20"><title><p>Estimation of entropy and mutual information</p></title><aug><au><snm>Paninski</snm><fnm>L</fnm></au></aug><source>Neural Computation</source><pubdate>2003</pubdate><volume>15</volume><issue>6</issue><fpage>1191</fpage><lpage>1253</lpage><xrefbib><pubid idtype="doi">10.1162/089976603321780272</pubid></xrefbib></bibl><bibl id="B21"><title><p>Nonparametric entropy estimation: an overview</p></title><aug><au><snm>Beirlant</snm><fnm>J</fnm></au><au><snm>Dudewica</snm><fnm>EJ</fnm></au><au><snm>Gyofi</snm><fnm>L</fnm></au><au><snm>van der Meulen</snm><fnm>E</fnm></au></aug><source>Journal of Statistics</source><pubdate>1997</pubdate><volume>6</volume><issue>1</issue><fpage>17</fpage><lpage>39</lpage></bibl><bibl id="B22"><title><p>Supervised and unsupervised discretization of continuous features</p></title><aug><au><snm>Dougherty</snm><fnm>J</fnm></au><au><snm>Kohavi</snm><fnm>R</fnm></au><au><snm>Sahami</snm><fnm>M</fnm></au></aug><source>Proceedings of the 12th International Conference on Machine Learning (ML &apos;95), Lake Tahoe, Calif, USA, July 1995</source><fpage>194</fpage><lpage>202</lpage></bibl><bibl id="B23"><title><p>The case against accuracy estimation for comparing induction algorithms</p></title><aug><au><snm>Provost</snm><fnm>FJ</fnm></au><au><snm>Fawcett</snm><fnm>T</fnm></au><au><snm>Kohavi</snm><fnm>R</fnm></au></aug><source>Proceedings of the 15th International Conference on Machine Learning (ICML &apos;98), Madison, Wis, USA, July 1998</source><publisher>Morgan Kaufmann</publisher><fpage>445</fpage><lpage>453</lpage></bibl><bibl id="B24"><title><p>Markov networks for detecting overlapping elements in sequence data</p></title><aug><au><snm>Bockhorst</snm><fnm>J</fnm></au><au><snm>Craven</snm><fnm>M</fnm></au></aug><source>Advances in Neural Information Processing Systems 17</source><publisher>MIT Press, Cambridge, Mass, USA</publisher><editor>Saul LK, Weiss Y, Bottou L</editor><pubdate>2005</pubdate><fpage>193</fpage><lpage>200</lpage></bibl><bibl id="B25"><title><p>Approximate statistical tests for comparing supervised classification learning algorithms</p></title><aug><au><snm>Dietterich</snm><fnm>TG</fnm></au></aug><source>Neural Computation</source><pubdate>1998</pubdate><volume>10</volume><issue>7</issue><fpage>1895</fpage><lpage>1923</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1162/089976698300017197</pubid><pubid idtype="pmpid">9744903</pubid></pubidlist></xrefbib></bibl><bibl id="B26"><title><p>Construction of large-scale Bayesian networks by local to global search</p></title><aug><au><snm>Hwang</snm><fnm>KB</fnm></au><au><snm>Lee</snm><fnm>JW</fnm></au><au><snm>Chung</snm><fnm>S-W</fnm></au><au><snm>Zhang</snm><fnm>B-T</fnm></au></aug><source>Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence (PRICAI &apos;02), Tokyo, Japan, August 2002</source><fpage>375</fpage><lpage>384</lpage></bibl><bibl id="B27"><title><p>Algorithms for large scale markov blanket discovery</p></title><aug><au><snm>Tsamardinos</snm><fnm>I</fnm></au><au><snm>Aliferis</snm><fnm>C</fnm></au><au><snm>Statnikov</snm><fnm>A</fnm></au></aug><source>Proceedings of the 16th International Florida Artificial Intelligence Research Society Conference (FLAIRS &apos;03), St. Augustine, Fla, USA, May 2003</source><fpage>376</fpage><lpage>381</lpage></bibl><bibl id="B28"><title><p>Towards principled feature selection: relevancy, filters and wrappers</p></title><aug><au><snm>Tsamardinos</snm><fnm>I</fnm></au><au><snm>Aliferis</snm><fnm>C</fnm></au></aug><source>Proceedings of the 9th International Workshop on Artificial Intelligence and Statistics (AI&amp;Stats &apos;03), Key West, Fla, USA</source><pubdate>January 2003</pubdate></bibl></refgrp>
   </bm>
</art>