The multiple alignment procedures implemented in MALIGN are close parallels to those used to search for minimum length cladograms. The logic and program commands will be clear to those familiar with programs such as Hennig86, NONA, and PAUP. Alignment topologies are constructed via different sequences and improved through branch swapping. Each alignment topology yields a multiple alignment and cladograms are constructed from that alignment. The cost of the most parsimonious cladogram is then assigned as the multiple alignment cost.