Algorithmic advances towards a fully automated DNA genotyping system

Abstract

Short Tandem Repeats (STR) genotyping is a leading tool in forensic DNA analysis. In STR genotyping, alleles in a sample are identified by measuring their lengths to form a genetic profile. Forming a genetic profile is time-consuming and labor-intensive. As the technology matures, increasing demand for improved throughput and efficiency is fueling development of automated forensic DNA analysis systems. This thesis describes two algorithmic advances towards implementing such a system. In particular, the algorithms address motif-matching and pattern recognition issues that arise in processing a genetic profile. The algorithms were initially written in MATLAB and later converted into C++ for incorporation into a prototype, automated system.