{"id":{"repo_id":"duquesne","oai_identifier":"oai:dsc.duq.edu:etd-2633"},"canonical_url":"https://search.ndltd.org/etd/duquesne/oai:dsc.duq.edu:etd-2633","repository":{"repo_id":"duquesne","name":"Duquesne","base_url":"https://dsc.duq.edu/do/oai/"},"display":{"title":"Improving the Study of Gene Rearrangement in Bayesian Phylogeny","abstract":"Examining gene rearrangement is one important method for constructing phylogenies, or evolutionary histories, of taxa. Our research uses Bayesian approach, implemented by a Markov chain Monte Carlo algorithm, for finding the most probable phylogenies and assessing their likelihood given gene arrangement data. In past research, when updating trees, algorithms examined the arrangement data stored in pairs of connected nodes. We develop a new method, which examines the arrangements of the three neighbors of an internal node. The rearrangements found by the method are not guaranteed to be optimal, but will, with high probability, be close to optimal. Initial tests show that the new update method improves the MCMC procedure.","abstract_html":"Examining gene rearrangement is one important method for constructing phylogenies, or evolutionary histories, of taxa. Our research uses Bayesian approach, implemented by a Markov chain Monte Carlo algorithm, for finding the most probable phylogenies and assessing their likelihood given gene arrangement data. In past research, when updating trees, algorithms examined the arrangement data stored in pairs of connected nodes. We develop a new method, which examines the arrangements of the three neighbors of an internal node. The rearrangements found by the method are not guaranteed to be optimal, but will, with high probability, be close to optimal. Initial tests show that the new update method improves the MCMC procedure.","abstract_has_math":false,"creators":["Yang, Xiting"],"institution":null,"degree_name":"MS","degree_level":"Campus Only","degree_discipline":"Computational Mathematics","degree_department":null,"school":null,"contributors":["Donald L. Simon","Francesco Cesareo","Kathleen A. Taylor","Patrick Juola"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:51:48Z","subjects":["Bayesian Phylogeny","Markov chain Monte Carlo","Three Neighbors of an Internal Node"],"languages":["English"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dsc.duq.edu/etd/1616","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dsc.duq.edu/etd/1616","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-2633","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Donald L. Simon","Francesco Cesareo","Kathleen A. Taylor","Patrick Juola"]},{"key":"dc:creator","label":"Author","values":["Yang, Xiting"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2023-01-05T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2004-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computational Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Campus Only"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Bayesian Phylogeny","Markov chain Monte Carlo","Three Neighbors of an Internal Node"]}]},{"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/1616"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Examining gene rearrangement is one important method for constructing phylogenies, or evolutionary histories, of taxa. Our research uses Bayesian approach, implemented by a Markov chain Monte Carlo algorithm, for finding the most probable phylogenies and assessing their likelihood given gene arrangement data. In past research, when updating trees, algorithms examined the arrangement data stored in pairs of connected nodes. We develop a new method, which examines the arrangements of the three neighbors of an internal node. The rearrangements found by the method are not guaranteed to be optimal, but will, with high probability, be close to optimal. Initial tests show that the new update method improves the MCMC procedure."]},{"key":"dc:title","label":"Title","values":["Improving the Study of Gene Rearrangement in Bayesian Phylogeny"]}]}],"canonical_facts":{"dc:contributor":["Donald L. Simon","Francesco Cesareo","Kathleen A. Taylor","Patrick Juola"],"dc:creator":["Yang, Xiting"],"dc:date.available":["2023-01-05T08:00:00Z"],"dc:date.created":["2004-01-01T08:00:00Z"],"dc:description.abstract":["Examining gene rearrangement is one important method for constructing phylogenies, or evolutionary histories, of taxa. Our research uses Bayesian approach, implemented by a Markov chain Monte Carlo algorithm, for finding the most probable phylogenies and assessing their likelihood given gene arrangement data. In past research, when updating trees, algorithms examined the arrangement data stored in pairs of connected nodes. We develop a new method, which examines the arrangements of the three neighbors of an internal node. The rearrangements found by the method are not guaranteed to be optimal, but will, with high probability, be close to optimal. Initial tests show that the new update method improves the MCMC procedure."],"dc:identifier":["https://dsc.duq.edu/etd/1616"],"dc:language":["English"],"dc:subject":["Bayesian Phylogeny","Markov chain Monte Carlo","Three Neighbors of an Internal Node"],"dc:title":["Improving the Study of Gene Rearrangement in Bayesian Phylogeny"],"thesis:degree_discipline":["Computational Mathematics"],"thesis:degree_level":["Campus Only"],"thesis:degree_name":["MS"]},"updated_at":"2026-11-19T07:51:48Z"}