A sub-cubic time algorithm for computing the quartet distance between two general trees

@inproceedings{Nielsen2011AST,
  title={A sub-cubic time algorithm for computing the quartet distance between two general trees},
  author={Jesper Kj{\ae}r Nielsen and Anders K. Kristensen and Thomas Mailund and Christian N. S. Pedersen},
  booktitle={Algorithms for Molecular Biology},
  year={2011}
}
BackgroundWhen inferring phylogenetic trees different algorithms may give different trees. To study such effects a measure for the distance between two trees is useful. Quartet distance is one such measure, and is the number of quartet topologies that differ between two trees.ResultsWe have derived a new algorithm for computing the quartet distance between a pair of general trees, i.e. trees where inner nodes can have any degree ≥ 3. The time and space complexity of our algorithm is sub-cubic… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

Algorithms for Computing the Triplet Quartet Distances for Binary General Trees

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

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

Similar Papers

Loading similar papers…