Using the A* algorithm to build DNA nanostructures

dc.contributor.authorHedbrandh, Christofer
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering, Computing Science (Chalmers)en
dc.date.accessioned2019-07-03T12:17:47Z
dc.date.available2019-07-03T12:17:47Z
dc.date.issued2010
dc.description.abstractIn this project a suggested idea for an abstraction of simplex DNA was used to simulate DNA behavior. Furthermore, the A* search algorithm was used to construct a sequence of simplex DNA strands used to build a desired DNA structure. DNA nanotechnology is a subfield of nanotechnology where DNA is used as structural material. DNA origami is an example of an accomplishment in this field, where short "staple" strands are used to fold up a longer DNA stand in order to produce 2 dimensional shapes. Demonstrated designs have included a smiley face and a map of the Americas. Various different DNA "machines" such as DNA tweezers, which can operate with nanoscale precision, and DNA walkers, which can walk along a track of DNA, have been built. Potential applications for these machines are within nanorobotics and nanomedicine. The abstraction of simplex DNA consists of reducing sequences of DNA bases to single entities, and of discarding some odd and unusual behavior. This simplification makes it feasible to perform quick simulations, and still deliver simulated results comparable to the actual.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/117965
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectDatalogi
dc.subjectBioinformatik och systembiologi
dc.subjectComputer science
dc.subjectBioinformatics and Systems Biology
dc.titleUsing the A* algorithm to build DNA nanostructures
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH

Ladda ner