{"id":{"repo_id":"duquesne","oai_identifier":"oai:dsc.duq.edu:etd-3334"},"canonical_url":"https://search.ndltd.org/etd/duquesne/oai:dsc.duq.edu:etd-3334","repository":{"repo_id":"duquesne","name":"Duquesne","base_url":"https://dsc.duq.edu/do/oai/"},"display":{"title":"Hidden Markov Model for Identifying Local Variants in Human Genomes using Simulated Data","abstract":"Identifying adaptive mutations in genetic data is challenging due to the low frequency of occurrence of such events, and because signatures of selection are intertwined with the footprints of various other evolutionary forces that shape our genomes. Even when a larger region appears to be under selection, genomic sites that are linked to adaptive mutations have similar statistical signals, and thus can obfuscate the identification of the actual adaptive mutation. The new method described here uses a Hidden Markov Model that allows for classification of neutral, linked, and sweep (adaptive mutation) genomic sites. This model is general and can be scaled to allow for an arbitrary number of classes. Using simulated genetic data, site-specific selection statistics are taken as input, and site probabilities and classifications are the resulting outputs. The Viterbi algorithm is used to identify the most likely path through all classes along the sequence. A stochastic backtrace method allows for the identification of multiple possible paths. By Scott McCallum August 2024 v These methods, in combination with enforcing sweep events, help to identify regions under selection, and allow for better localization of adaptive mutations.","abstract_html":"Identifying adaptive mutations in genetic data is challenging due to the low frequency of occurrence of such events, and because signatures of selection are intertwined with the footprints of various other evolutionary forces that shape our genomes. Even when a larger region appears to be under selection, genomic sites that are linked to adaptive mutations have similar statistical signals, and thus can obfuscate the identification of the actual adaptive mutation. The new method described here uses a Hidden Markov Model that allows for classification of neutral, linked, and sweep (adaptive mutation) genomic sites. This model is general and can be scaled to allow for an arbitrary number of classes. Using simulated genetic data, site-specific selection statistics are taken as input, and site probabilities and classifications are the resulting outputs. The Viterbi algorithm is used to identify the most likely path through all classes along the sequence. A stochastic backtrace method allows for the identification of multiple possible paths. By Scott McCallum August 2024 v These methods, in combination with enforcing sweep events, help to identify regions under selection, and allow for better localization of adaptive mutations.","abstract_has_math":false,"creators":["McCallum, Scott"],"institution":null,"degree_name":"MS","degree_level":"Immediate Access","degree_discipline":"Computational Mathematics","degree_department":null,"school":null,"contributors":["Lauren Sugden","John Fleming"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:52:32Z","subjects":["hidden markov model","population genetics","positive selection","viterbi","python","Computational Biology","Computational Engineering","Evolution","Genetics","Population Biology"],"languages":["English"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dsc.duq.edu/etd/2290","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dsc.duq.edu/etd/2290","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://dsc.duq.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adsc.duq.edu%3Aetd-3334","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Lauren Sugden","John Fleming"]},{"key":"dc:creator","label":"Author","values":["McCallum, Scott"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2025-01-31T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2024-12-20T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computational Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Immediate Access"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["hidden markov model","population genetics","positive selection","viterbi","python","Computational Biology","Computational Engineering","Evolution","Genetics","Population Biology"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dsc.duq.edu/etd/2290"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Identifying adaptive mutations in genetic data is challenging due to the low frequency of occurrence of such events, and because signatures of selection are intertwined with the footprints of various other evolutionary forces that shape our genomes. Even when a larger region appears to be under selection, genomic sites that are linked to adaptive mutations have similar statistical signals, and thus can obfuscate the identification of the actual adaptive mutation. The new method described here uses a Hidden Markov Model that allows for classification of neutral, linked, and sweep (adaptive mutation) genomic sites. This model is general and can be scaled to allow for an arbitrary number of classes. Using simulated genetic data, site-specific selection statistics are taken as input, and site probabilities and classifications are the resulting outputs. The Viterbi algorithm is used to identify the most likely path through all classes along the sequence. A stochastic backtrace method allows for the identification of multiple possible paths. By Scott McCallum August 2024 v These methods, in combination with enforcing sweep events, help to identify regions under selection, and allow for better localization of adaptive mutations."]},{"key":"dc:title","label":"Title","values":["Hidden Markov Model for Identifying Local Variants in Human Genomes using Simulated Data"]}]}],"canonical_facts":{"dc:contributor":["Lauren Sugden","John Fleming"],"dc:creator":["McCallum, Scott"],"dc:date.available":["2025-01-31T08:00:00Z"],"dc:date.created":["2024-12-20T08:00:00Z"],"dc:description.abstract":["Identifying adaptive mutations in genetic data is challenging due to the low frequency of occurrence of such events, and because signatures of selection are intertwined with the footprints of various other evolutionary forces that shape our genomes. Even when a larger region appears to be under selection, genomic sites that are linked to adaptive mutations have similar statistical signals, and thus can obfuscate the identification of the actual adaptive mutation. The new method described here uses a Hidden Markov Model that allows for classification of neutral, linked, and sweep (adaptive mutation) genomic sites. This model is general and can be scaled to allow for an arbitrary number of classes. Using simulated genetic data, site-specific selection statistics are taken as input, and site probabilities and classifications are the resulting outputs. The Viterbi algorithm is used to identify the most likely path through all classes along the sequence. A stochastic backtrace method allows for the identification of multiple possible paths. By Scott McCallum August 2024 v These methods, in combination with enforcing sweep events, help to identify regions under selection, and allow for better localization of adaptive mutations."],"dc:identifier":["https://dsc.duq.edu/etd/2290"],"dc:language":["English"],"dc:subject":["hidden markov model","population genetics","positive selection","viterbi","python","Computational Biology","Computational Engineering","Evolution","Genetics","Population Biology"],"dc:title":["Hidden Markov Model for Identifying Local Variants in Human Genomes using Simulated Data"],"thesis:degree_discipline":["Computational Mathematics"],"thesis:degree_level":["Immediate Access"],"thesis:degree_name":["MS"]},"updated_at":"2026-11-19T07:52:32Z"}