The Community for Technology Leaders
Green Image
Issue No. 04 - July-Aug. (2015 vol. 12)
ISSN: 1545-5963
pp: 807-814
Suzanne J. Matthews , Department of Electrical Engineering and Computer Science, United States Military Academy, West Point, NY
Compressing heterogeneous collections of trees is an open problem in computational phylogenetics. In a heterogeneous tree collection, each tree can contain a unique set of taxa. An ideal compression method would allow for the efficient archival of large tree collections and enable scientists to identify common evolutionary relationships over disparate analyses. In this paper, we extend TreeZip to compress heterogeneous collections of trees. TreeZip is the most efficient algorithm for compressing homogeneous tree collections. To the best of our knowledge, no other domain-based compression algorithm exists for large heterogeneous tree collections or enable their rapid analysis. Our experimental results indicate that TreeZip averages 89.03 percent (72.69 percent) space savings on unweighted (weighted) collections of trees when the level of heterogeneity in a collection is moderate. The organization of the TRZ file allows for efficient computations over heterogeneous data. For example, consensus trees can be computed in mere seconds. Lastly, combining the TreeZip compressed (TRZ) file with general-purpose compression yields average space savings of 97.34 percent (81.43 percent) on unweighted (weighted) collections of trees. Our results lead us to believe that TreeZip will prove invaluable in the efficient archival of tree collections, and enables scientists to develop novel methods for relating heterogeneous collections of trees.
Phylogeny, Computational biology, Bioinformatics, Compression algorithms

S. J. Matthews, "Heterogeneous Compression of Large Collections of Evolutionary Trees," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 12, no. 4, pp. 807-814, 2015.
596 ms
(Ver 3.3 (11022016))