The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and statistical refinements described here permits the execution time of the BLAST programs to be decreased substantially while enhancing their sensitivity to weak similarities. A new criterion for triggering the extension of word hits, combined with a new heuristic for generating gapped alignments, yields a gapped BLAST program that runs at approximately three times the speed of the original. In addition, a method is introduced for automatically combining statistically significant alignments produced by BLAST into a position-specific score matrix, and searching the database using this matrix. The resulting Position-Specific Iterated BLAST (PSIBLAST) program runs at approximately the same speed per iteration as gapped BLAST, but in many cases is much more sensitive to weak but biologically relevant sequence similarities. PSI-BLAST is used to uncover several new and interesting members of the BRCT superfamily.

/pdf/gapped-blast-and-psi-blast-a-new-generation-of-protein-2ybl67x5yx.pdf

Gapped BLAST and PSI-BLAST: a new generation of protein database search programs.

The sensitivity of the commonly used progressive multiple sequence alignment method has been greatly improved for the alignment of divergent protein sequences. Firstly, individual weights are assigned to each sequence in a partial alignment in order to down-weight near-duplicate sequences and up-weight the most divergent ones. Secondly, amino acid substitution matrices are varied at different alignment stages according to the divergence of the sequences to be aligned. Thirdly, residue-specific gap penalties and locally reduced gap penalties in hydrophilic regions encourage new gaps in potential loop regions rather than regular secondary structure. Fourthly, positions in early alignments where gaps have been opened receive locally reduced gap penalties to encourage the opening up of new gaps at these positions. These modifications are incorporated into a new program, CLUSTAL W which is freely available.

/pdf/clustal-w-improving-the-sensitivity-of-progressive-multiple-2na2s9sq2h.pdf

Clustal w: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice

CLUSTAL X is a new windows interface for the widely-used progressive multiple sequence alignment program CLUSTAL W. The new system is easy to use, providing an integrated system for performing multiple sequence and profile alignments and analysing the results. CLUSTAL X displays the sequence alignment in a window on the screen. A versatile sequence colouring scheme allows the user to highlight conserved features in the alignment. Pull-down menus provide all the options required for traditional multiple sequence and profile alignment. New features include: the ability to cut-and-paste sequences to change the order of the alignment, selection of a subset of the sequences to be realigned, and selection of a sub-range of the alignment to be realigned and inserted back into the original alignment. Alignment quality analysis can be performed and low-scoring segments or exceptional residues can be highlighted. Quality analysis and realignment of selected residue ranges provide the user with a powerful tool to improve and refine difficult alignments and to trap errors in input sequences. CLUSTAL X has been compiled on SUN Solaris, IRIX5.3 on Silicon Graphics, Digital UNIX on DECstations, Microsoft Windows (32 bit) for PCs, Linux ELF for x86 PCs, and Macintosh PowerMac.

/pdf/the-clustal-x-windows-interface-flexible-strategies-for-3qez0eyvqt.pdf

The CLUSTAL_X windows interface: flexible strategies for multiple sequence alignment aided by quality analysis tools.

We describe MUSCLE, a new computer program for creating multiple alignments of protein sequences. Elements of the algorithm include fast distance estimation using kmer counting, progressive alignment using a new profile function we call the logexpectation score, and refinement using treedependent restricted partitioning. The speed and accuracy of MUSCLE are compared with T-Coffee, MAFFT and CLUSTALW on four test sets of reference alignments: BAliBASE, SABmark, SMART and a new benchmark, PREFAB. MUSCLE achieves the highest, or joint highest, rank in accuracy on each of these sets. Without refinement, MUSCLE achieves average accuracy statistically indistinguishable from T-Coffee and MAFFT, and is the fastest of the tested methods for large numbers of sequences, aligning 5000 sequences of average length 350 in 7 min on a current desktop computer. The MUSCLE program, source code and PREFAB test data are freely available at http://www.drive5. com/muscle.

MUSCLE: multiple sequence alignment with high accuracy and high throughput

The design, implementation, and capabilities of an extensible visualization system, UCSF Chimera, are discussed. Chimera is segmented into a core that provides basic services and visualization, and extensions that provide most higher level functionality. This architecture ensures that the extension mechanism satisfies the demands of outside developers who wish to incorporate new features. Two unusual extensions are presented: Multiscale, which adds the ability to visualize large-scale molecular assemblies such as viral coats, and Collaboratory, which allows researchers to share a Chimera session interactively despite being at separate locales. Other extensions include Multalign Viewer, for showing multiple sequence alignments and associated structures; ViewDock, for screening docked ligand orientations; Movie, for replaying molecular dynamics trajectories; and Volume Viewer, for display and analysis of volumetric data. A discussion of the usage of Chimera in real-world situations is given, along with anticipated future directions. Chimera includes full user documentation, is free to academic and nonprofit users, and is available for Microsoft Windows, Linux, Apple Mac OS X, SGI IRIX, and HP Tru64 Unix from http://www.cgl.ucsf.edu/chimera/.

/pdf/ucsf-chimera-a-visualization-system-for-exploratory-research-59xu54fhxg.pdf

UCSF Chimera--a visualization system for exploratory research and analysis.

Titin and twitchin are giant proteins expressed in muscle. They are mainly composed of domains belonging to the fibronectin class III and immunoglobulin c2 families, repeated many times. In addition, both proteins have a protein kinase domain near the C-terminus. This paper explores the evolution of these and related muscle proteins in an attempt to determine the order of events that gave rise to the different repeat patterns and the order of appearance of the proteins. Despite their great similarity at the level of sequence organization, titin and twitchin diverged from each other at least as early as the divergence between vertebrates and nematodes. Most of the repeating units in titin and twitchin were estimated to derive from three original domains. Chicken smooth-muscle myosin light-chain kinase (smMLCK) also has a kinase domain, several immunoglobulin domains, and a fibronectin domain. From a comparison of the kinase domains, titin is predicted to have appeared first during the evolution of the family, followed by twitchin and with the vertebrate MLCKs last to appear. The so-called C-protein from chicken is also a member of this family but has no kinase domain. Its origin remains unclear but it most probably pre-dates the titin/twitchin duplication.

The Evolution of Titin and Related Giant Muscle Proteins

Mimicry of Short Linear Motifs by Bacterial Pathogens: A Drugging Opportunity

The accuracy of large-scale DNA sequencing is difficult to estimate without redundant effort. We have found that the mobile genetic element IS10, a component of the transposon Tn10, has contaminated a significant number of clones in the public databases, as a result of the use of the transposon in bacterial cloning strain construction. These contaminations need to be annotated as such. More positively, by defining the range of sequence variation in IS10, we have been able to determine that the rate of sequencing errors is very low, most likely surpassing the stated aim of one error or less in ten thousand bases.

/pdf/an-estimate-of-large-scale-sequencing-accuracy-q632d851by.pdf

An estimate of large-scale sequencing accuracy

The Eukaryotic Linear Motif (ELM) resource is dedicated to the characterization and prediction of short linear motifs (SLiMs). SLiMs are compact, degenerate peptide segments found in many proteins and essential to almost all cellular processes. However, despite their abundance, SLiMs remain largely uncharacterized. The ELM database is a collection of manually annotated SLiM instances curated from experimental literature. In this article we illustrate how to browse and search the database for curated SLiM data, and cover the different types of data integrated in the resource. We also cover how to use this resource in order to predict SLiMs in known as well as novel proteins, and how to interpret the results generated by the ELM prediction pipeline. The ELM database is a very rich resource, and in the following protocols we give helpful examples to demonstrate how this knowledge can be used to improve your own research. © 2017 by John Wiley & Sons, Inc.

Toby J. Gibson

Papers

The Evolution of Titin and Related Giant Muscle Proteins

Mimicry of Short Linear Motifs by Bacterial Pathogens: A Drugging Opportunity

An estimate of large-scale sequencing accuracy

Exploring Short Linear Motifs Using the ELM Database and Tools.

Catalytic RNA and the origin of genetic systems