License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.WABI.2021.17
URN: urn:nbn:de:0030-drops-143708
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14370/
Go to the corresponding LIPIcs Volume Portal


Wawerka, Marcin ; Dąbkowski, Dawid ; Rutecka, Natalia ; Mykowiecka, Agnieszka ; Górecki, Paweł

Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks

pdf-format:
LIPIcs-WABI-2021-17.pdf (1 MB)


Abstract

We address the problem of inferring an optimal tree displayed by a network, given a gene tree G and a tree-child network N, under the deep coalescence cost. We propose an O(|G||N|)-time dynamic programming algorithm (DP) to compute a lower bound of the optimal displayed tree cost, where |G| and |N| are the sizes of G and N, respectively. This algorithm has the ability to state whether the cost is exact or is a lower bound. In addition, our algorithm provides a set of reticulation edges that correspond to the obtained cost. If the cost is exact, the set induces an optimal displayed tree that yields the cost. If the cost is a lower bound, the set contains pairs of conflicting edges, that is, edges sharing a reticulation node. Next, we show a conflict resolution algorithm that requires 2^{r+1}-1 invocations of DP in the worst case, where r is a number of reticulations. We propose a similar O(2^k|G||N|)-time algorithm for level-k networks and a branch and bound solution to compute lower and upper bounds of optimal costs. We also show how our algorithms can be extended to a broader class of phylogenetic networks. Despite their exponential complexity in the worst case, our solutions perform significantly well on empirical and simulated datasets, thanks to the strategy of resolving internal dissimilarities between gene trees and networks. In particular, experiments on simulated data indicate that the runtime of our solution is Θ(2^{0.543 k}|G||N|) on average. Therefore, our solution is an efficient alternative to enumeration strategies commonly proposed in the literature and enables analyses of complex networks with dozens of reticulations.

BibTeX - Entry

@InProceedings{wawerka_et_al:LIPIcs.WABI.2021.17,
  author =	{Wawerka, Marcin and D\k{a}bkowski, Dawid and Rutecka, Natalia and Mykowiecka, Agnieszka and G\'{o}recki, Pawe{\l}},
  title =	{{Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks}},
  booktitle =	{21st International Workshop on Algorithms in Bioinformatics (WABI 2021)},
  pages =	{17:1--17:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-200-6},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{201},
  editor =	{Carbone, Alessandra and El-Kebir, Mohammed},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14370},
  URN =		{urn:nbn:de:0030-drops-143708},
  doi =		{10.4230/LIPIcs.WABI.2021.17},
  annote =	{Keywords: Phylogenetic Network, Gene Tree, Species Tree, Deep Coalescence, Reticulation, Optimal Displayed Tree}
}

Keywords: Phylogenetic Network, Gene Tree, Species Tree, Deep Coalescence, Reticulation, Optimal Displayed Tree
Collection: 21st International Workshop on Algorithms in Bioinformatics (WABI 2021)
Issue Date: 2021
Date of publication: 22.07.2021


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI