DROPS

Document

DOI: 10.4230/LIPIcs.WABI.2019.5

Better Practical Algorithms for rSPR Distance and Hybridization Number

Authors: Kohei Yamada, Zhi-Zhong Chen, and Lusheng Wang

Published in: LIPIcs, Volume 143, 19th International Workshop on Algorithms in Bioinformatics (WABI 2019)

Abstract

The problem of computing the rSPR distance of two phylogenetic trees (denoted by RDC) is NP-hard and so is the problem of computing the hybridization number of two phylogenetic trees (denoted by HNC). Since they are important problems in phylogenetics, they have been studied extensively in the literature. Indeed, quite a number of exact or approximation algorithms have been designed and implemented for them. In this paper, we design and implement one exact algorithm for HNC and several approximation algorithms for RDC and HNC. Our experimental results show that the resulting exact program is much faster (namely, more than 80 times faster for the easiest dataset used in the experiments) than the previous best and its superiority in speed becomes even more significant for more difficult instances. Moreover, the resulting approximation programs output much better results than the previous bests; indeed, the outputs are always nearly optimal and often optimal. Of particular interest is the usage of the Monte Carlo tree search (MCTS) method in the design of our approximation algorithms. Our experimental results show that with MCTS, we can often solve HNC exactly within short time.

Cite as

Kohei Yamada, Zhi-Zhong Chen, and Lusheng Wang. Better Practical Algorithms for rSPR Distance and Hybridization Number. In 19th International Workshop on Algorithms in Bioinformatics (WABI 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 143, pp. 5:1-5:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{yamada_et_al:LIPIcs.WABI.2019.5,
  author =	{Yamada, Kohei and Chen, Zhi-Zhong and Wang, Lusheng},
  title =	{{Better Practical Algorithms for rSPR Distance and Hybridization Number}},
  booktitle =	{19th International Workshop on Algorithms in Bioinformatics (WABI 2019)},
  pages =	{5:1--5:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-123-8},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{143},
  editor =	{Huber, Katharina T. and Gusfield, Dan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2019.5},
  URN =		{urn:nbn:de:0030-drops-110355},
  doi =		{10.4230/LIPIcs.WABI.2019.5},
  annote =	{Keywords: phylogenetic tree, fixed-parameter algorithms, approximation algorithms, Monte Carlo tree search}
}

Search Results

Documents authored by Wang, Lusheng

Better Practical Algorithms for rSPR Distance and Hybridization Number

Abstract

Cite as

Thanks for your feedback!

Could not send message