SPECTRE: a suite of phylogenetic tools for reticulate evolution

Abstract Summary Split-networks are a generalization of phylogenetic trees that have proven to be a powerful tool in phylogenetics. Various ways have been developed for computing such networks, including split-decomposition, NeighborNet, QNet and FlatNJ. Some of these approaches are implemented in the user-friendly SplitsTree software package. However, to give the user the option to adjust and extend these approaches and to facilitate their integration into analysis pipelines, there is a need for robust, open-source implementations of associated data structures and algorithms. Here, we present SPECTRE, a readily available, open-source library of data structures written in Java, that comes complete with new implementations of several pre-published algorithms and a basic interactive graphical interface for visualizing planar split networks. SPECTRE also supports the use of longer running algorithms by providing command line interfaces, which can be executed on servers or in High Performance Computing environments. Availability and implementation Full source code is available under the GPLv3 license at: https://github.com/maplesond/SPECTRE. SPECTRE’s core library is available from Maven Central at: https://mvnrepository.com/artifact/uk.ac.uea.cmp.spectre/core. Documentation is available at: http://spectre-suite-of-phylogenetic-tools-for-reticulate-evolution.readthedocs.io/en/latest/ Supplementary information Supplementary data are available at Bioinformatics online.

[1]  Binh T. Nguyen,et al.  Constructing and Drawing Regular Planar Split Networks , 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[2]  D. Huson,et al.  Application of phylogenetic networks in evolutionary studies. , 2006, Molecular biology and evolution.

[3]  Lior Pachter,et al.  The neighbor-net algorithm , 2007, Adv. Appl. Math..

[4]  Kristoffer Forslund,et al.  QNet: an agglomerative method for the construction of phylogenetic networks from weighted quartets. , 2006, Molecular biology and evolution.

[5]  A. Dress,et al.  Split decomposition: a new and useful approach to phylogenetic analysis of distance data. , 1992, Molecular phylogenetics and evolution.

[6]  Vincent Moulton,et al.  Fishing for minimum evolution trees with Neighbor-Nets , 2014, Inf. Process. Lett..

[7]  V. Moulton,et al.  Neighbor-net: an agglomerative method for the construction of phylogenetic networks. , 2002, Molecular biology and evolution.

[8]  Stefan Grünewald,et al.  SuperQ: Computing Supernetworks from Quartets , 2013, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[9]  E. Holmes,et al.  Recombination between sequences of hepatitis B virus from different genotypes , 1996, Journal of Molecular Evolution.

[10]  Vincent Moulton,et al.  FlatNJ: a novel network-based approach to visualize evolutionary and biogeographical relationships. , 2014, Systematic biology.