{"id":{"repo_id":"windsor","oai_identifier":"oai:uwindsor.scholaris.ca:20.500.14776/5158"},"canonical_url":"https://search.dev.ndltd.org/etd/windsor/oai:uwindsor.scholaris.ca:20.500.14776/5158","repository":{"repo_id":"windsor","name":"University of Windsor","base_url":"https://uwindsor.scholaris.ca/server/oai/request"},"display":{"title":"Multiple Alignment of Structures using Center of Proteins","abstract":"There is a buzz among structural biologists about conducting a major portion of their future work in silico, due to progressively refined computational tools and an amazing quantity of digitized biological data. This masters thesis focusses on the area of computational methods for aligning multiple protein structures. As the problem under consideration is known to be np–complete, several ways for coming up with good approximations have been suggested over the years. A new approach for achieving better, or at least as good results as before, is presented here. We discuss the proposed algorithm and its constituent methods. Finally, we report the widely used root mean square deviation (RMSD) as measures of structural similarity, and the execution time. Some chosen results, from our extensive experimentation, and their significance have been discussed. A web server has also been implemented for trying out a pairwise alignment algorithm. This is hosted on the university website and the link has been provided in the contributions","abstract_html":"There is a buzz among structural biologists about conducting a major portion of their future work in silico, due to progressively refined computational tools and an amazing quantity of digitized biological data. This masters thesis focusses on the area of computational methods for aligning multiple protein structures. As the problem under consideration is known to be np–complete, several ways for coming up with good approximations have been suggested over the years. A new approach for achieving better, or at least as good results as before, is presented here. We discuss the proposed algorithm and its constituent methods. Finally, we report the widely used root mean square deviation (RMSD) as measures of structural similarity, and the execution time. Some chosen results, from our extensive experimentation, and their significance have been discussed. A web server has also been implemented for trying out a pairwise alignment algorithm. This is hosted on the university website and the link has been provided in the contributions","abstract_has_math":false,"creators":["Roy, Kaushik"],"institution":"University of Windsor","degree_name":"M.Sc.","degree_level":"Masters","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Mukhopadhyay, Asish"],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-01-01","date_published":"2014-01-01","updated_at":"2026-07-27T22:04:59Z","subjects":[],"languages":["en_CA"],"rights":[],"rights_urls":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/20.500.14776/5158","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Mukhopadhyay, Asish"]},{"key":"dc:creator","label":"Author","values":["Roy, Kaushik"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-06-23 16:08"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-12-10 13:09","2025-06-23T20:08:41Z"]},{"key":"dc:date.issued","label":"Date","values":["2014-01-01"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/masterThesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.Sc."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Windsor"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_CA"]},{"key":"dc:rights","label":"Dc Rights","values":["http://creativecommons.org/licenses/by-nc-nd/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/20.500.14776/5158"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["There is a buzz among structural biologists about conducting a major portion of their future work in silico, due to progressively refined computational tools and an amazing quantity of digitized biological data. This masters thesis focusses on the area of computational methods for aligning multiple protein structures. As the problem under consideration is known to be np–complete, several ways for coming up with good approximations have been suggested over the years. A new approach for achieving better, or at least as good results as before, is presented here. We discuss the proposed algorithm and its constituent methods. Finally, we report the widely used root mean square deviation (RMSD) as measures of structural similarity, and the execution time. Some chosen results, from our extensive experimentation, and their significance have been discussed. A web server has also been implemented for trying out a pairwise alignment algorithm. This is hosted on the university website and the link has been provided in the contributions"]},{"key":"dc:title","label":"Title","values":["Multiple Alignment of Structures using Center of Proteins"]}]}],"canonical_facts":{"dc:contributor.advisor":["Mukhopadhyay, Asish"],"dc:creator":["Roy, Kaushik"],"dc:date.accessioned":["2025-06-23 16:08"],"dc:date.available":["2014-12-10 13:09","2025-06-23T20:08:41Z"],"dc:date.issued":["2014-01-01"],"dc:description.abstract":["There is a buzz among structural biologists about conducting a major portion of their future work in silico, due to progressively refined computational tools and an amazing quantity of digitized biological data. This masters thesis focusses on the area of computational methods for aligning multiple protein structures. As the problem under consideration is known to be np–complete, several ways for coming up with good approximations have been suggested over the years. A new approach for achieving better, or at least as good results as before, is presented here. We discuss the proposed algorithm and its constituent methods. Finally, we report the widely used root mean square deviation (RMSD) as measures of structural similarity, and the execution time. Some chosen results, from our extensive experimentation, and their significance have been discussed. A web server has also been implemented for trying out a pairwise alignment algorithm. This is hosted on the university website and the link has been provided in the contributions"],"dc:identifier.uri":["https://hdl.handle.net/20.500.14776/5158"],"dc:language.iso":["en_CA"],"dc:rights":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"dc:title":["Multiple Alignment of Structures using Center of Proteins"],"dc:type":["info:eu-repo/semantics/masterThesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Masters"],"thesis:degree_name":["M.Sc."],"thesis:institution_name":["University of Windsor"]},"updated_at":"2026-07-27T22:04:59Z"}