Compression of Phylogenetic Networks and Algorithm for the Tree Containment Problem.
J Comput Biol
; 26(3): 285-294, 2019 03.
Article
en En
| MEDLINE
| ID: mdl-30624954
ABSTRACT
Rooted phylogenetic networks are rooted acyclic digraphs. They are used to model complex evolution where hybridization, recombination, and other reticulation events play a role. A rigorous definition of network compression is introduced on the basis of recent studies of relationships between cluster, tree, and rooted phylogenetic networks. The concept reveals new connections between well-studied network classes, including tree-child networks and reticulation-visible networks. It also enables us to define a new class of networks for which the cluster containment problem is solvable in linear time.
Palabras clave
Texto completo:
1
Colección:
01-internacional
Banco de datos:
MEDLINE
Asunto principal:
Filogenia
/
Análisis de Secuencia de ADN
/
Genómica
/
Compresión de Datos
Tipo de estudio:
Prognostic_studies
Idioma:
En
Revista:
J Comput Biol
Asunto de la revista:
BIOLOGIA MOLECULAR
/
INFORMATICA MEDICA
Año:
2019
Tipo del documento:
Article
País de afiliación:
Singapur