Article

QuickTree: building huge Neighbour-Joining trees of protein sequences.

The Wellcome Trust Sanger Institute, The Wellcome Trust Genome Campus, Hinxton CB10 1SA, UK.
Bioinformatics (Impact Factor: 4.62). 12/2002; 18(11):1546-7. DOI: 10.1093/bioinformatics/18.11.1546
Source: PubMed

ABSTRACT We have written a fast implementation of the popular Neighbor-Joining tree building algorithm. QuickTree allows the reconstruction of phylogenies for very large protein families (including the largest Pfam alignment containing 27000 HIV GP120 glycoprotein sequences) that would be infeasible using other popular methods.

0 Bookmarks
 · 
182 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Surface-associated capsular polysaccharides (CPSs) protect bacteria against phage infection and enhance pathogenicity by interfering with the function of the host innate immune system. The CPS of enteropathogenic Escherichia coli K92 is a unique sialic acid polymer (polySia) with alternating α2,8- and α2,9-linkages. This CPS can be digested by the gene 143 encoded endosialidase of bacteriophage phi92. Here we report the crystal structure of the phi92 endosialidase in complex with a dimer of α2,9-linked sialic acid and analyze its catalytic functions. Unlike the well characterized and homologous endosialidase of phage K1F, the phi92 endosialidase is a bifunctional enzyme with high activity against α2,8- and low activity against α2,9-linkages in a polySia chain. Moreover, in contrast to the processive K1F endosialidase, the phi92 endosialidase degrades the polymer in a non-processive mode. Beyond describing the first endosialidase with α2,9-specificity, our data introduce a novel platform for studies of endosialidase regioselectivity and for engineering highly active α2,9-specific enzymes. Copyright © 2014 Elsevier Inc. All rights reserved.
    Virology 12/2014; DOI:10.1016/j.virol.2014.11.002 · 3.28 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Phylogenetic methods are becoming part of the standard method-ologies used in the analyses of biological sequence data, but several of the classical tools of phylogenetic inference were not designed with high throughput applications in mind. During our surveys, we haven't found software for the fast inference of neighbor joining trees from sequence alignments which could use biologically realistic substitution models with protein alignments. Thus, we developed quicktree-sd based on an ecient implementation of the neighbor joining algorithm by [3], by implementing an amino acid distance correction based on Scoredist distances. The tool is available at ftp.awi.de. High throughput phylogenetic inference is being used to an increasing extent in the context of genomic data. On the one hand, phylogenetic methods are used to improve genome annotation [1],[2]; on the other, genomic data are used in order to understand evolutionary / phylogenetic questions [4]. One of the simpler methods of phylogenetic inference is neighbor joining (NJ; [5]), which provides a good compromise between computational requirements and accuracy, provided that biologically realistic substitution models are used for estimating distances between sequences [7]. Surprisingly, we have not found any available tool for constructing NJ trees from sequence alignments combining performance with a biologically realistic amino acid substitution model. Quicktree [3] was developed as a tool for the fast inference of NJ trees, with high throughput applications in mind. However, the original implementation of Quicktree did not use an amino acid substitution matrix for calculating the dis-tance matrices. Scoredist was proposed as a simple and generally usable protein sequence distance estimator by [6]. We implemented this distance estimator in quicktree and provide the tool for the scientic community as source code and binaries at ftp.awi.de (also see www.awi.de/en/go/bioinformatics).
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Phylogenetic analysis is a critical area of modern life biology, and is among the most computationally intensive areas of the life sciences. Phylogenetics, the study of evolutionary relationships, is used to study a wider range of topics, including the evolution of critical traits, speciation, adaptation, and many other areas. In this paper, we present an implementation of a scal-able approach to the construction of phylogenetic trees, derived from the neighbor joining algorithm for tree construction, and specifically upon the optimizations to this algorithm implemented in the NINJA software. Performance results and an analysis of the scalability of this approach is presented.

Full-text (2 Sources)

Download
28 Downloads
Available from
Jun 6, 2014