LAUSR

Fast Compatibility Testing for Rooted Phylogenetic Trees

Sign Up to like & get
recommendations!
0 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