DocumentCode
2563524
Title
From biological pathways to regulatory networks
Author
Layek, Ritwik ; Datta, Aniruddha ; Dough, Edward R.
Author_Institution
Dept. of Electr. & Comput. Eng., Texas A & M Univ., College Station, TX, USA
fYear
2010
fDate
15-17 Dec. 2010
Firstpage
5781
Lastpage
5786
Abstract
This paper presents a general theoretical framework for generating Boolean networks whose state transitions realize a set of given biological pathways or minor variations thereof. This ill-posed inverse problem, which is of crucial importance across practically all areas of biology, is solved by using Karnaugh maps which are classical tools for digital system design. It is shown that the incorporation of prior knowledge, presented in the form of biological pathways, can bring about a dramatic reduction in the cardinality of the network search space. Constraining the connectivity of the network, the number and relative importance of the attractors, and concordance with observed time-course data are additional factors that can be used to further reduce the cardinality of the search space. The networks produced by the approaches developed here should facilitate the understanding of multivariate biological phenomena and the subsequent design of intervention approaches that are more likely to be successful in practice.
Keywords
Boolean algebra; genetics; inverse problems; network theory (graphs); search problems; Boolean networks; Karnaugh map; biological pathway; digital system design; ill-posed inverse problem; multivariate biological phenomenon; network connectivity; network search space; regulatory networks; Boolean functions; Genetics; Hamming distance; Knowledge engineering; Timing; Trajectory;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control (CDC), 2010 49th IEEE Conference on
Conference_Location
Atlanta, GA
ISSN
0743-1546
Print_ISBN
978-1-4244-7745-6
Type
conf
DOI
10.1109/CDC.2010.5716936
Filename
5716936
Link To Document