Show simple item record

dc.contributor.authorSun, Jing.en_US
dc.date.accessioned2010-03-09T20:22:57Z
dc.date.available2010-03-09T20:22:57Z
dc.date.issued2010-03-09T20:22:57Z
dc.identifier.urihttp://hdl.handle.net/10464/2938
dc.description.abstractThe design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and the fixed GC--content constraint, as well as the basic edit distance constraint between codewords. We focus on exploring the theory underlying DNA codes and discuss several approaches to searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive search algorithm to produce provably optimal DNA codes for codes with small parameter values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes with relatively large parameter values, where we can consider their sizes as reasonable lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA codes with length from 1 to 9 and minimum distance from 1 to 9.en_US
dc.language.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectBiologically-inspired computing.en_US
dc.subjectMolecular computers.en_US
dc.subjectDNA--Analysis.en_US
dc.titleBounds on edit metric codes with combinatorial DNA constraintsen_US
dc.typeElectronic Thesis or Dissertationen_US
dc.degree.nameM.Sc. Computer Scienceen_US
dc.degree.levelMastersen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.degree.disciplineFaculty of Mathematics and Scienceen_US
refterms.dateFOA2021-08-07T02:24:32Z


Files in this item

Thumbnail
Name:
Brock_Sun_Jing_2010.pdf
Size:
2.071Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record