Basic local alignment search tool.

@article{Altschul1990BasicLA,
  title={Basic local alignment search tool.},
  author={Stephen F. Altschul and Warren Gish and Webb Miller and Eugene W. Myers and David J. Lipman},
  journal={Journal of molecular biology},
  year={1990},
  volume={215 3},
  pages={
          403-10
        }
}
A new approach to rapid sequence comparison, basic local alignment search tool (BLAST), directly approximates alignments that optimize a measure of local similarity, the maximal segment pair (MSP) score. Recent mathematical results on the stochastic properties of MSP scores allow an analysis of the performance of this method as well as the statistical significance of alignments it generates. The basic algorithm is simple and robust; it can be implemented in a number of ways and applied in a… Expand
MulBlast 1.0: a multiple alignment of BLAST output to boost protein sequence similarity analysis
  • G. Labesse
  • Biology, Medicine
  • Comput. Appl. Biosci.
  • 1996
TLDR
A program which makes a multiple alignment from the BLAST search output which allows at a glance a rapid identification of significant similarities, protein family signature and new sequence motifs. Expand
CentroidBLAST: Accelerating Sequence Search via Clustering
TLDR
This paper presents the approach for more ecient sequence search, which is dubbed CentroidBLAST, and describes how this approach works on a large database of DNA or amino-acid sequences. Expand
Finding Homologs to Nucleotide Sequences Using Network BLAST Searches
  • I. Ladunga
  • Biology, Medicine
  • Current protocols in bioinformatics
  • 2002
TLDR
The unit details how to fine tune the arguments of the programs, allowing the user to take advantage of frequently overlooked capabilities of the BLAST tool. Expand
Local alignment statistics.
Publisher Summary This chapter discusses the study of local alignment statistics, the distribution of optimal gapped subalignment scores, and the evidence that two parameters are sufficient toExpand
Serial BLAST searching
  • I. Korf
  • Biology, Computer Science
  • Bioinform.
  • 2003
TLDR
Serial BLAST searches improve both the speed and sensitivity of translating BLAST algorithms by using a fast, insensitive search to pre-screen a database for similar sequences, and a slow, sensitive search to produce the sequence alignments. Expand
A Local Alignment Metric for Accelerating Biosequence Database Search
TLDR
It is proved the existence of the metric for a variety of scoring systems, including the most commonly used ones, and it is shown that a triangle inequality can be established as well for nucleotide-to-protein sequence comparisons. Expand
Sequence Similarity Searching Using the BLAST Family of Programs
TLDR
This unit describes the BLAST (Basic Local Alignment Search Tool) family of sequence similarity search programs, compares basic and advanced searches, discusses theBLAST algorithm, and presents the variety of databases that can be searched. Expand
Finding Homologs in Amino Acid Sequences Using Network BLAST Searches
  • I. Ladunga
  • Computer Science, Medicine
  • Current protocols in bioinformatics
  • 2003
TLDR
The purpose of this unit is not only to show how to run searches on the Web, but also to demonstrate how to fine‐tune arguments for a specific research project. Expand
A New, Space-Efficient Local Pairwise Alignment Methodology
Aligning large nucleotide sequences requires significant portion of the memory, what in some cases is found as a limiting factor. Local pairwise alignment methods require ) (m O space, most of themExpand
Accelarating Sequence Alignments with the use of Suffix Trees
Sequence alignment is by far the most common task in Bioinformatics. Procedures relying on sequence comparison are diverse and range from database searches to secondary structure prediction. BLASTExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 60 REFERENCES
Improved tools for biological sequence comparison.
  • W. Pearson, D. Lipman
  • Biology, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 1988
TLDR
Three computer programs for comparisons of protein and DNA sequences can be used to search sequence data bases, evaluate similarity scores, and identify periodic structures based on local sequence similarity. Expand
Rapid and sensitive protein similarity searches.
TLDR
An algorithm was developed which facilitates the search for similarities between newly determined amino acid sequences and sequences already available in databases and increases sensitivity by giving high scores to those amino acid replacements which occur frequently in evolution. Expand
Automatic generation of primary sequence patterns from sets of related protein sequences.
  • R. Smith, T. Smith
  • Mathematics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 1990
TLDR
A computer algorithm is developed that can extract the pattern of conserved primary sequence elements common to all members of a homologous protein family through clustering the pairwise similarity scores among a set of related sequences. Expand
A general method applicable to the search for similarities in the amino acid sequence of two proteins.
TLDR
A computer adaptable method for finding similarities in the amino acid sequences of two proteins has been developed and it is possible to determine whether significant homology exists between the proteins to trace their possible evolutionary development. Expand
Sequence search on a supercomputer
TLDR
A set of programs was developed for searching nucleic acid and protein sequence data bases for sequences similar to a given sequence using FORTRAN 77, optimized for vector processing on a Hitachi S810-20 supercomputer. Expand
Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.
  • S. Karlin, S. Altschul
  • Biology, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 1990
TLDR
Using an appropriate random model, this work presents a theory that provides precise numerical formulas for assessing the statistical significance of any region with high aggregate score and examples are given of applications to a variety of protein sequences, highlighting segments with unusual biological features. Expand
Pattern recognition in genetic sequences by mismatch density
A new development is introduced here in the use of dynamic programming in finding pattern similarities in genetic sequences, as was first done by Needleman and Wunsch (1969). A condition of patternExpand
Pattern recognition in nucleic acid sequences. I. A general method for finding local homologies and symmetries
TLDR
An algorithm is presented--a generalization of the Needleman-Wunsch-Sellers algorithm--which finds within longer sequences all subsequences that resemble one another locally locally. Expand
Comparison of biosequences
Homology and distance measures have been routinely used to compare two biological sequences, such as proteins or nucleic acids. The homology measure of Needleman and Wunsch is shown, under generalExpand
Protein and Nucleic Acid Sequence Database Searching: A Suitable Case for Parallel processing
TLDR
An improved method of assessing the significance of the best alignments for proteins is described, and examples involving the cystic fibrosis antigen and Drosophila vitellogenins illustrate the usefulness of this approach. Expand
...
1
2
3
4
5
...