Parsimony optimization of phylogenetic networks.

An algorithm is described for the optimization of character data (e.g. qualitative, nucleic acid sequence) on softwired phylogenetic networks. The algorithm presented here is an extension of those developed for trees under the parsimony criterion and can form the basis for phylogenetic network search procedures. Although the problem is (in general) an NP-Hard optimization, the resolution-based algorithm we describe here capitalizes on the significant amount of shared structure in sub-graphs containing network edges, reducing the execution time and allowing for the analysis of empirical datasets.

FASTC: a file format for multi-character sequence data.

Here, we define a sequence file format that allows for multi-character elements (FASTC). The format is derived from the FASTA format and the custom alphabet format of POY4/5. The format is more general than either of these formats and can represent a broad variety of sequence-type data. This format should be useful for analyses involving datasets encoded as linear streams such as gene synteny, comparative linguistics, temporal gene expression and development, complex animal behaviours, and general biological time-series data.