{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/82390"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/82390","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Global Optimization in Systems Biology and Bioinformatics","abstract":"Identification of transcription factor binding motif and sites is a crucial effort to elucidate gene regulatory networks and its combinatorial problem is NP -hard. In this thesis, the problem is modeled as an integer linear program with weak assumptions on the binding pattern. A computationally efficient formulation and linearization scheme is developed and the resulting problem is solved to global optimality. The proposed formulation successfully solved the CRP problem to identify its binding motif and sites simultaneously.","abstract_html":"Identification of transcription factor binding motif and sites is a crucial effort to elucidate gene regulatory networks and its combinatorial problem is NP -hard. In this thesis, the problem is modeled as an integer linear program with weak assumptions on the binding pattern. A computationally efficient formulation and linearization scheme is developed and the resulting problem is solved to global optimality. The proposed formulation successfully solved the CRP problem to identify its binding motif and sites simultaneously.","abstract_has_math":false,"creators":["Chang, Youngjung"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Chemical Engineering","degree_department":null,"school":null,"contributors":["Sahinidis, Nikolaos V."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:43:28Z","date_published":"2015-09-25T20:43:28Z","updated_at":"2026-07-22T22:26:18Z","subjects":["Biology, Bioinformatics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3250223"],"render_values":[{"text":"(MiAaPQ)AAI3250223","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/82390","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Sahinidis, Nikolaos V."]},{"key":"dc:creator","label":"Author","values":["Chang, Youngjung"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:43:28Z","10000-01-01","2006"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Chemical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Biology, Bioinformatics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/82390","(MiAaPQ)AAI3250223"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Identification of transcription factor binding motif and sites is a crucial effort to elucidate gene regulatory networks and its combinatorial problem is NP -hard. In this thesis, the problem is modeled as an integer linear program with weak assumptions on the binding pattern. A computationally efficient formulation and linearization scheme is developed and the resulting problem is solved to global optimality. The proposed formulation successfully solved the CRP problem to identify its binding motif and sites simultaneously.","Made available in DSpace on 2015-09-25T20:43:28Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3250223.pdf: 3515317 bytes, checksum: cc56f4bde50ee929252db40263fe9801 (MD5) Previous issue date: 2006","Embargo set by: Seth Robbins for item 83671 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","150 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006."]},{"key":"dc:title","label":"Title","values":["Global Optimization in Systems Biology and Bioinformatics"]}]}],"canonical_facts":{"dc:contributor":["Sahinidis, Nikolaos V."],"dc:creator":["Chang, Youngjung"],"dc:date":["2015-09-25T20:43:28Z","10000-01-01","2006"],"dc:description":["Identification of transcription factor binding motif and sites is a crucial effort to elucidate gene regulatory networks and its combinatorial problem is NP -hard. In this thesis, the problem is modeled as an integer linear program with weak assumptions on the binding pattern. A computationally efficient formulation and linearization scheme is developed and the resulting problem is solved to global optimality. The proposed formulation successfully solved the CRP problem to identify its binding motif and sites simultaneously.","Made available in DSpace on 2015-09-25T20:43:28Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3250223.pdf: 3515317 bytes, checksum: cc56f4bde50ee929252db40263fe9801 (MD5) Previous issue date: 2006","Embargo set by: Seth Robbins for item 83671 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","150 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006."],"dc:identifier":["http://hdl.handle.net/2142/82390","(MiAaPQ)AAI3250223"],"dc:language":["eng"],"dc:subject":["Biology, Bioinformatics"],"dc:title":["Global Optimization in Systems Biology and Bioinformatics"],"dc:type":["text"],"thesis:degree_discipline":["Chemical Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:18Z"}