Event Title

Optimizing the Construction of Self-Assembled DNA Windmill Graphs

Presenter Information

Gabriel Lopez

Presentation Type

Poster Presentation

College

College of Natural Sciences

Location

SMSU Event Center BC

Faculty Mentor

Dr. Cory Johnson

Start Date

5-16-2019 9:30 AM

End Date

5-16-2019 11:00 AM

Abstract

Laboratory techniques have been developed using the Watson- Crick complementary properties of DNA strands to achieve self- assembly of DNA complexes. Since modeling the self- assembly process requires designing the component molecular building blocks, construction methods developed with concepts from graph theory have resulted in significantly increased efficiency. The vertices of the graph of some degree k represent k-armed branched junction molecules, called tiles. Each branch of a tile has a cohesive end of some bond- edge type. We seek to determine the minimum number of distinct tile and bond- edge types necessary to create a target self- assembled complex. Although many results are known for a few infinite classes of graphs, many classes of graphs remain unsolved. With this poster, we present results for the minimum number of tile and bond- edge types for windmill graphs.

Share

COinS
 
May 16th, 9:30 AM May 16th, 11:00 AM

Optimizing the Construction of Self-Assembled DNA Windmill Graphs

SMSU Event Center BC

Laboratory techniques have been developed using the Watson- Crick complementary properties of DNA strands to achieve self- assembly of DNA complexes. Since modeling the self- assembly process requires designing the component molecular building blocks, construction methods developed with concepts from graph theory have resulted in significantly increased efficiency. The vertices of the graph of some degree k represent k-armed branched junction molecules, called tiles. Each branch of a tile has a cohesive end of some bond- edge type. We seek to determine the minimum number of distinct tile and bond- edge types necessary to create a target self- assembled complex. Although many results are known for a few infinite classes of graphs, many classes of graphs remain unsolved. With this poster, we present results for the minimum number of tile and bond- edge types for windmill graphs.