Publication Date
2008
Degree Type
Master's Project
Degree Name
Master of Science (MS)
Department
Computer Science
Abstract
In this work, we describe our efforts to seek optimal solutions for the DNA Fragment Assembly Problem in terms of assembly accuracy and runtime efficiency. The main obstacles for the DNA Fragment Assembly are analyzed. After reviewing various advanced algorithms adopted by some assemblers in the bioinformatics industry, this work explores the feasibility of assembling fragments for a target sequence containing perfect long repeats, which is deemed theoretically impossible without tedious finishing reaction experiments. Innovative algorithms incorporating statistical analysis proposed in this work make the restoration of DNA sequences containing long perfect repeats an attainable goal.
Recommended Citation
Li, Ching, "DNA Fragment Assembly Algorithms: Toward a Solution for Long Repeats" (2008). Master's Projects. 98.
DOI: https://doi.org/10.31979/etd.fmj6-8gzv
https://scholarworks.sjsu.edu/etd_projects/98
