Modified Mincut Supertrees

@inproceedings{Page2002ModifiedMS,
  title={Modified Mincut Supertrees},
  author={Roderic D. M. Page},
  booktitle={WABI},
  year={2002}
}
A polynomial time supertree algorithm could play a key role in a divide-and-conquer strategy for assembling the tree of life. To date only a single such method capable of accommodate conflicting input trees has been proposed, the MinCutSupertree algorithm of Semple and Steel. This paper describes this algorithm and its implementation, then illustrates some weaknesses of the method. A modification to the algorithm that avoids some of these problems is proposed. The paper concludes by discussing… CONTINUE READING
Highly Influential
This paper has highly influenced 19 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
84 Citations
32 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 84 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees

  • B. R. Baum
  • Taxon 41
  • 1992
Highly Influential
8 Excerpts

Towards a phylogenetic supertree of Platyhelminthes? In: Littlewood, D.T.J., Bray, R.A. (eds.): Interrelationships of the Platyhelminthes

  • M. Wilkinson, J. L. Thorley, D.T.J. Littlewood, R. A. Bray
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…