{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/13057"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/13057","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Joint Optimal Classification and Pairing of Human Chromosomes","abstract":"<p>In this thesis, we reexamine the problems of computer-aided classification and pairing of human chromosomes. Traditionally researchers have dealt with the problem of classification and pairing separately. In our work, we propose to jointly optimize the solutions of these two very closely related problems. The combined problem is formulated into one of optimal three-dimensional assignment with an objective function of maximum likelihood. This formulation poses two technical challenges: 1. estimation of the posterior probability that two chromosomes form a pair and the pair belongs to a class, and 2. good heuristic algorithms to solve the three-dimensional assignment problem which is NP-hard. In our work, we present various techniques to solve these problems. We also generalize our algorithms to cases where the cell data are incomplete as often encountered in practice.</p>","abstract_html":"&lt;p&gt;In this thesis, we reexamine the problems of computer-aided classification and pairing of human chromosomes. Traditionally researchers have dealt with the problem of classification and pairing separately. In our work, we propose to jointly optimize the solutions of these two very closely related problems. The combined problem is formulated into one of optimal three-dimensional assignment with an objective function of maximum likelihood. This formulation poses two technical challenges: 1. estimation of the posterior probability that two chromosomes form a pair and the pair belongs to a class, and 2. good heuristic algorithms to solve the three-dimensional assignment problem which is NP-hard. In our work, we present various techniques to solve these problems. We also generalize our algorithms to cases where the cell data are incomplete as often encountered in practice.&lt;/p&gt;","abstract_has_math":false,"creators":["Biyani, Pravesh"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Electrical and Computer Engineering","school":null,"contributors":[],"advisors":["Wu, Xiaolin"],"committee_chairs":[],"committee_members":[],"year":2004,"date_issued":"2004-10","date_published":"2004-10","updated_at":"2026-11-18T19:39:00Z","subjects":["Electrical and Computer Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/22468"],"render_values":[{"text":"https://doi.org/10.71548/22468","href":"https://doi.org/10.71548/22468","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/7889","8964","4288566"],"render_values":[{"text":"opendissertations/7889","href":null,"code":true},{"text":"8964","href":null,"code":true},{"text":"4288566","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/13057","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/13057","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F13057","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Wu, Xiaolin"]},{"key":"dc:contributor.department","label":"Department","values":["Electrical and Computer Engineering"]},{"key":"dc:creator","label":"Author","values":["Biyani, Pravesh"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T17:02:12Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T17:02:12Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2013-07-04"]},{"key":"dc:date.issued","label":"Date","values":["2004-10"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical and Computer Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/7889","8964","4288566"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/13057","https://doi.org/10.71548/22468"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>In this thesis, we reexamine the problems of computer-aided classification and pairing of human chromosomes. Traditionally researchers have dealt with the problem of classification and pairing separately. In our work, we propose to jointly optimize the solutions of these two very closely related problems. The combined problem is formulated into one of optimal three-dimensional assignment with an objective function of maximum likelihood. This formulation poses two technical challenges: 1. estimation of the posterior probability that two chromosomes form a pair and the pair belongs to a class, and 2. good heuristic algorithms to solve the three-dimensional assignment problem which is NP-hard. In our work, we present various techniques to solve these problems. We also generalize our algorithms to cases where the cell data are incomplete as often encountered in practice.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Applied Science (MASc)"]},{"key":"dc:title","label":"Title","values":["Joint Optimal Classification and Pairing of Human Chromosomes"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Wu, Xiaolin"],"dc:contributor.department":["Electrical and Computer Engineering"],"dc:creator":["Biyani, Pravesh"],"dc:date.accessioned":["2014-06-18T17:02:12Z"],"dc:date.available":["2014-06-18T17:02:12Z"],"dc:date.created":["2013-07-04"],"dc:date.issued":["2004-10"],"dc:description.abstract":["<p>In this thesis, we reexamine the problems of computer-aided classification and pairing of human chromosomes. Traditionally researchers have dealt with the problem of classification and pairing separately. In our work, we propose to jointly optimize the solutions of these two very closely related problems. The combined problem is formulated into one of optimal three-dimensional assignment with an objective function of maximum likelihood. This formulation poses two technical challenges: 1. estimation of the posterior probability that two chromosomes form a pair and the pair belongs to a class, and 2. good heuristic algorithms to solve the three-dimensional assignment problem which is NP-hard. In our work, we present various techniques to solve these problems. We also generalize our algorithms to cases where the cell data are incomplete as often encountered in practice.</p>"],"dc:description.degree":["Master of Applied Science (MASc)"],"dc:identifier.other":["opendissertations/7889","8964","4288566"],"dc:identifier.uri":["http://hdl.handle.net/11375/13057","https://doi.org/10.71548/22468"],"dc:subject":["Electrical and Computer Engineering"],"dc:title":["Joint Optimal Classification and Pairing of Human Chromosomes"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:39:00Z"}