NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
Control in Probabilistic Boolean Networks
dc.creator | Choudhary, Ashish | |
dc.date.accessioned | 2012-06-07T23:20:07Z | |
dc.date.available | 2012-06-07T23:20:07Z | |
dc.date.created | 2003 | |
dc.date.issued | 2003 | |
dc.identifier.uri | https://hdl.handle.net/1969.1/ETD-TAMU-2003-THESIS-C476 | |
dc.description | Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item. | en |
dc.description | Includes bibliographical references (leaves 41-43). | en |
dc.description | Issued also on microfiche from Lange Micrographics. | en |
dc.description.abstract | Probabilistic Boolean Networks (PBN's) have been recently introduced as a rule-based paradigm for modeling gene regulatory networks. Such networks provide a convenient tool for studying interactions between different genes while allowing for uncertainty in the knowledge of these relationships. This thesis deals with the issue of control in PBN's. More precisely, given a Probabilistic Boolean Network whose state transition probabilities depend on an external (control) variable, we develop a procedure by which one can choose the sequence of control actions that minimize a given performance index over a finite number of steps. The procedure is based on the theory of controlled Markov chains and makes use of the classical technique of Dynamic Programming. The choice of the finite horizon performance index is motivated by cancer treatment applications where one would ideally like to intervene only over a finite time horizon, then suspend treatment and observe the effects over some additional time before deciding if further intervention is necessary. The undiscounted finite horizon cost minimization problem considered here is the simplest one to formulate and solve, and is selected mainly for clarity of exposition, although more complicated costs could be used, provided appropriate technical conditions are satisfied. | en |
dc.format.medium | electronic | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | |
dc.publisher | Texas A&M University | |
dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
dc.subject | electrical engineering. | en |
dc.subject | Major electrical engineering. | en |
dc.title | Control in Probabilistic Boolean Networks | en |
dc.type | Thesis | en |
thesis.degree.discipline | electrical engineering | en |
thesis.degree.name | M.S. | en |
thesis.degree.level | Masters | en |
dc.type.genre | thesis | en |
dc.type.material | text | en |
dc.format.digitalOrigin | reformatted digital | en |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.