Modified mincut supertrees

Page, R. D.M. (2002) Modified mincut supertrees. Algorithms in Bioinformatics, Proceedings, 2452, pp. 537-551. (doi: 10.1007/3-540-45784-4_41)

Full text not currently available from Enlighten.


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 some practical problems in supertree construction.

Item Type:Articles
Glasgow Author(s) Enlighten ID:Page, Professor Roderic
Authors: Page, R. D.M.
College/School:College of Medical Veterinary and Life Sciences > School of Biodiversity, One Health & Veterinary Medicine
Journal Name:Algorithms in Bioinformatics, Proceedings
Published Online:10 October 2002

University Staff: Request a correction | Enlighten Editors: Update this record