## November 2006

#### Algorithms in Bioinformatics: SplitsTree4: TÃ¼bingen University

by parmentierf & 1 other (via)SplitsTree4 is the leading application for computing evolutionary networks from molecular sequence data. Given an alignment of sequences, a distance matrix or a set of trees, the program will compute a phylogenetic tree or network using methods such as split decomposition, neighbor-net, consensus network, super networks methods or methods for computing hybridization or simple recombination networks.
SplitsTree4 is an all-new implementation of the SplitsTree3 software written in Java.

## September 2006

#### The Boyer-Moore Fast String Searching Algorithm

by parmentierfOur algorithm has the peculiar property that, roughly speaking, the longer the pattern is, the faster the algorithm goes. Furthermore, the algorithm is ``sublinear'' in the sense that it generally looks at fewer characters than it passes. The algorithm is described in

1
(2 marks)