Computing, School of
School of Computing: Dissertations, Theses, and Student Research
Accessibility Remediation
If you are unable to use this item in its current form due to accessibility barriers, you may request remediation through our remediation request form.
First Advisor
Peter Z. Revesz
Date of this Version
12-2003
Document Type
Thesis
Abstract
DNA sequences are really huge having a length of around 3-4 million base pairs. Hence, each DNA sequence has to be cut down into small fragments using restriction enzymes. Once analyzed, these fragments have to be arranged or assembled into a single set of sequences called a genome map, to obtain the original DNA sequence. This problem is called the Genome Map Assembly Problem. A Constraint-Automata Solution was proposed for this purpose [11]. This thesis improves and implements the Constraint-Automata Solution to find all the possible solutions. The Modified Constraint-Automata Solution was implemented in Perl and executed on parts of various chromosomes of the human DNA. We show that the constraint automaton has a linear execution time.
Comments
A thesis presented to the faculty of the Graduate College at the University of Nebraska in partial fulfillment of requirements for the degree of Master of Science
Major: Computer Science
Under the supervision of Professor Peter Z. Revesz. Lincoln, Nebraska, December 2003
Copyright (c) 2003 Viswanathan Ramanathan