Show simple item record

dc.contributor.advisorSchonfeld, Danen_US
dc.contributor.authorWang, Liming
dc.date.accessioned2012-12-07T11:13:16Z
dc.date.available2012-12-07T11:13:16Z
dc.date.created2011-08en_US
dc.date.issued2012-12-07
dc.date.submitted2011-08en_US
dc.identifier.urihttp://hdl.handle.net/10027/8850
dc.description.abstractGenomic Signal Processing (GSP) is a discipline to study the processing of genomic signal. GSP studies a large collection of genomic sequence instead of individual gene. The aim of GSP is to integrate the theory and methods of signal processing with the global understanding of genomics. In GSP, one would find a proper representation of the genomic information and employ various signal processing methodologies such as detection, prediction, classification, control, etc. In this thesis, we propose the concept of mapping equivalence theory for the numerical representation of symbolic data. We propose a framework for the analysis of different numerical mappings undergoing transformation by an analytic operator using Taylor's expansion. Moreover, we emphasize the investigation of first- and second-order operators including the correlation function and Fourier transform. We also provide an analysis of the correlation between different numerical mappings of a symbolic sequence. In particular, we derive conditions for strong equivalence captured by perfect correlation among distinct mappings. We explore a relaxed similarity measure between distinct numerical mappings. Specifically, we provide conditions for weak equivalence which is characterized by preservation of the local extrema of the representation. We also introduce an abstract mapping model and extend the concept of equivalence to the generalized mapping model. We extend the mapping equivalence theory for iterated operator. We provide a method for analyzing the consistency between different mappings under iterations of operator. We define different concepts of mapping equivalence. We show the necessary and sufficient condition for consistency under iteration of affine operator. We present a few theoretical results for the equivalent mappings on the concept of Fatou and Julia Set. We give the definition of stability under iteration of operator and show the stability issue can be viewed as a special case of mapping equivalence. We also establish the connection of stability to Fatou and Julia set. We propose the Non-cooperative stochastic game (NCSG) model for control of the genetic regulatory networks and formulate the intervention problem into solving the Nash equilibrium (NE). We show that the Markov decision process (MDP) is a special case of NCSG and the solving methods are provided. The definition of NE in this context has been proposed and the existences for both infinite and finite horizon cases have been proven. We provide a constructive method for solving the approximate NE.en_US
dc.language.isoenen_US
dc.rightsen_US
dc.rightsCopyright 2011 Liming Wangen_US
dc.subjectGenomic signal processingen_US
dc.subjectMapping equivalenceen_US
dc.subjectComplex dynamicsen_US
dc.subjectRegulatory networksen_US
dc.subjectGame theoryen_US
dc.titleGenomic Signal Processing and Regulatory Networks: Representation, Dynamics and Controlen_US
thesis.degree.departmentElectrical and Computer Engineeringen_US
thesis.degree.disciplineElectrical and Computer Engineeringen_US
thesis.degree.grantorUniversity of Illinois at Chicagoen_US
thesis.degree.levelDoctoralen_US
thesis.degree.namePhD, Doctor of Philosophyen_US
dc.type.genrethesisen_US
dc.contributor.committeeMemberAnsari, Rashiden_US
dc.contributor.committeeMemberTuninetti, Danielaen_US
dc.contributor.committeeMemberDeMarco, Lauraen_US
dc.contributor.committeeMemberFriedland, Shmuelen_US
dc.type.materialtexten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record