{"id":{"repo_id":"csusb","oai_identifier":"oai:scholarworks.lib.csusb.edu:etd-2933"},"canonical_url":"https://search.ndltd.org/etd/csusb/oai:scholarworks.lib.csusb.edu:etd-2933","repository":{"repo_id":"csusb","name":"CSUniversity San Bernardino","base_url":"https://scholarworks.lib.csusb.edu/do/oai/"},"display":{"title":"DNA SELF-ASSEMBLY OF TRAPEZOHEDRAL GRAPHS","abstract":"Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types needed to assemble a DNA complex with the same structure as the trapezohedral graphs under different laboratory constraints.","abstract_html":"Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types needed to assemble a DNA complex with the same structure as the trapezohedral graphs under different laboratory constraints.","abstract_has_math":false,"creators":["Abdelkarim, Hytham"],"institution":null,"degree_name":"Master of Arts in Mathematics","degree_level":"Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Dr. Cory Johnson"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:09:10Z","subjects":["Graph Theory","DNA","self-assembly","Trapezohedral Graphs","optimal pots","Discrete Mathematics and Combinatorics","Other Applied Mathematics","Other Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.lib.csusb.edu/etd/1767","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://scholarworks.lib.csusb.edu/etd/1767","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://scholarworks.lib.csusb.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Ascholarworks.lib.csusb.edu%3Aetd-2933","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. Cory Johnson"]},{"key":"dc:creator","label":"Author","values":["Abdelkarim, Hytham"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2023-07-12T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2023-08-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Arts in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Graph Theory","DNA","self-assembly","Trapezohedral Graphs","optimal pots","Discrete Mathematics and Combinatorics","Other Applied Mathematics","Other Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.lib.csusb.edu/etd/1767"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types needed to assemble a DNA complex with the same structure as the trapezohedral graphs under different laboratory constraints."]},{"key":"dc:title","label":"Title","values":["DNA SELF-ASSEMBLY OF TRAPEZOHEDRAL GRAPHS"]}]}],"canonical_facts":{"dc:contributor":["Dr. Cory Johnson"],"dc:creator":["Abdelkarim, Hytham"],"dc:date.available":["2023-07-12T07:00:00Z"],"dc:date.created":["2023-08-01T07:00:00Z"],"dc:description.abstract":["Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types needed to assemble a DNA complex with the same structure as the trapezohedral graphs under different laboratory constraints."],"dc:identifier":["https://scholarworks.lib.csusb.edu/etd/1767"],"dc:subject":["Graph Theory","DNA","self-assembly","Trapezohedral Graphs","optimal pots","Discrete Mathematics and Combinatorics","Other Applied Mathematics","Other Mathematics"],"dc:title":["DNA SELF-ASSEMBLY OF TRAPEZOHEDRAL GRAPHS"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Arts in Mathematics"]},"updated_at":"2026-11-19T08:09:10Z"}