Ask a Librarian

Threre are lots of ways to contact a librarian. Choose what works best for you.

HOURS TODAY

10:00 am - 3:00 pm

Reference Desk

CONTACT US BY PHONE

(802) 656-2022

Voice

(802) 503-1703

Text

MAKE AN APPOINTMENT OR EMAIL A QUESTION

Schedule an Appointment

Meet with a librarian or subject specialist for in-depth help.

Email a Librarian

Submit a question for reply by e-mail.

WANT TO TALK TO SOMEONE RIGHT AWAY?

Library Hours for Thursday, March 28th

All of the hours for today can be found below. We look forward to seeing you in the library.
HOURS TODAY
8:00 am - 12:00 am
MAIN LIBRARY

SEE ALL LIBRARY HOURS
WITHIN HOWE LIBRARY

MapsM-Th by appointment, email govdocs@uvm.edu

Media Services8:00 am - 7:00 pm

Reference Desk10:00 am - 3:00 pm

OTHER DEPARTMENTS

Special Collections10:00 am - 6:00 pm

Dana Health Sciences Library7:30 am - 11:00 pm

 

CATQuest

Search the UVM Libraries' collections

UVM Theses and Dissertations

Browse by Department
Format:
Print
Author:
Scheld, Jessica M.
Dept./Program:
Mathematics
Year:
2007
Degree:
MS
Abstract:
DNA sequencing is a common lab technique used by scientists to determine the exact order of nucleotides in a strand of DNA. Large DNA molecules are sequenced in short random overlapping fragments which are then used to assemble the entire sequence. We are interested in determining how probable a fiagrnent sequence is to being correctly assembled in the proper location. In order to do this, we must consider the DNA assembly path, and calculate the points at which there is a likelihood of failure. "Many gaps will need to be filled in, and there are areas where sequences are repeated many times, making it almost impossible to determine where some of the fragments belong [N01]."
Inherent in all DNA sequences is the occurrence of repeated subsequences, which implies a possibility of incorrectly rearranging the sequence unknowingly. This probability increases as the DNA strand increases in length. Scientists would benefit from knowing that the assembled sequence has the highest probability of being the correct one. The BEST Theorem provides a way to determine the number of Eulerian circuits given a graph with n vertices. We are interested in a more structural classification; namely, to characterize all 4-regular graphs with m Eulerian circuits. The answer would enable us to establish the probability of finding the correct DNA sequence. In this paper we address some of the characterizations of graphs which give rise to certain numbers of Eulerian circuits.