Computational inference and analysis of genetic regulatory networks via a supervised combinatorial-optimization pattern.
BACKGROUND
Post-genome era brings about diverse categories of omics data. Inference and analysis of genetic regulatory networks act prominently in extracting inherent mechanisms, discovering and interpreting the related biological nature and living principles beneath mazy phenomena, and eventually promoting the well-beings of humankind.


RESULTS
A supervised combinatorial-optimization pattern based on information and signal-processing theories is introduced into the inference and analysis of genetic regulatory networks. An associativity measure is proposed to define the regulatory strength/connectivity, and a phase-shift metric determines regulatory directions among components of the reconstructed networks. Thus, it solves the undirected regulatory problems arising from most of current linear/nonlinear relevance methods. In case of computational and topological redundancy, we constrain the classified group size of pair candidates within a multiobjective combinatorial optimization (MOCO) pattern.


CONCLUSIONS
We testify the proposed approach on two real-world microarray datasets of different statistical characteristics. Thus, we reveal the inherent design mechanisms for genetic networks by quantitative means, facilitating further theoretic analysis and experimental design with diverse research purposes. Qualitative comparisons with other methods and certain related focuses needing further work are illustrated within the discussion section.
Tang
Binhua
B
Department of Bioinformatics, Tongji University, Shanghai, China. bme.tang@gmail.com
Wu
Xuechen
X
Tan
Ge
G
Chen
Su-Shing
SS
Jing
Qing
Q
Shen
Bairong
B
D002453:Cell Cycle; D019295:Computational Biology; D003627:Data Interpretation, Statistical; D020869:Gene Expression Profiling; D053263:Gene Regulatory Networks; D008954:Models, Biological; D015233:Models, Statistical; D020411:Oligonucleotide Array Sequence Analysis