Corpus ID: 1771944

A 3-factor approximation algorithm for a Minimum Acyclic Agreement Forest on k rooted, binary phylogenetic trees

@article{Mukhopadhyay2014A3A,
  title={A 3-factor approximation algorithm for a Minimum Acyclic Agreement Forest on k rooted, binary phylogenetic trees},
  author={Asish Mukhopadhyay and Puspal Bhabak},
  journal={ArXiv},
  year={2014},
  volume={abs/1407.7125}
}
  • Asish Mukhopadhyay, Puspal Bhabak
  • Published 2014
  • Mathematics, Computer Science
  • ArXiv
  • Phylogenetic trees are leaf-labelled trees, where the leaves correspond to extant species (taxa), and the internal vertices represent ancestral species. The evolutionary history of a set of species can be explained by more than one phylogenetic tree, giving rise to the problem of comparing phylogenetic trees for similarity. Various distance metrics, like the subtree prune-and-regraft (SPR), tree bisection reconnection (TBR) and nearest neighbour interchange (NNI) have been proposed to capture… CONTINUE READING

    Figures and Topics from this paper.

    Explore key concepts

    Links to highly relevant papers for key concepts in this paper:

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 15 REFERENCES

    On the Complexity of Comparing Evolutionary Trees

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    A 3-approximation algorithm for the subtree distance between phylogenies

    VIEW 12 EXCERPTS
    HIGHLY INFLUENTIAL

    Approximating the Maximum Agreement Forest on k trees

    VIEW 2 EXCERPTS