Peter Z. Revesz
Date of this Version
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 . 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.