Combining Networks Using Cherry Picking Sequences

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

1 Citation (Scopus)
3 Downloads (Pure)


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.

Original languageEnglish
Title of host publicationAlgorithms for Computational Biology
Subtitle of host publication7th International Conference, AlCoB 2020, Proceedings
EditorsCarlos Martín-Vide, Miguel A. Vega-Rodríguez, Travis Wheeler
Place of PublicationCham
Number of pages16
ISBN (Electronic)978-3-030-42266-0
ISBN (Print)978-3-030-42265-3
Publication statusPublished - 2020
Event7th International Conference on Algorithms for Computational Biology, AlCoB 2020 - Missoula, United States
Duration: 13 Apr 202015 Apr 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference7th International Conference on Algorithms for Computational Biology, AlCoB 2020
CountryUnited States

Bibliographical note

Accepted author manuscript


  • FPT algorithms
  • Network hybridization
  • Phylogenetic networks
  • Tree-child networks


Dive into the research topics of 'Combining Networks Using Cherry Picking Sequences'. Together they form a unique fingerprint.

Cite this