Exploring the behavior of POY, a program for direct optimization of molecular data

The performance of the computer program for phylogenetic analysis, POY, and its two implemented methods, optimization alignment and fixed-states optimization, are explored for four data sets. Four gap costs are analyzed for every partition; some of the partitions (the 18S rRNA) are treated as a single fragment or in increasing fragments of 3, 10, and 30. Comparisons within and among methods are undertaken according to gap cost, number of fragments in which the sequences are divided, tree length, character congruence, topological congruence, primary homology statements, and computation time. (C) 2001 The Willi Hennig Society.