Cargando…

Combining Networks Using Cherry Picking Sequences

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Janssen, Remie, Jones, Mark, Murakami, Yukihiro
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7197094/
http://dx.doi.org/10.1007/978-3-030-42266-0_7
_version_ 1783528812913360896
author Janssen, Remie
Jones, Mark
Murakami, Yukihiro
author_facet Janssen, Remie
Jones, Mark
Murakami, Yukihiro
author_sort Janssen, Remie
collection PubMed
description 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.
format Online
Article
Text
id pubmed-7197094
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-71970942020-05-04 Combining Networks Using Cherry Picking Sequences Janssen, Remie Jones, Mark Murakami, Yukihiro Algorithms for Computational Biology Article 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. 2020-02-01 /pmc/articles/PMC7197094/ http://dx.doi.org/10.1007/978-3-030-42266-0_7 Text en © Springer Nature Switzerland AG 2020 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.
spellingShingle Article
Janssen, Remie
Jones, Mark
Murakami, Yukihiro
Combining Networks Using Cherry Picking Sequences
title Combining Networks Using Cherry Picking Sequences
title_full Combining Networks Using Cherry Picking Sequences
title_fullStr Combining Networks Using Cherry Picking Sequences
title_full_unstemmed Combining Networks Using Cherry Picking Sequences
title_short Combining Networks Using Cherry Picking Sequences
title_sort combining networks using cherry picking sequences
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7197094/
http://dx.doi.org/10.1007/978-3-030-42266-0_7
work_keys_str_mv AT janssenremie combiningnetworksusingcherrypickingsequences
AT jonesmark combiningnetworksusingcherrypickingsequences
AT murakamiyukihiro combiningnetworksusingcherrypickingsequences