Wim Hordijk has written some Java software that implement various supertree algorithms described in chapters by David Bryant, Philip Daniel, Charles Semple, and Mike Steel, in the forthcoming book on supertrees edited by Olaf Bininda-Emonds. Each algorithm outputs a supertree only if the input trees are compatible (they differ in the definition of "compatible").
Source and examples [supertree.tar] [supertree.tar.gz]
Brief description of the code [Postscript][PDF]
You will need Java installed, and access to the command line. I ran these programs on Mac OS X 10.1 with Java 1.3.1 with no problems.
Unpack the source code
tar -xvf supertree.tar
Each algorithm is in its own folder, together with a source file that contains a set of source trees. For example, the directory LabelledTree contains source for the algorithm, Graph.java, LabelledTree.java, and SetComp.java and the file Spiders.java which contains two trees for spiders.
To run these programs, first cd to the appropriate directory and compile the Java source files:
javac *.java
Then, type
java name-of-file
where name-of-file is the name of the file containing the example trees, (e.g., Spiders).
java Spiders
You should see output looking like this:
compatible ([Amblypygi],((([Paleocribellatae],[Hypochilidae],(([Dictynoidea],(([Uloboridae] ,[Deinopidae])[add5],[Araneoidea])[Orbiculariae],(([Scytodoidea],[Filistatidae]) [add2],[Oecobiidae],([Amaurobioidea],[Lycosoidea])[add3],[Eresidae])[add4])[ Araneoclada],([Austrochilidae],[Gradungulidae])[add1])[Neocribellatae])[ Araneomorphae],[Mygalomorphae])[Opisthothelae],[Liphistiomorphae])[Araneae])[ Arachnida];
This web page was written and is maintained by Rod Page. The software is written by Wim Hordijk. The algorithms were developed by David Bryant, Charles Semple, Mike Steel, and Philip Daniel.
Last updated: 1 October 2003