Encoding methods for DNA languages defined via the subword closure operation

Show simple item record

dc.contributor.advisor Konstantinidis, Stavros
dc.creator Cui, Bo
dc.date.accessioned 2011-05-09T12:31:45Z
dc.date.available 2011-05-09T12:31:45Z
dc.date.issued 2007
dc.identifier.other QA76.887 C85 2007
dc.identifier.uri http://library2.smu.ca/xmlui/handle/01/22260
dc.description ix, 124 leaves : ill. ; 29 cm.
dc.description Includes abstract.
dc.description Includes bibliographical references (leaves 118-124).
dc.description.abstract In DNA computing, information is encoded onto DNA sequences. The DNA codes in the form of single-stranded DNA sequences are not stable. This is because when two single-stranded DNA sequences, used to carry data, have complement parts on them, they naturally tend to stick to each other. This is due to the Watson-Crick complementarity property and causes the problem of undesirable bonds. Some properties and constraints have been proposed to prevent the problem, but most of them are local constraints which concentrate on a segment of a DNA word of a certain length. Therefore, if we concatenate some DNA words satisfying some local constraints, the resulting words might violate the same constraints. This makes encoding methods for DNA languages difficult to design. To solve this problem, we investigate sonic properties of the subword closure operation that is used for constructing DNA languages and propose practical encoding methods for such languages. We also implement our methods using advanced C++ tools for finite automata as well as design a web interface that allows users to obtain a DNA language in response to given values for certain parameters.
dc.description.provenance Made available in DSpace on 2011-05-09T12:31:45Z (GMT). No. of bitstreams: 0 en
dc.language.iso en
dc.publisher Halifax, N.S. : Saint Mary's University
dc.subject.lcc QA76.887
dc.subject.lcsh Molecular computers
dc.subject.lcsh Formal languages
dc.subject.lcsh Machine theory
dc.title Encoding methods for DNA languages defined via the subword closure operation
dc.type Text
thesis.degree.name Master of Science in Applied Science
thesis.degree.level Masters
thesis.degree.discipline Mathematics and Computing Science
thesis.degree.grantor Saint Mary's University (Halifax, N.S.)
 Find Full text

Files in this item


This item appears in the following Collection(s)

Show simple item record

Search DSpace


My Account