Not only do many biological populations undergo evolution, but population members may also migrate from one location to another. For example, tumor cells may migrate from the primary tumor and seed a new metastasis, and pathogens may migrate from one host to another. One may represent a population's migration history by labeling the vertices of a given phylogeny T with locations such that an edge incident to vertices with distinct locations represents a migration. Additionally, in some biological populations, taxa from distinct lineages may comigrate from one location to another in a single event, a phenomenon known as a comigration. Here, we show that a previous problem statement for inferring migration histories that are parsimonious in terms of migrations and comigrations may lead to temporally inconsistent solutions. To remedy this deficiency, we introduce precise definitions of temporal consistency of comigrations in a phylogeny, leading to three successive problems. First, we formulate the Temporally Consistent Comigrations (TCC) problem to check if a set of comigrations is temporally consistent and provide a linear time algorithm for solving this problem. Second, we formulate the Parsimonious Consistent Comigration (PCC) problem, which aims to find comigrations given a location labeling of a phylogeny. We show that PCC is NP-hard. Third, we formulate the Parsimonious Consistent Comigration History (PCCH) problem, which infers the migration history given a phylogeny and locations of its extant vertices only. We show that PCCH is NP-hard as well. On the positive side, we propose integer linear programming models to solve the PCC and PCCH problems. We apply our approach to real and simulated data.
|Title of host publication||23rd International Workshop on Algorithms in Bioinformatics, WABI 2023|
|Editors||Djamal Belazzougui, A�da Ouangraoua|
|Publisher||Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing|
|State||Published - Aug 2023|
|Event||23rd International Workshop on Algorithms in Bioinformatics, WABI 2023 - Houston, United States|
Duration: 4 Sep 2023 → 6 Sep 2023
|Name||Leibniz International Proceedings in Informatics, LIPIcs|
|Conference||23rd International Workshop on Algorithms in Bioinformatics, WABI 2023|
|Period||4/09/23 → 6/09/23|
Bibliographical noteFunding Information:
Israel Science Foundation (grant no. ISF 1927/21) and the American/Israeli Binational Science Foundation (grant no. BSF 2021139). National Science Foundation award number CCF 2046488 as well as funding from the Cancer Center at Illinois. This project started as a collaboration at the Computational Genomics Summer Institute 2022.
© Mrinmoy Saha Roddur, Sagi Snir, and Mohammed El-Kebir; licensed under Creative Commons License CC-BY 4.0.
- Integer Linear Programming
- Maximum parsimony
ASJC Scopus subject areas