is a program written in Java which computes the cutpoints of a
finite metric space as described in . In addition, the
program can also compute the decomposition of the given metric
into block metrics induced by the cutpoints.
and its source code are freely available under the GNU General
Public License. To get the program, download the zipped folder
from here. More
information on how to use the program can be found in the
README file which is also included in the zipped folder.
have questions concerning the program or would like to report
a bug please contact me by e-mail.
work has been supported in part by The British Council and the
DAAD, within the ARC Programme.
This program is distributed in the hope that it will be useful, but without any warranty; without even the implied warranty of merchantability or fitness for a particular purpose. See the GNU General Public License for more details.
SuperQ is a program written in Java which computes a phylogenetic super network from a collection of partial phylogenetic trees as described in  . The official website of the program is located at the University of East Anglia.
FlatNJ (FlatNetJoining) is a program written in Java for computing split networks that allow for interior vertices to be labeled while being (almost) planar as described in . The official website of the program is located at the University of East Anglia.
SPECTRE is a suite of tools for inferring evolutionary patterns associated with reticulate evolution. More information can be found in the documentation.