{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/45868"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/45868","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Joint base-calling of two DNA sequences with factor graphs","abstract":"The advent of DNA sequencing has revolutionized biological research by providing virtual blueprints of living organisms and offering insights into complicated biochemical processes. DNA sequencing is a process encompassing both chemical reactions and signal processing techniques to identify the order of chemical bases in a DNA molecule. In this thesis, we focus on the base-calling stage, during which base order is estimated from data collected through electrophoresis and florescence detection. In particular, we examine the possibility of jointly base-calling two superposed DNA sequences by applying the sum-product algorithm on factor graphs. This approach allows a single electrophoresis experiment to process two sequences, using the same quantity of reagents and machine hours as for a single sequence. A practical heuristic is first used to estimate the peak parameters, then separate those into two sequences (major/minor) by passing messages on a factor graph. Base-calling on the major alone yields accuracy commensurate with single sequence approaches, and joint base-calling provides results for the minor which, while being of lesser quality, incurs no additional cost and can be ultimately used in the genome assembly process.","abstract_html":"The advent of DNA sequencing has revolutionized biological research by providing virtual blueprints of living organisms and offering insights into complicated biochemical processes. DNA sequencing is a process encompassing both chemical reactions and signal processing techniques to identify the order of chemical bases in a DNA molecule. In this thesis, we focus on the base-calling stage, during which base order is estimated from data collected through electrophoresis and florescence detection. In particular, we examine the possibility of jointly base-calling two superposed DNA sequences by applying the sum-product algorithm on factor graphs. This approach allows a single electrophoresis experiment to process two sequences, using the same quantity of reagents and machine hours as for a single sequence. A practical heuristic is first used to estimate the peak parameters, then separate those into two sequences (major/minor) by passing messages on a factor graph. Base-calling on the major alone yields accuracy commensurate with single sequence approaches, and joint base-calling provides results for the minor which, while being of lesser quality, incurs no additional cost and can be ultimately used in the genome assembly process.","abstract_has_math":false,"creators":["Shi, Xiaomeng, Ph. D. Massachusetts Institute of Technology"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Muriel Médard and Desmond S. Lun."],"committee_chairs":[],"committee_members":[],"year":2008,"date_issued":"2008","date_published":"2008","updated_at":"2026-07-22T22:21:42Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/45868","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Muriel Médard and Desmond S. Lun."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Shi, Xiaomeng, Ph. D. Massachusetts Institute of Technology"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2009-06-30T16:29:00Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2009-06-30T16:29:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2008"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/45868"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.","Includes bibliographical references (p. 63-65)."]},{"key":"dc:description.abstract","label":"Abstract","values":["The advent of DNA sequencing has revolutionized biological research by providing virtual blueprints of living organisms and offering insights into complicated biochemical processes. DNA sequencing is a process encompassing both chemical reactions and signal processing techniques to identify the order of chemical bases in a DNA molecule. In this thesis, we focus on the base-calling stage, during which base order is estimated from data collected through electrophoresis and florescence detection. In particular, we examine the possibility of jointly base-calling two superposed DNA sequences by applying the sum-product algorithm on factor graphs. This approach allows a single electrophoresis experiment to process two sequences, using the same quantity of reagents and machine hours as for a single sequence. A practical heuristic is first used to estimate the peak parameters, then separate those into two sequences (major/minor) by passing messages on a factor graph. Base-calling on the major alone yields accuracy commensurate with single sequence approaches, and joint base-calling provides results for the minor which, while being of lesser quality, incurs no additional cost and can be ultimately used in the genome assembly process."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["Joint base-calling of two DNA sequences with factor graphs"]}]}],"canonical_facts":{"dc:contributor.advisor":["Muriel Médard and Desmond S. Lun."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Shi, Xiaomeng, Ph. D. Massachusetts Institute of Technology"],"dc:date.accessioned":["2009-06-30T16:29:00Z"],"dc:date.available":["2009-06-30T16:29:00Z"],"dc:date.issued":["2008"],"dc:description":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.","Includes bibliographical references (p. 63-65)."],"dc:description.abstract":["The advent of DNA sequencing has revolutionized biological research by providing virtual blueprints of living organisms and offering insights into complicated biochemical processes. DNA sequencing is a process encompassing both chemical reactions and signal processing techniques to identify the order of chemical bases in a DNA molecule. In this thesis, we focus on the base-calling stage, during which base order is estimated from data collected through electrophoresis and florescence detection. In particular, we examine the possibility of jointly base-calling two superposed DNA sequences by applying the sum-product algorithm on factor graphs. This approach allows a single electrophoresis experiment to process two sequences, using the same quantity of reagents and machine hours as for a single sequence. A practical heuristic is first used to estimate the peak parameters, then separate those into two sequences (major/minor) by passing messages on a factor graph. Base-calling on the major alone yields accuracy commensurate with single sequence approaches, and joint base-calling provides results for the minor which, while being of lesser quality, incurs no additional cost and can be ultimately used in the genome assembly process."],"dc:description.degree":["S.M."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/45868"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Joint base-calling of two DNA sequences with factor graphs"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:42Z"}