Fast Compatibility Testing for Rooted Phylogenetic Trees
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0330-4
Abstract: We present a new graph-based approach to the following basic problem in phylogenetic tree construction. Let $$\mathcal {P}= \{T_1, \ldots , T_k\}$$P={T1,…,Tk} be a collection of rooted phylogenetic trees over various subsets of a set… read more here.
Keywords: rooted phylogenetic; compatibility; phylogenetic trees; testing rooted ... See more keywords
Planar Rooted Phylogenetic Networks
Sign Up to like & getrecommendations! Published in 2022 at "IEEE/ACM Transactions on Computational Biology and Bioinformatics"
DOI: 10.1109/tcbb.2022.3185670
Abstract: A rooted phylogenetic network is a directed acyclic graph with a single root, whose sinks correspond to a set of species. As such networks are useful for representing the evolution of species that have undergone… read more here.
Keywords: phylogenetic networks; planar rooted; rooted phylogenetic; networks planar ... See more keywords
Rearrangement moves on rooted phylogenetic networks
Sign Up to like & getrecommendations! Published in 2017 at "PLoS Computational Biology"
DOI: 10.1371/journal.pcbi.1005611
Abstract: Phylogenetic tree reconstruction is usually done by local search heuristics that explore the space of the possible tree topologies via simple rearrangements of their structure. Tree rearrangement heuristics have been used in combination with practically… read more here.
Keywords: rooted phylogenetic; network; rearrangement moves; phylogenetic networks ... See more keywords