Combining Networks Using Cherry Picking Sequences

Conference paper (2020)

Authors

R. Janssen Discrete Mathematics and Optimization
Mark Jones Centrum Wiskunde & Informatica (CWI)
Yuki Murakami Discrete Mathematics and Optimization
Research Group
Discrete Mathematics and Optimization
Copyright: © 2020 R. Janssen, M.E.L. Jones, Yukihiro Murakami
DOI: https://doi.org/10.1007/978-3-030-42266-0_7
More Info
expand_more

Published Date

2020

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Research Group

Discrete Mathematics and Optimization

Abstract

Phylogenetic networks are important for the study of evolution. The number of methods to find such networks is increasing, but most such methods can only reconstruct small networks. To find bigger networks, one can attempt to combine small networks. In this paper, we study the Network Hybridization problem, a problem of combining networks into another network with low complexity. We characterize this complexity via a restricted problem, Tree-child Network Hybridization, and we present an FPT algorithm to efficiently solve this restricted problem.

Files

AlCoB_2020_Combining_Tree_chil... (pdf)
(pdf | 0.51 Mb)
- Embargo expired in 03-04-2021
Unknown license
Janssen2020_Chapter_CombiningN... (pdf)
(pdf | 0.535 Mb)
Unknown license

Download not available