Solving Tree Containment Problem for Reticulation-visible Networks with Optimal Running Time

2017/02/14 by Andreas D. M. Gunawan, Gunawan, Andreas · 1 citation
Agricultural and Biological Sciences · Biochemistry, Genetics and Molecular Biology · #Chromosomal and Genetic Variations #Data Structures and Algorithms (cs.DS) #FOS: Biological sciences #FOS: Computer and information sciences #Genome Rearrangement Algorithms #Genomics and Phylogenetic Studies #Populations and Evolution (q-bio.PE)

paper · pdf · doi:10.48550/arxiv.1702.04088

openalex publication_date 2017/02/14 · openalex created_date 2017/03/16 · openalex updated_date 2026/07/28

Abstract

Tree containment problem is a fundamental problem in phylogenetic study, as it is used to verify a network model. It asks whether a given network contain a subtree that resembles a binary tree. The problem is NP-complete in general, even in the class of binary network. Recently, it was proven to be solvable in cubic time, and later in quadratic time for the class of general reticulation visible networks. In this paper, we further improve the time complexity into linear time.

Citations

• Locating a Tree in a Reticulation-Visible Network in Cubic Time

Cited by

• Exploiting Low Scanwidth to Resolve Soft Polytomies

Related

• Locating a Tree in a Reticulation-Visible Network in Cubic Time
• Linear-Time Tree Containment in Phylogenetic Networks
• Locating a Phylogenetic Tree in a Reticulation-Visible Network in Quadratic Time
• Reticulation-visible networks
• Locating a tree in a phylogenetic network