Högskolan i Skövde

his.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A GO-based Method for Assessing the Biological Plausibility of Regulatory Hypotheses
Högskolan i Skövde, Institutionen för kommunikation och information. (Systems Biology Group)ORCID-id: 0000-0003-2700-2535
Högskolan i Skövde, Institutionen för kommunikation och information. (Systems Biology Group)
Högskolan i Skövde, Institutionen för kommunikation och information. (Systems Biology Group)
2006 (engelsk)Inngår i: Computational Science - ICCS 2006: 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part II / [ed] Vassil N. Alexandrov; Geert Dick Albada; Peter M. A. Sloot; Jack Dongarra, Springer Berlin/Heidelberg, 2006, s. 879-886Konferansepaper, Publicerat paper (Annet vitenskapelig)
Abstract [en]

Many algorithms have been proposed for deriving regulatory networks from microarray gene expression data. The performance of such algorithms is often measured by how well the resulting network can recreate the gene expression data that it was derived from. However, this kind of performance does not necessarily mean that the regulatory hypotheses in the network are biologically plausible. We therefore propose a method for assessing the biological plausibility of regulatory hypotheses using prior knowledge in the form of regulatory pathway databases and Gene Ontology-based annotation of gene products. A set of templates is derived by generalising from known interactions to typical properties of interacting gene product pairs. By searching for matches in this set of templates, the plausibility of regulatory hypotheses can be assessed. We evaluate to what degree the collection of templates can separate true from false positive interactions, and we illustrate the practical use of the method by applying it to an example network reconstruction problem.

sted, utgiver, år, opplag, sider
Springer Berlin/Heidelberg, 2006. s. 879-886
Serie
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 3992
HSV kategori
Forskningsprogram
Teknik
Identifikatorer
URN: urn:nbn:se:his:diva-1863DOI: 10.1007/11758525_117ISI: 000238389400117Scopus ID: 2-s2.0-33746655268ISBN: 978-3-540-34381-3 (tryckt)ISBN: 978-3-540-34382-0 (digital)OAI: oai:DiVA.org:his-1863DiVA, id: diva2:32139
Konferanse
6th International Conference on Computational Science, ICCS 2006, Reading, UK, May 28-31, 2006
Tilgjengelig fra: 2007-09-12 Laget: 2007-09-12 Sist oppdatert: 2022-09-28bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Gamalielsson, JonasNilsson, PatricOlsson, Björn

Søk i DiVA

Av forfatter/redaktør
Gamalielsson, JonasNilsson, PatricOlsson, Björn
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 1173 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf