2026-09-19T10:51:26Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/284382022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Dan Ehrlich.
Liu, Manway Michael, 1980-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-09-26T20:27:55Z
2005-09-26T20:27:55Z
2004
2004
http://hdl.handle.net/1721.1/28438
57003244
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (leaves 46-47).
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.
by Manway Michael Liu.
M.Eng.
47 leaves
2052335 bytes
2055723 bytes
application/pdf
application/pdf
en_US
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Algorithmic advances towards a fully automated DNA genotyping system
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="690ef861-ae29-49fb-9155-defa25d67842">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>en_US</Language>
<Title>Algorithmic advances towards a fully automated DNA genotyping system</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Liu, Manway Michael, 1980-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>