A top-performing algorithm for the DREAM3 gene expression prediction challenge
A wealth of computational methods has been developed to address problems in systems biology, such as modeling gene expression. However, to objectively evaluate and compare such methods is notoriously difficult. The DREAM (Dialogue on Reverse Engineering Assessments and Methods) project is a communit...
Gespeichert in:
Veröffentlicht in: | PloS one 2010-02, Vol.5 (2), p.e8944-e8944 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | e8944 |
---|---|
container_issue | 2 |
container_start_page | e8944 |
container_title | PloS one |
container_volume | 5 |
creator | Ruan, Jianhua |
description | A wealth of computational methods has been developed to address problems in systems biology, such as modeling gene expression. However, to objectively evaluate and compare such methods is notoriously difficult. The DREAM (Dialogue on Reverse Engineering Assessments and Methods) project is a community-wide effort to assess the relative strengths and weaknesses of different computational methods for a set of core problems in systems biology. This article presents a top-performing algorithm for one of the challenge problems in the third annual DREAM (DREAM3), namely the gene expression prediction challenge. In this challenge, participants are asked to predict the expression levels of a small set of genes in a yeast deletion strain, given the expression levels of all other genes in the same strain and complete gene expression data for several other yeast strains. I propose a simple -nearest-neighbor (KNN) method to solve this problem. Despite its simplicity, this method works well for this challenge, sharing the "top performer" honor with a much more sophisticated method. I also describe several alternative, simple strategies, including a modified KNN algorithm that further improves the performance of the standard KNN method. The success of these methods suggests that complex methods attempting to integrate multiple data sets do not necessarily lead to better performance than simple yet robust methods. Furthermore, none of these top-performing methods, including the one by a different team, are based on gene regulatory networks, which seems to suggest that accurately modeling gene expression using gene regulatory networks is unfortunately still a difficult task. |
doi_str_mv | 10.1371/journal.pone.0008944 |
format | Article |
fullrecord | <record><control><sourceid>gale_plos_</sourceid><recordid>TN_cdi_plos_journals_1289269999</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A473920216</galeid><doaj_id>oai_doaj_org_article_58ee7c32d9934f00b8407c9b8e54868c</doaj_id><sourcerecordid>A473920216</sourcerecordid><originalsourceid>FETCH-LOGICAL-c691t-efbf6933a7022f90d07bfce25c4724799fdd20a135b98733b8fa2f3b5a26c6913</originalsourceid><addsrcrecordid>eNqNkktv1DAUhSNERUvhHyCIhATqYgbHzsPeII1KgZEKlcpjaznOdeKRE6d2gsq_x2HSaoK6IFnk6vo7x_H1iaIXCVonpEje7ezoOmHWve1gjRCiLE0fRScJI3iVY0QeH9TH0VPvdwhlhOb5k-gYoyRFOMEn0ddNPNh-1YNT1rW6q2Nhauv00LRx6MRDA_GH64vNFxLX0EEMt70D77Xt4lBUWg5TKRthDHQ1PIuOlDAens_f0-jHx4vv559Xl1eftueby5XMWTKsQJUqZ4SIAmGsGKpQUSoJOJNpgdOCMVVVGImEZCWjBSElVQIrUmYC55MDOY1e7X17Yz2fR-F5ginDOQtPILZ7orJix3unW-F-cys0_9uwrubCDVoa4BkFKCTBVZClCqGSpqiQrKSQpTSnMni9n3cbyxYqCd3ghFmYLlc63fDa_uKYJmH8WTB4Oxs4ezOCH3irvQRjRAd29LwgKS5oznAgX_9DPny4mapF-H_dKRu2lZMn36QFYThcbh6o9QNUeCtotQyxUTr0F4KzhSAwA9wOtRi959tv1__PXv1csm8O2AaEGRpvzThlxy_BdA9KZ713oO5nnCA-pf5uGnxKPZ9TH2QvD-_nXnQXc_IHdT37Kg</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1289269999</pqid></control><display><type>article</type><title>A top-performing algorithm for the DREAM3 gene expression prediction challenge</title><source>MEDLINE</source><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Public Library of Science (PLoS)</source><source>PubMed Central</source><source>Free Full-Text Journals in Chemistry</source><creator>Ruan, Jianhua</creator><contributor>Isalan, Mark</contributor><creatorcontrib>Ruan, Jianhua ; Isalan, Mark</creatorcontrib><description>A wealth of computational methods has been developed to address problems in systems biology, such as modeling gene expression. However, to objectively evaluate and compare such methods is notoriously difficult. The DREAM (Dialogue on Reverse Engineering Assessments and Methods) project is a community-wide effort to assess the relative strengths and weaknesses of different computational methods for a set of core problems in systems biology. This article presents a top-performing algorithm for one of the challenge problems in the third annual DREAM (DREAM3), namely the gene expression prediction challenge. In this challenge, participants are asked to predict the expression levels of a small set of genes in a yeast deletion strain, given the expression levels of all other genes in the same strain and complete gene expression data for several other yeast strains. I propose a simple -nearest-neighbor (KNN) method to solve this problem. Despite its simplicity, this method works well for this challenge, sharing the "top performer" honor with a much more sophisticated method. I also describe several alternative, simple strategies, including a modified KNN algorithm that further improves the performance of the standard KNN method. The success of these methods suggests that complex methods attempting to integrate multiple data sets do not necessarily lead to better performance than simple yet robust methods. Furthermore, none of these top-performing methods, including the one by a different team, are based on gene regulatory networks, which seems to suggest that accurately modeling gene expression using gene regulatory networks is unfortunately still a difficult task.</description><identifier>ISSN: 1932-6203</identifier><identifier>EISSN: 1932-6203</identifier><identifier>DOI: 10.1371/journal.pone.0008944</identifier><identifier>PMID: 20140212</identifier><language>eng</language><publisher>United States: Public Library of Science</publisher><subject>Accuracy ; Algorithms ; Analysis ; Binding sites ; Bioinformatics ; Biology ; Computation ; Computational Biology ; Computational Biology - methods ; Computational Biology/Systems Biology ; Computer applications ; Deoxyribonucleic acid ; DNA ; Gene expression ; Gene Expression Profiling - methods ; Gene Expression Regulation, Fungal ; Gene Regulatory Networks ; Genes ; Genomes ; Genomics ; Insects ; Mathematical models ; Methods ; Models, Genetic ; Molecular Biology/Bioinformatics ; Nearest-neighbor ; Performance enhancement ; Reproducibility of Results ; Reverse engineering ; Saccharomyces cerevisiae - classification ; Saccharomyces cerevisiae - genetics ; Species Specificity ; Yeast</subject><ispartof>PloS one, 2010-02, Vol.5 (2), p.e8944-e8944</ispartof><rights>COPYRIGHT 2010 Public Library of Science</rights><rights>2010 Jianhua Ruan. This is an open-access article distributed under the terms of the Creative Commons Attribution License: https://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>Jianhua Ruan. 2010</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c691t-efbf6933a7022f90d07bfce25c4724799fdd20a135b98733b8fa2f3b5a26c6913</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC2816205/pdf/$$EPDF$$P50$$Gpubmedcentral$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC2816205/$$EHTML$$P50$$Gpubmedcentral$$Hfree_for_read</linktohtml><link.rule.ids>230,314,723,776,780,860,881,2095,2914,23846,27903,27904,53770,53772,79347,79348</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/20140212$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><contributor>Isalan, Mark</contributor><creatorcontrib>Ruan, Jianhua</creatorcontrib><title>A top-performing algorithm for the DREAM3 gene expression prediction challenge</title><title>PloS one</title><addtitle>PLoS One</addtitle><description>A wealth of computational methods has been developed to address problems in systems biology, such as modeling gene expression. However, to objectively evaluate and compare such methods is notoriously difficult. The DREAM (Dialogue on Reverse Engineering Assessments and Methods) project is a community-wide effort to assess the relative strengths and weaknesses of different computational methods for a set of core problems in systems biology. This article presents a top-performing algorithm for one of the challenge problems in the third annual DREAM (DREAM3), namely the gene expression prediction challenge. In this challenge, participants are asked to predict the expression levels of a small set of genes in a yeast deletion strain, given the expression levels of all other genes in the same strain and complete gene expression data for several other yeast strains. I propose a simple -nearest-neighbor (KNN) method to solve this problem. Despite its simplicity, this method works well for this challenge, sharing the "top performer" honor with a much more sophisticated method. I also describe several alternative, simple strategies, including a modified KNN algorithm that further improves the performance of the standard KNN method. The success of these methods suggests that complex methods attempting to integrate multiple data sets do not necessarily lead to better performance than simple yet robust methods. Furthermore, none of these top-performing methods, including the one by a different team, are based on gene regulatory networks, which seems to suggest that accurately modeling gene expression using gene regulatory networks is unfortunately still a difficult task.</description><subject>Accuracy</subject><subject>Algorithms</subject><subject>Analysis</subject><subject>Binding sites</subject><subject>Bioinformatics</subject><subject>Biology</subject><subject>Computation</subject><subject>Computational Biology</subject><subject>Computational Biology - methods</subject><subject>Computational Biology/Systems Biology</subject><subject>Computer applications</subject><subject>Deoxyribonucleic acid</subject><subject>DNA</subject><subject>Gene expression</subject><subject>Gene Expression Profiling - methods</subject><subject>Gene Expression Regulation, Fungal</subject><subject>Gene Regulatory Networks</subject><subject>Genes</subject><subject>Genomes</subject><subject>Genomics</subject><subject>Insects</subject><subject>Mathematical models</subject><subject>Methods</subject><subject>Models, Genetic</subject><subject>Molecular Biology/Bioinformatics</subject><subject>Nearest-neighbor</subject><subject>Performance enhancement</subject><subject>Reproducibility of Results</subject><subject>Reverse engineering</subject><subject>Saccharomyces cerevisiae - classification</subject><subject>Saccharomyces cerevisiae - genetics</subject><subject>Species Specificity</subject><subject>Yeast</subject><issn>1932-6203</issn><issn>1932-6203</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>EIF</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>DOA</sourceid><recordid>eNqNkktv1DAUhSNERUvhHyCIhATqYgbHzsPeII1KgZEKlcpjaznOdeKRE6d2gsq_x2HSaoK6IFnk6vo7x_H1iaIXCVonpEje7ezoOmHWve1gjRCiLE0fRScJI3iVY0QeH9TH0VPvdwhlhOb5k-gYoyRFOMEn0ddNPNh-1YNT1rW6q2Nhauv00LRx6MRDA_GH64vNFxLX0EEMt70D77Xt4lBUWg5TKRthDHQ1PIuOlDAens_f0-jHx4vv559Xl1eftueby5XMWTKsQJUqZ4SIAmGsGKpQUSoJOJNpgdOCMVVVGImEZCWjBSElVQIrUmYC55MDOY1e7X17Yz2fR-F5ginDOQtPILZ7orJix3unW-F-cys0_9uwrubCDVoa4BkFKCTBVZClCqGSpqiQrKSQpTSnMni9n3cbyxYqCd3ghFmYLlc63fDa_uKYJmH8WTB4Oxs4ezOCH3irvQRjRAd29LwgKS5oznAgX_9DPny4mapF-H_dKRu2lZMn36QFYThcbh6o9QNUeCtotQyxUTr0F4KzhSAwA9wOtRi959tv1__PXv1csm8O2AaEGRpvzThlxy_BdA9KZ713oO5nnCA-pf5uGnxKPZ9TH2QvD-_nXnQXc_IHdT37Kg</recordid><startdate>20100204</startdate><enddate>20100204</enddate><creator>Ruan, Jianhua</creator><general>Public Library of Science</general><general>Public Library of Science (PLoS)</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>IOV</scope><scope>ISR</scope><scope>3V.</scope><scope>7QG</scope><scope>7QL</scope><scope>7QO</scope><scope>7RV</scope><scope>7SN</scope><scope>7SS</scope><scope>7T5</scope><scope>7TG</scope><scope>7TM</scope><scope>7U9</scope><scope>7X2</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AO</scope><scope>8C1</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AEUYN</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>C1K</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>H94</scope><scope>HCIFZ</scope><scope>K9.</scope><scope>KB.</scope><scope>KB0</scope><scope>KL.</scope><scope>L6V</scope><scope>LK8</scope><scope>M0K</scope><scope>M0S</scope><scope>M1P</scope><scope>M7N</scope><scope>M7P</scope><scope>M7S</scope><scope>NAPCQ</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>RC3</scope><scope>7X8</scope><scope>5PM</scope><scope>DOA</scope></search><sort><creationdate>20100204</creationdate><title>A top-performing algorithm for the DREAM3 gene expression prediction challenge</title><author>Ruan, Jianhua</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c691t-efbf6933a7022f90d07bfce25c4724799fdd20a135b98733b8fa2f3b5a26c6913</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Accuracy</topic><topic>Algorithms</topic><topic>Analysis</topic><topic>Binding sites</topic><topic>Bioinformatics</topic><topic>Biology</topic><topic>Computation</topic><topic>Computational Biology</topic><topic>Computational Biology - methods</topic><topic>Computational Biology/Systems Biology</topic><topic>Computer applications</topic><topic>Deoxyribonucleic acid</topic><topic>DNA</topic><topic>Gene expression</topic><topic>Gene Expression Profiling - methods</topic><topic>Gene Expression Regulation, Fungal</topic><topic>Gene Regulatory Networks</topic><topic>Genes</topic><topic>Genomes</topic><topic>Genomics</topic><topic>Insects</topic><topic>Mathematical models</topic><topic>Methods</topic><topic>Models, Genetic</topic><topic>Molecular Biology/Bioinformatics</topic><topic>Nearest-neighbor</topic><topic>Performance enhancement</topic><topic>Reproducibility of Results</topic><topic>Reverse engineering</topic><topic>Saccharomyces cerevisiae - classification</topic><topic>Saccharomyces cerevisiae - genetics</topic><topic>Species Specificity</topic><topic>Yeast</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ruan, Jianhua</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Gale In Context: Opposing Viewpoints</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Animal Behavior Abstracts</collection><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Biotechnology Research Abstracts</collection><collection>Nursing & Allied Health Database</collection><collection>Ecology Abstracts</collection><collection>Entomology Abstracts (Full archive)</collection><collection>Immunology Abstracts</collection><collection>Meteorological & Geoastrophysical Abstracts</collection><collection>Nucleic Acids Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Agricultural Science Collection</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Public Health Database</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest One Sustainability</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>Agricultural & Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>Materials Science Database</collection><collection>Nursing & Allied Health Database (Alumni Edition)</collection><collection>Meteorological & Geoastrophysical Abstracts - Academic</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>Agricultural Science Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Nursing & Allied Health Premium</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>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><collection>Environmental Science Collection</collection><collection>Genetics Abstracts</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>PloS one</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ruan, Jianhua</au><au>Isalan, Mark</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A top-performing algorithm for the DREAM3 gene expression prediction challenge</atitle><jtitle>PloS one</jtitle><addtitle>PLoS One</addtitle><date>2010-02-04</date><risdate>2010</risdate><volume>5</volume><issue>2</issue><spage>e8944</spage><epage>e8944</epage><pages>e8944-e8944</pages><issn>1932-6203</issn><eissn>1932-6203</eissn><abstract>A wealth of computational methods has been developed to address problems in systems biology, such as modeling gene expression. However, to objectively evaluate and compare such methods is notoriously difficult. The DREAM (Dialogue on Reverse Engineering Assessments and Methods) project is a community-wide effort to assess the relative strengths and weaknesses of different computational methods for a set of core problems in systems biology. This article presents a top-performing algorithm for one of the challenge problems in the third annual DREAM (DREAM3), namely the gene expression prediction challenge. In this challenge, participants are asked to predict the expression levels of a small set of genes in a yeast deletion strain, given the expression levels of all other genes in the same strain and complete gene expression data for several other yeast strains. I propose a simple -nearest-neighbor (KNN) method to solve this problem. Despite its simplicity, this method works well for this challenge, sharing the "top performer" honor with a much more sophisticated method. I also describe several alternative, simple strategies, including a modified KNN algorithm that further improves the performance of the standard KNN method. The success of these methods suggests that complex methods attempting to integrate multiple data sets do not necessarily lead to better performance than simple yet robust methods. Furthermore, none of these top-performing methods, including the one by a different team, are based on gene regulatory networks, which seems to suggest that accurately modeling gene expression using gene regulatory networks is unfortunately still a difficult task.</abstract><cop>United States</cop><pub>Public Library of Science</pub><pmid>20140212</pmid><doi>10.1371/journal.pone.0008944</doi><tpages>e8944</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1932-6203 |
ispartof | PloS one, 2010-02, Vol.5 (2), p.e8944-e8944 |
issn | 1932-6203 1932-6203 |
language | eng |
recordid | cdi_plos_journals_1289269999 |
source | MEDLINE; DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Public Library of Science (PLoS); PubMed Central; Free Full-Text Journals in Chemistry |
subjects | Accuracy Algorithms Analysis Binding sites Bioinformatics Biology Computation Computational Biology Computational Biology - methods Computational Biology/Systems Biology Computer applications Deoxyribonucleic acid DNA Gene expression Gene Expression Profiling - methods Gene Expression Regulation, Fungal Gene Regulatory Networks Genes Genomes Genomics Insects Mathematical models Methods Models, Genetic Molecular Biology/Bioinformatics Nearest-neighbor Performance enhancement Reproducibility of Results Reverse engineering Saccharomyces cerevisiae - classification Saccharomyces cerevisiae - genetics Species Specificity Yeast |
title | A top-performing algorithm for the DREAM3 gene expression prediction challenge |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T05%3A55%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_plos_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20top-performing%20algorithm%20for%20the%20DREAM3%20gene%20expression%20prediction%20challenge&rft.jtitle=PloS%20one&rft.au=Ruan,%20Jianhua&rft.date=2010-02-04&rft.volume=5&rft.issue=2&rft.spage=e8944&rft.epage=e8944&rft.pages=e8944-e8944&rft.issn=1932-6203&rft.eissn=1932-6203&rft_id=info:doi/10.1371/journal.pone.0008944&rft_dat=%3Cgale_plos_%3EA473920216%3C/gale_plos_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1289269999&rft_id=info:pmid/20140212&rft_galeid=A473920216&rft_doaj_id=oai_doaj_org_article_58ee7c32d9934f00b8407c9b8e54868c&rfr_iscdi=true |