Högskolan i Skövde

his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A GO-based Method for Assessing the Biological Plausibility of Regulatory Hypotheses
University of Skövde, School of Humanities and Informatics. (Systems Biology Group)ORCID iD: 0000-0003-2700-2535
University of Skövde, School of Humanities and Informatics. (Systems Biology Group)
University of Skövde, School of Humanities and Informatics. (Systems Biology Group)
2006 (English)In: 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, p. 879-886Conference paper, Published paper (Other academic)
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.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2006. p. 879-886
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 3992
National Category
Engineering and Technology
Research subject
Technology
Identifiers
URN: urn:nbn:se:his:diva-1863DOI: 10.1007/11758525_117ISI: 000238389400117Scopus ID: 2-s2.0-33746655268ISBN: 978-3-540-34381-3 (print)ISBN: 978-3-540-34382-0 (electronic)OAI: oai:DiVA.org:his-1863DiVA, id: diva2:32139
Conference
6th International Conference on Computational Science, ICCS 2006, Reading, UK, May 28-31, 2006
Available from: 2007-09-12 Created: 2007-09-12 Last updated: 2022-09-28Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Gamalielsson, JonasNilsson, PatricOlsson, Björn

Search in DiVA

By author/editor
Gamalielsson, JonasNilsson, PatricOlsson, Björn
By organisation
School of Humanities and Informatics
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 1173 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf