Format

Send to

Choose Destination
See comment in PubMed Commons below
ScientificWorldJournal. 2012;2012:957620. doi: 10.1100/2012/957620. Epub 2012 Nov 1.

Network completion using dynamic programming and least-squares fitting.

Author information

1
Bioinformatics Center, Institute for Chemical Research, Kyoto University Gokasho, Uji, Kyoto 611-0011, Japan.

Abstract

We consider the problem of network completion, which is to make the minimum amount of modifications to a given network so that the resulting network is most consistent with the observed data. We employ here a certain type of differential equations as gene regulation rules in a genetic network, gene expression time series data as observed data, and deletions and additions of edges as basic modification operations. In addition, we assume that the numbers of deleted and added edges are specified. For this problem, we present a novel method using dynamic programming and least-squares fitting and show that it outputs a network with the minimum sum squared error in polynomial time if the maximum indegree of the network is bounded by a constant. We also perform computational experiments using both artificially generated and real gene expression time series data.

PMID:
23213307
PMCID:
PMC3504398
DOI:
10.1100/2012/957620
[Indexed for MEDLINE]
Free PMC Article
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for Hindawi Publishing Corporation Icon for PubMed Central
    Loading ...
    Support Center