Seeing the trees and their branches in the network is hard
From MaRDI portal
Publication:935159
DOI10.1016/j.tcs.2008.04.019zbMath1147.68059OpenAlexW2168907268MaRDI QIDQ935159
Iyad A. Kanj, Ge Xia, Cuong Than, Luay Nakhleh
Publication date: 31 July 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.019
Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Reticulation-visible networks ⋮ Linear Time Algorithm for Tree-Child Network Containment ⋮ Non-essential arcs in phylogenetic networks ⋮ On determining if tree-based networks contain fixed trees ⋮ Solving the tree containment problem in linear time for nearly stable phylogenetic networks ⋮ Folding and unfolding phylogenetic trees and networks ⋮ Do branch lengths help to locate a tree in a phylogenetic network? ⋮ Tree Containment With Soft Polytomies ⋮ Locating a tree in a phylogenetic network ⋮ Algorithms for visualizing phylogenetic networks ⋮ A QUBO formulation for the tree containment problem ⋮ On encodings of phylogenetic networks of bounded level ⋮ On cherry-picking and network containment ⋮ A quadratic kernel for computing the hybridization number of multiple trees ⋮ Display sets of normal and tree-child networks ⋮ Phylogenetic networks that display a tree twice ⋮ Finding a most parsimonious or likely tree in a network with respect to an alignment ⋮ When is a phylogenetic network simply an amalgamation of two trees? ⋮ On unrooted and root-uncertain variants of several well-known phylogenetic network problems ⋮ Topology of viral evolution ⋮ When two trees go to war ⋮ A decomposition theorem and two algorithms for reticulation-visible networks ⋮ Unnamed Item ⋮ Locating a Tree in a Phylogenetic Network in Quadratic Time ⋮ The Structure of Level-k Phylogenetic Networks ⋮ Displaying trees across two phylogenetic networks ⋮ On Computing the Maximum Parsimony Score of a Phylogenetic Network ⋮ Fishing for minimum evolution trees with neighbor-nets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- The Fine Structure of Galls in Phylogenetic Networks
- Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
- Phylogenetic Networks: Properties and Relationship to Trees and Clusters
- Computational Science – ICCS 2005
- Computing and Combinatorics
