Combining Networks using Cherry Picking Sequences

12/09/2019
by   Remie Janssen, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2019

2-Local Hamiltonian with Low Complexity is QCMA

We prove that 2-Local Hamiltonian (2-LH) with Low Complexity problem is ...
research
11/04/2021

Imagine Networks

In this paper, we introduce an Imagine Network that can simulate itself ...
research
07/01/2020

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

In this paper, we present InPos, an improved algorithm, to reconstruct ...
research
09/23/2021

An algorithm for reconstructing level-2 phylogenetic networks from trinets

Evolutionary histories for species that cross with one another or exchan...
research
11/02/2021

Graph Tree Deductive Networks

In this paper, we introduce Graph Tree Deductive Networks, a network tha...
research
02/24/2019

Generation of Tree-Child phylogenetic networks

Phylogenetic networks generalize phylogenetic trees by allowing the mode...
research
01/14/2022

Aspects of Muchnik's paradox in restricted betting

Muchnik's paradox says that enumerable betting strategies are not always...

Please sign up or login with your details

Forgot password? Click here to reset