A rapid method of searching for homology of nucleic acid sequences

A new method of the homology search between DNA sequences was suggested. This method may be used to find extensive and not strong homologies with point mutations and deletions. The computer time to compare sequences is less than dynamic program algorithms at least by four orders of magnitude. It makes possible to use the method for homology search all over the nucleotide bank by personal computers. Some results of homology search are presented.     

DNA sequence analysis: a procedure to find homologies among many sequences.

SEQCMP, a program that analyzes and searches for homology among multiple nucleic acid sequences, is described. The sequences are compared by the dot matrix method and the consensus sequence is derived by superimposing all the dot matrices on one another. The program is written in MBASIC and runs on IBM-PC microcomputer. It is interactive and can be used by investigators with no computer background or experience.     

Proteins with spectrin motifs which do not belong to the spectrin-alpha-actinin-dystrophin family

Using several consensus sequences for the 106 amino acid residue alpha-spectrin repeat segment as probes we searched animal sequence databases using the BLAST program in order to find proteins revealing limited, but significant similarity to spectrin. Among many spectrins and proteins from the spectrin-alpha-actinin-dystrophin family as well as sequences showing a rather high degree of similarity in very short stretches, we found seven homologous animal sequences of low overall similarity to spectrin but showing the presence of one or more spectrin-repeat motifs. The homology relationship of these sequences to alpha-spectrin was further analysed using the SEMIHOM program. Depending on the probe, these segments showed the presence of 6 to 26 identical amino acid residues and a variable number of semihomologous residues. Moreover, we found six protein sequences, which contained a sequence fragment sharing the SH3 (sarc homology region 3) domain homology of 42-59% similarity. Our data indicate the occurrence of motifs of significant homology to alpha-spectrin repeat segments among animal proteins, which are not classical members of the spectrin-alpha-actinin-dystrophin family. This might indicate that these segments together with the SH3 domain motif are conserved in proteins which possibly at the early stage of evolution were close cognates of spectrin-alpha-actinin-dystrophin progenitors but then evolved separately.     

A high speed, high capacity homology matrix: zooming through SV40 and polyoma.

We present a new homology matrix program which owes its basic conception to the two-dimensional dot matrices previously described (1,2), but has important improvements and new features. It scores sequence homology over an adjustable range and plots the scores which are above an operator-determined filtration level. Its powerful noise-filtration system, capacity for compression without much loss of information, and speed of execution make this program a valuable tool in the analysis of homologies, internal direct repeats and reverse repeats, including palindromic sequences. The properties of the program are exemplified by analysis of SV40 and polyoma DNA sequences.     

The matching of protein sequences using color intrasequence homology displays

The program presented here enables one to see at a glance important regions of similarity within two protein sequences —both position and extent of homology are depicted. Essential to this representation is a technique of coloring the sequences according to the identity of the amino acid that allows one to see why the segments are similar. Coloring is governed by the color grouping file, or cgf. The design of useful cgf's is explained. These can be based on a variety of properties, qualitative and quantitative; examples based on structural, chemical, physicochemical and statistical parameters are given. The resulting intrasequence homology display (IHD) can be manipulated in real time and zoomed into to study interesting regions in greater detail. The overall package represents a very flexible and powerful tool for homology modeling.     

BlastAlign: a program that uses blast to align problematic nucleotide sequences

BlastAlign uses NCBI blastn to build a multiple nucleotide alignment and is intended for use with sequences that have large indels or are otherwise difficult to align globally. The program builds a matrix representing regions of homology along the sequences, from which it selects the 'most representative' sequence and then extracts the blastn query-anchored multiple alignment for this sequence. The matrix is printed and allows subgroups to be identified visually and an option allows other sequences to be used as the 'most representative'. The program contains elements of both Perl and Python and will run on UNIX (including Mac OSX) and DOS. An additional Perl program BlastAlignP uses tblastn to align nucleotide sequences to a single amino acid sequence, thus allowing an open reading frame to be maintained in the resulting multiple alignment. AVAILABILITY: It is freely available at http://www.bio.ic.ac.uk/research/belshaw/BlastAlign.tar and at http://evolve.zoo.ox.ac.uk/software/blastalign.     

Genome analysis: A new approach for visualization of sequence organization in genomes

In this article we describe and demonstrate the versatility of a computer program, GENOME MAPPING, that uses interactive graphics and runs on an IRIS workstation. The program helps to visualize as well as analyse global and local patterns of genomic DNA sequences. It was developed keeping in mind the requirements of the human genome sequencing programme, which requires rapid analysis of the data. Using GENOME MAPPING one can discern signature patterns of different kinds of sequences and analyse such patterns for repetitive as well as rare sequence strings. Further, one can visualize the extent of global homology between different genomic sequences. An application of our method to the published yeast mitochondrial genome data shows similar sequence organizations in the entire sequence and in smaller subsequences     

Protein multiple alignment incorporating primary and secondary structure information.

Identifying common local segments, also called motifs, in multiple protein sequences plays an important role for establishing homology between proteins. Homology is easy to establish when sequences are similar (sharing an identity > 25%). However, for distant proteins, it is much more difficult to align motifs that are not similar in sequences but still share common structures or functions. This paper is a first attempt to align multiple protein sequences using both primary and secondary structure information. A new sequence model is proposed so that the model assigns high probabilities not only to motifs that contain conserved amino acids but also to motifs that present common secondary structures. The proposed method is tested in a structural alignment database BAliBASE. We show that information brought by the predicted secondary structures greatly improves motif identification. A website of this program is available at www.stat.purdue.edu/~junxie/2ndmodel/sov.html.     

A computer program for comparative analysis of nucleic acid sequences.

The programs offer the possibility of comparing pairs of homologous sequences in order to find out percentage of homology, number of identical and deviating nucleotides, of transitions and transversions and, derived from these, KNUC-values according to Kimura (1) and the corresponding standard error sigmaK. The sequences can be printed in pairs underneath each other, homologies are indicated by asterisks between the identical nucleotides. Out of a set of homologous sequences stored on a disk any number of sequences can be compared in pairs in this way, and a matrix containing either the percentage of homology values, the number of deviating nucleotides or the KNUC-values together with the corresponding standard errors can be sent to screen, printer or disk. A program will be available soon which creates a dendrogram representing the similarity between the sequences by use of an average linkage clustering method deduced from this matrix. The programs are written for Apple II computers using UCSD-PASCAL and for Sirius I/Victor 9000 computers using TURBO-PASCAL.     

A dotplot program for the Atari ST, for the analysis of DNA and protein sequences

A program was written in GFA-BASIC for the Atari ST microcomputeraimed at drawing two-dimensional homology ‘dotplot’patterns for two protein or DNA sequences. The program, builtaround a machine-code subroutine, communicates interactivelywith the user by means of a multi-button dialogue panel andmouse-directed input. A 1000 x 1000 sequence comparison witha 14: 21 stringency window takes 12 s.     

Homology between the glycoproteins of vesicular stomatitis virus and rabies virus

We compared the predicted amino acid sequences of the vesicular stomatitis virus and rabies virus glycoproteins by using a computer program which provides an optimal alignment and a statistical significance for the match. Highly significant homology between these two proteins was detected, including identical positioning of one glycosylation site. A significant homology between the predicted amino acid sequences of vesicular stomatitis virus and influenza virus matrix proteins was also found.     

Membrane probability profile construction based on amino acids sequences multiple alignment

Prediction of membrane segments in sequences of membrane proteins is well known and important problem. Accuracy of the solution of this problem by methods that don't use homology search in additional data bank can be improved. There is a lack of testing data in this area because of small amount of real structures of membrane proteins. In this work, we create a testing set of structural alignments of membrane proteins, in which positioning of the membrane segments reflects agreement of known 3D-structures of proteins in the alignment. We propose a method for predicting position of membrane segments in multiple alignment based on forward-backward algorithm from HMM theory. This method not only allows to predict positions of membrane segments but also forms probability membrane profile, which can be used in multiple alignment methods that take into account secondary structure information about sequences. Method is implemented in computer program available on the World-Wide Web site http://bioinf.fbb.msu.ru/fwdbck/. Proposed method provides results better than MEMSAT method, which is nearly only tool for prediction of membrane segments in multiple alignments without additional homology search.     

用于聚合酶链式反应(PCR)引物设计的计算机程序

 本文报道了两个用于PCR引物设计的计算机程序PCRDESN和PCRDESNA。PCRDESN程序主要从以下4个方面评价用户自己设计的一对引物的质量:(1)引物内的碱基反向重复或发夹结构,(2)两个引物之间的碱基互补配对,(3)两个引物之间的同源性,(4)引物的碱基组成及特点和T_m值计算。通过用多例文献发表的及本院有关实验室提供的引物对序列的验证,确定了程序的运算参数,证明该程序能较好地检验引物对的质量和解释某些PCR实验失败的原因。PCRDESNA程序采用逐级优化的方法和比PCRDESN所选用的更严紧的引物选择参数对用户提供的核酸序列进行快速检索,以确定所有可能的和合适的引物对。     

ESPript: analysis of multiple sequence alignments in PostScript.

MOTIVATION: The program ESPript (Easy Sequencing in PostScript) allows the rapid visualization, via PostScript output, of sequences aligned with popular programs such as CLUSTAL-W or GCG PILEUP. It can read secondary structure files (such as that created by the program DSSP) to produce a synthesis of both sequence and structural information. RESULTS: ESPript can be run via a command file or a friendly html-based user interface. The program calculates an homology score by columns of residues and can sort this calculation by groups of sequences. It offers a palette of markers to highlight important regions in the alignment. ESPript can also paste information on residue conservation into coordinate files, for subsequent visualization with a graphics program. AVAILABILITY: ESPript can be accessed on its Web site at http://www.ipbs.fr/ESPript. Sources and helpfiles can be downloaded via anonymous ftp from ftp.ipbs.fr. A tar file is held in the directory pub/ESPript.     

Two-dimensional graphic analysis of DNA sequence homologies.

We describe a computer program designed to facilitate the pattern matching analysis of homologies between DNA sequences. It takes advantage of a two-dimensional plot in order to simplify the evaluation of significant structures inherited in the sequences. The program can be divided into three parts, i) algorithm for search of homologies, ii) two-dimensional graphic display of the result, iii) further graphic treatment to enhance significant structures. The power of the graphic display is presented by the following application of the program. We conducted a search for direct repeats in the mouse immunoglobulin kappa-chain genes. Both the five J DNA sequences and other shorter repeats were found. We also found a longer stretch of homology that could indicate the presence of duplicated DNA in the J4, J5 region.     

MATCH-UP/MATRIX: a microcomputer program designed to search for protein primary structure homology

MATCH-UP/MATRIX is a program designed to aid the investigatorinterested in determining primary protein structure. It is writtenin Applesoft BASIC for the Apple lle microcomputer. MATCH-UPwill survey any set of proteinaceous materials for amino acidsequence homology; however, it is primarily intended to comparethe structures of newly sequenced peptides with the establishedstructure of a protein with suspected homology. Any peptide-to-proteinalignment which shows a homology greater than or equal to thepercentage specified by the user will result in output. MATRIXwill compare the sequences of two proteins (peptides) in whateveralignment specified by the user and is intended to spot insertionsand/or deletions between structures. Received on December 2, 1985; accepted on March 10, 1986     

Mouse glandular kallikrein genes. Nucleotide sequence of cloned cDNA coding for a member of the kallikrein arginyl esteropeptidase group of serine proteases

A library of cloned cDNA to male mouse submaxillary gland poly(A)-containing RNA was constructed in the plasmid pBR322. Inserts containing sequences estimated to be in the 1-5% abundance class were identified by hybridization to radiolabeled cDNA and examined by nucleotide sequence analysis. A sequence coding for a peptide with 57% homology to the only complete kallikrein sequence reported to date (from pig pancreas) was identified by a computer search program. This insert appears to code for the COOH-terminal 149 amino acids of a protein presumed therefore to be a serine protease. Comparison of the predicted amino acid sequence of this protein with analogous sequences in the three characterized members of the mouse submaxillary gland kallikrein arginyl esteropeptidase group of enzymes revealed extensive homology, although not complete identity. Thus, there are at least four members of this enzyme family expressed in the mouse submaxillary gland.     

DbW: automatic update of a functional family-specific multiple alignment

MOTIVATION: Recent advances in gene sequencing have provided complete sequence information for a number of genomes and as a result the amount of data in the sequence databases is growing at an exponential rate. We introduce here a new program, DbW, to automate the update of a functional family-specific multiple alignment that tries to include relevant sequences. The program is based on the use of different sources of information: sequences and annotations in databases. RESULTS: The advantages of DbW are demonstrated using the 20 families of aminoacyl-tRNA synthetases, where DbW detects a maximum of homologous sequences in the Swiss-Prot and SPTREMBL databases. The global specificity of DbW in this test is 98.4% (1.6% of the sequences included in the alignment did not belong to the family according to their function), and the global sensitivity of DbW is estimated to be 95.2%. Thus, DbW provides a reliable basis for the many applications that rely on accurate multiple alignments, e.g. functional residue identification, 2D/3D structure prediction or homology modeling. AVAILABILITY: The DbW software is available for download at ftp://ftp-igbmc.u-strasbg.fr/pub/DbW/DbW.tar and online at http://titus.u-strasbg.fr/DbW CONTACT: prigent@igbmc.u-strasbg.fr.     

Membrane profile-based probabilistic method for predicting transmembrane segments via multiple protein sequence alignment

Prediction of transmembrane (TM) segments of amino acid sequences of membrane proteins is a well-known and very important problem. The accuracy of its solution can be improved for approaches that do not use a homology search in an additional data bank. There is a lack of tested data in this area of research, because information on the structure of membrane proteins is scarce. In this work we created a test sample of structural alignments for membrane proteins. The TM segments of these proteins were mapped according to aligned 3D structures resolved for these proteins. A method for predicting TM segments in an alignment was developed on the basis of the forward-backward algorithm from the HMM theory. This method allows a user not only to predict TM segments, but also to create a probabilistic membrane profile, which can be employed in multiple alignment procedures taking the secondary structure of proteins into account. The method was implemented in a computer program available at http://bioinf.fbb.msu.ru/fwdbck/. It provides better results than the MEMSAT method, which is nearly the only tool predicting TM segments in multiple alignments, without a homology search.     

GTOP: a database of protein structures predicted from genome sequences

Large-scale genome projects generate an unprecedented number of protein sequences, most of them are experimentally uncharacterized. Predicting the 3D structures of sequences provides important clues as to their functions. We constructed the Genomes TO Protein structures and functions (GTOP) database, containing protein fold predictions of a huge number of sequences. Predictions are mainly carried out with the homology search program PSI-BLAST, currently the most popular among high-sensitivity profile search methods. GTOP also includes the results of other analyses, e.g. homology and motif search, detection of transmembrane helices and repetitive sequences. We have completed analyzing the sequences of 41 organisms, with the number of proteins exceeding 120 000 in total. GTOP uses a graphical viewer to present the analytical results of each ORF in one page in a ‘color-bar’ format. The assigned 3D structures are presented by Chime plug-in or RasMol. The binding sites of ligands are also included, providing functional information. The GTOP server is available at http://spock.genes.nig.ac.jp/~genome/gtop.html.