{"id":{"repo_id":"csusb","oai_identifier":"oai:scholarworks.lib.csusb.edu:etd-3600"},"canonical_url":"https://search.ndltd.org/etd/csusb/oai:scholarworks.lib.csusb.edu:etd-3600","repository":{"repo_id":"csusb","name":"CSUniversity San Bernardino","base_url":"https://scholarworks.lib.csusb.edu/do/oai/"},"display":{"title":"Robustness of Network Inference Algorithms under Network Class Misspecification","abstract":"Inferring phylogenies in the presence of hybridization remains a difficult problem. As a result, many current methods for reconstructing phylogenetic networks are restricted to a simple class of networks known as level-1. This restriction arises from theoretical considerations rather than empirical evidence, with real data possibly arising from complex networks. In this work, we evaluate the robustness of two level-1 network inference methods, SNaQ and NANUQ+, through a simulation study, when the input data originates from a more complex network. Specifically, we investigate whether these methods can accurately recover important features of the true species network, such as the circular order (the arrangement of taxa around a network), taxa of hybrid origin (taxa that arose from a hybridization event), and other structural properties. Our results show that while both methods are accurate in recovering the circular order of the network, they lack in other network features such as determining which taxa are product a hybridization event. These results highlight the strengths and limitations of current level-1 methods under model misspecification, guiding the interpretation of their outputs in practice.","abstract_html":"Inferring phylogenies in the presence of hybridization remains a difficult problem. As a result, many current methods for reconstructing phylogenetic networks are restricted to a simple class of networks known as level-1. This restriction arises from theoretical considerations rather than empirical evidence, with real data possibly arising from complex networks. In this work, we evaluate the robustness of two level-1 network inference methods, SNaQ and NANUQ+, through a simulation study, when the input data originates from a more complex network. Specifically, we investigate whether these methods can accurately recover important features of the true species network, such as the circular order (the arrangement of taxa around a network), taxa of hybrid origin (taxa that arose from a hybridization event), and other structural properties. Our results show that while both methods are accurate in recovering the circular order of the network, they lack in other network features such as determining which taxa are product a hybridization event. These results highlight the strengths and limitations of current level-1 methods under model misspecification, guiding the interpretation of their outputs in practice.","abstract_has_math":false,"creators":["Ceja, Roberto"],"institution":null,"degree_name":"Master of Arts in Mathematics","degree_level":"Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Hector Banos Cervantes"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:10:11Z","subjects":["phylogenetics","hybridization","coalescent theory","robusteness","graph theory","simulation","Mathematics","Other Ecology and Evolutionary Biology","Other Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.lib.csusb.edu/etd/2336","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://scholarworks.lib.csusb.edu/etd/2336","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://scholarworks.lib.csusb.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Ascholarworks.lib.csusb.edu%3Aetd-3600","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hector Banos Cervantes"]},{"key":"dc:creator","label":"Author","values":["Ceja, Roberto"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2025-11-10T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2025-12-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Arts in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["phylogenetics","hybridization","coalescent theory","robusteness","graph theory","simulation","Mathematics","Other Ecology and Evolutionary Biology","Other Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.lib.csusb.edu/etd/2336"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Inferring phylogenies in the presence of hybridization remains a difficult problem. As a result, many current methods for reconstructing phylogenetic networks are restricted to a simple class of networks known as level-1. This restriction arises from theoretical considerations rather than empirical evidence, with real data possibly arising from complex networks. In this work, we evaluate the robustness of two level-1 network inference methods, SNaQ and NANUQ+, through a simulation study, when the input data originates from a more complex network. Specifically, we investigate whether these methods can accurately recover important features of the true species network, such as the circular order (the arrangement of taxa around a network), taxa of hybrid origin (taxa that arose from a hybridization event), and other structural properties. Our results show that while both methods are accurate in recovering the circular order of the network, they lack in other network features such as determining which taxa are product a hybridization event. These results highlight the strengths and limitations of current level-1 methods under model misspecification, guiding the interpretation of their outputs in practice."]},{"key":"dc:title","label":"Title","values":["Robustness of Network Inference Algorithms under Network Class Misspecification"]}]}],"canonical_facts":{"dc:contributor":["Hector Banos Cervantes"],"dc:creator":["Ceja, Roberto"],"dc:date.available":["2025-11-10T08:00:00Z"],"dc:date.created":["2025-12-01T08:00:00Z"],"dc:description.abstract":["Inferring phylogenies in the presence of hybridization remains a difficult problem. As a result, many current methods for reconstructing phylogenetic networks are restricted to a simple class of networks known as level-1. This restriction arises from theoretical considerations rather than empirical evidence, with real data possibly arising from complex networks. In this work, we evaluate the robustness of two level-1 network inference methods, SNaQ and NANUQ+, through a simulation study, when the input data originates from a more complex network. Specifically, we investigate whether these methods can accurately recover important features of the true species network, such as the circular order (the arrangement of taxa around a network), taxa of hybrid origin (taxa that arose from a hybridization event), and other structural properties. Our results show that while both methods are accurate in recovering the circular order of the network, they lack in other network features such as determining which taxa are product a hybridization event. These results highlight the strengths and limitations of current level-1 methods under model misspecification, guiding the interpretation of their outputs in practice."],"dc:identifier":["https://scholarworks.lib.csusb.edu/etd/2336"],"dc:subject":["phylogenetics","hybridization","coalescent theory","robusteness","graph theory","simulation","Mathematics","Other Ecology and Evolutionary Biology","Other Mathematics"],"dc:title":["Robustness of Network Inference Algorithms under Network Class Misspecification"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Arts in Mathematics"]},"updated_at":"2026-11-19T08:10:11Z"}