14
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      SPECTRE: a suite of phylogenetic tools for reticulate evolution

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          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.

          Related collections

          Most cited references8

          • Record: found
          • Abstract: found
          • Article: not found

          Neighbor-net: an agglomerative method for the construction of phylogenetic networks.

          We present Neighbor-Net, a distance based method for constructing phylogenetic networks that is based on the Neighbor-Joining (NJ) algorithm of Saitou and Nei. Neighbor-Net provides a snapshot of the data that can guide more detailed analysis. Unlike split decomposition, Neighbor-Net scales well and can quickly produce detailed and informative networks for several hundred taxa. We illustrate the method by reanalyzing three published data sets: a collection of 110 highly recombinant Salmonella multi-locus sequence typing sequences, the 135 "African Eve" human mitochondrial sequences published by Vigilant et al., and a collection of 12 Archeal chaperonin sequences demonstrating strong evidence for gene conversion. Neighbor-Net is available as part of the SplitsTree4 software package.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Split decomposition: a new and useful approach to phylogenetic analysis of distance data.

            In order to analyze the structure inherent to a matrix of dissimilarities (such as evolutionary distances) we propose to use a new technique called split decomposition. This method accurately dissects the given dissimilarity measure as a sum of elementary "split" metrics plus a (small) residue. The split summands identify related groups which are susceptible to further interpretation when casted against the available biological information. Reanalysis of previously published ribosomal RNA data sets using split decomposition illustrate the potential of this approach.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              SuperQ: computing supernetworks from quartets.

              Supertrees are a commonly used tool in phylogenetics to summarize collections of partial phylogenetic trees. As a generalization of supertrees, phylogenetic supernetworks allow, in addition, the visual representation of conflict between the trees that is not possible to observe with a single tree. Here, we introduce SuperQ, a new method for constructing such supernetworks (SuperQ is freely available at >www.uea.ac.uk/computing/superq.). It works by first breaking the input trees into quartet trees, and then stitching these together to form a special kind of phylogenetic network, called a split network. This stitching process is performed using an adaptation of the QNet method for split network reconstruction employing a novel approach to use the branch lengths from the input trees to estimate the branch lengths in the resulting network. Compared with previous supernetwork methods, SuperQ has the advantage of producing a planar network. We compare the performance of SuperQ to the Z-closure and Q-imputation supernetwork methods, and also present an analysis of some published data sets as an illustration of its applicability.
                Bookmark

                Author and article information

                Contributors
                Role: Associate Editor
                Journal
                Bioinformatics
                Bioinformatics
                bioinformatics
                Bioinformatics
                Oxford University Press
                1367-4803
                1367-4811
                15 March 2018
                24 November 2017
                24 November 2017
                : 34
                : 6
                : 1056-1057
                Affiliations
                [1 ]Earlham Institute, Norwich Research Park, Norwich NR4 7UZ, UK
                [2 ]Merseburg University of Applied Sciences, 06217 Merseburg, Germany
                [3 ]School of Computing Sciences, University of East Anglia, Norwich NR4 7TJ, UK
                [4 ]Department of Computer Science, University of Tübingen, Sand 14, 72076 Tübingen, Germany
                Author notes

                The authors wish it to be known that, in their opinion, Sarah Bastkowski and Daniel Mapleson authors should be regarded as Joint First Authors.

                To whom correspondence should be addressed.
                Article
                btx740
                10.1093/bioinformatics/btx740
                5860355
                29186450
                03af709b-84e4-456b-b7d9-7352dc2d6944
                © The Author 2017. Published by Oxford University Press.

                This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( http://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.

                History
                : 06 June 2017
                : 13 October 2017
                : 23 November 2017
                Page count
                Pages: 2
                Categories
                Applications Notes
                Phylogenetics

                Bioinformatics & Computational biology
                Bioinformatics & Computational biology

                Comments

                Comment on this article