title: Spectral partitioning of phylogenetic data sets based on compatibility.
abstract: We describe two new methods to partition phylogenetic data sets of discrete characters based on pairwise compatibility. The partitioning methods make no assumptions regarding the phylogeny, model of evolution, or characteristics of the data. The methods first build a compatibility graph, in which each node represents a character in the data set. Edges in the compatibility graph may represent strict compatibility of characters or they may be weighted based on a fractional compatibility scoring procedure that measures how close the characters are to being compatible. Given the desired number of partitions, the partitioning methods then seek to cluster the characters with the highest average pairwise compatibility, so that characters in each cluster are more compatible with each other than they are with characters in the other cluster(s). Partitioning according to these criteria is computationally intractable (NP-hard); however, spectral methods can quickly provide high-quality solutions. We demonstrate that the spectral partitioning effectively identifies characters with different evolutionary histories in simulated data sets, and it is better at highlighting phylogenetic conflict within empirical data sets than previously used partitioning methods.
authors.affiliation: Department of Computer Science, Iowa State University, Ames, IA 50011, USA.
authors.forename: Duhong
authors.initials: D
authors.lastname: Chen
authors.forename: Gordon J
authors.initials: GJ
authors.lastname: Burleigh
authors.forename: David
authors.initials: D
authors.lastname: Fernández-Baca
mesh_terms: D003198:Computer Simulation; D010802:Phylogeny; D012984:Software