We present new and improved approximation and FPT algorithms for computing rooted and unrooted maximum agreement forests (MAFs) of pairs of phylogenetic trees. Their sizes correspond to the subtree-prune-and-regraft distances and the tree-bisection-and-reconnection distances of the trees, respectively. We also provide the first bounded search tree FPT algorithm for computing rooted maximum acyc...

Phylogenetic trees have been widely used in the study of evolutionary biology for representing the tree-like evolution of a collection of species. However, different data sets and different methods often lead to the construction of different phylogenetic trees for the same set of species. Therefore, comparing these trees to determine similarities or, equivalently, dissimilarities, becomes the f...

The subtree prune-and-regraft (SPR) distance metric is a fundamen-tal way of comparing evolutionary trees. It has wide-ranging applications,such as to study lateral genetic transfer, viral recombination, and Markovchain Monte Carlo phylogenetic inference. Although the rooted versionof SPR distance can be computed relatively efficiently between rootedtrees using fixed-paramet...

purpose: to evaluate changes in indications of corneal transplantation at labbafinejad medical center during 2001-2003. methods: records of 563 from 684 patients who had undergone corneal transplantation from oct. 2001 to oct. 2003 were evaluated. all the procedures were performed by corneal surgeons and fellows. findings: there were 292 male (51.9%) and 217 female (48.1%) subjects ranging in a...

The rooted subtree prune and regraft (rSPR) distance between two binary phylogenetic trees is a well-studied measure of topological dissimilarity that NP-hard to compute. Here we describe an improved linear kernel for the problem. In particular, show if classical chain reduction rules are augmented with modified type rule, resulting have at most 9 k − 3 leaves, where rSPR distance; this bound t...