<tt>BLAT</tt>—The <tt>BLAST</tt>-Like Alignment Tool
Genome ResearchPublished 20 March 2002Open access
W. James Kent
Citations8,421
SJR quartileQ1
SJR score3.91
SNIP1.37
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
How BLAT was optimized is described, which is more accurate and 500 times faster than popular existing tools for mRNA/DNA alignments and 50 times faster for protein alignments at sensitivity settings typically used when comparing vertebrate sequences.
Abstract
Analyzing vertebrate genomes requires rapid mRNA/DNA and cross-species protein alignments. A new tool, BLAT, is more accurate and 500 times faster than popular existing tools for mRNA/DNA alignments and 50 times faster for protein alignments at sensitivity settings typically used when comparing vertebrate sequences. BLAT's speed stems from an index of all nonoverlapping K-mers in the genome. This index fits inside the RAM of inexpensive computers, and need only be computed once for each genome assembly. BLAT has several major stages. It uses the index to find regions in the genome likely to be homologous to the query sequence. It performs an alignment between homologous regions. It stitches together these aligned regions (often exons) into larger alignments (typically genes). Finally, BLAT revisits small internal exons possibly missed at the first stage and adjusts large gap boundaries that have canonical splice sites where feasible. This paper describes how BLAT was optimized. Effects on speed and sensitivity are explored for various K-mer sizes, mismatch schemes, and number of required index matches. BLAT is compared with other alignment programs on various test sets and then used in several genome-wide applications. http://genome.ucsc.edu hosts a web-based BLAT server for the human genome.
Keywords
Biochemistry, Genetics and Molecular Biology
Journal of Molecular BiologyBasic local alignment search tool
94,539 Citations1990Stephen F. Altschul, Warren Gish +3 more
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.
Nucleic Acids ResearchGapped BLAST and PSI-BLAST: a new generation of protein database search programs
74,499 Citations1997Stephen F. Altschul
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.
NatureInitial sequencing and analysis of the human genome
24,579 Citations2001Eric S. Lander, Lauren Linton +250 more
The results of an international collaboration to produce and make freely available a draft sequence of the human genome are reported and an initial analysis is presented, describing some of the insights that can be gleaned from the sequence.
Proceedings of the National Academy of SciencesImproved tools for biological sequence comparison.
11,334 Citations1988William R. Pearson, David J. Lipman
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.
Journal of Molecular BiologyIdentification of common molecular subsequences
10,081 Citations1981Temple F. Smith, Michael S. Waterman
This letter extends the heuristic homology algorithm of Needleman & Wunsch (1970) to find a pair of segments, one from each of two long sequences, such that there is no other Pair of segments with greater similarity (homology).
Journal of Computational BiologyA Greedy Algorithm for Aligning DNA Sequences
5,505 Citations2000Zheng Zhang, Scott Schwartz +2 more
A new greedy alignment algorithm is introduced with particularly good performance and it is shown that it computes the same alignment as does a certain dynamic programming algorithm, while executing over 10 times faster on appropriate data.
Nature GeneticsIdentification of protein coding regions by database similarity search
1,688 Citations1993Warren Gish, David J. States
The computer program BLASTX performed conceptual translation of a nucleotide query sequence followed by a protein database search in one programmatic step and was characterized as appropriate for use in moderate and large scale sequencing projects at the earliest opportunity, when the data are most prone to containing errors.
NatureThe DNA sequence of human chromosome 21
1,476 Citations2000Masahira Hattori, Asao Fujiyama +61 more
The sequence and gene catalogue of the long arm of chromosome 21, the smallest human autosome, is reported, and structural features identified include duplications that are probably involved in chromosomal abnormalities and repeat structures in the telomeric and pericentromeric regions.
NatureThe DNA sequence of human chromosome 22
1,162 Citations1999Ian Dunham, Adrienne Hunt +215 more
The sequence of the euchromatic part of human chromosome 22 is reported, which consists of 12 contiguous segments spanning 33.4 megabases, contains at least 545 genes and 134 pseudogenes, and provides the first view of the complex chromosomal landscapes that will be found in the rest of the genome.
BioinformaticsHidden Markov models for detecting remote protein homologies.
1,111 Citations1998Kevin Karplus, Curtis L. Barrett +1 more
A new hidden Markov model method (SAM-T98) for finding remote homologs of protein sequences is described and evaluated, which is optimized to recognize superfamilies, and would require parameter adjustment to be used to find family or fold relationships.
Genome ResearchSSAHA: A Fast Search Method for Large DNA Databases
971 Citations2001Zemin Ning, Anthony J. Cox +1 more
The results of computational experiments are presented which show that SSAHA can be three to four orders of magnitude faster than BLAST or FASTA, while requiring less memory than suffix tree methods.
Genome ResearchA Computer Program for Aligning a cDNA Sequence with a Genomic DNA Sequence
728 Citations1998Liliana Florea, George Hartzell +3 more
A freely available computer program solves the problem of efficiently aligning a transcribed and spliced DNA sequence with a genomic sequence containing that gene, allowing for introns in the genomic sequence and a relatively small number of sequencing errors.
Proceedings of the National Academy of SciencesEvolutionary parameters of the transcribed mammalian genome: An analysis of 2,820 orthologous rodent and human sequences
469 Citations1998Wojciech Makałowski, Mark S. Boguski
It is indicated that mammalian genes are evolving 17-30% more slowly than previous textbook values, and the results have practical applications in the interpretation of noncoding sequence conservation between syntenic regions of human and mouse genomic sequence, and in the design and calibration of gene expression arrays.
Nature GeneticsEstimate of human gene number provided by genome-wide analysis using Tetraodon nigroviridis DNA sequence
317 Citations2000Hugues Roest Crollius, Olivier Jaillon +10 more
Application of ‘Exofish’, a procedure based on homology searches, to identify human genes quickly and reliably, showed that the human genome contains 28,000–34,000 genes, and that Unigene contains less than 40% of the protein-coding fraction of thehuman genome.
Computer applications in the biosciencesEST_GENOME: a program to align spliced DNA sequences to unspliced genomic DNA
276 Citations1997Richard Mott
The program EST_GENOME, used routinely at the Sanger Centre to help annotate human genomic sequence, allows large introns, can recognize splice sites and uses limited memory, which makes it a powerful and useful tool.
Computer applications in the biosciencesAligning two sequences within a specified diagonal band
165 Citations1992Kun‐Mao Chao, William R. Pearson +1 more
An algorithm for aligning two sequences within a diagonal band that requires only O(NW) computation time and O(N) space is described, which allows longer sequences to be aligned and allows optimization within wider bands, which can include longer gaps.
Journal of Computational BiologyQGB: Combined Use of Sequence Similarity and Codon Bias for Coding Region Identification
149 Citations1994David J. States, Warren Gish
The sensitivity of a new option to this software tool, herein called BLASTC, which employs information obtained from biases in codon utilization, along with theInformation obtained from sequence similarity, is presented and assessed.
Genome ResearchSGP-1: Prediction and Validation of Homologous Genes Based on Sequence Alignments
106 Citations2001Thomas Wiehe, Steffi Gebauer-Jung +2 more
A program for the prediction of protein-coding genes, termed SGP-1 (Syntenic Gene Prediction), which is based on the similarity of homologous genomic sequences, which may be applied to nonstandard model organisms in vertebrates as well as in plants, without the need for extensive parameter training.
Nucleic Acids ResearchThe Intronerator: exploring introns and alternative splicing in Caenorhabditis elegans
90 Citations2000W. James Kent
The Intronerator is a set of web-based tools for exploring RNA splicing and gene structure in Caenorhabditis elegans that includes a display of cDNA alignments with the genomic sequence, a catalog of alternatively spliced genes and a database of introns.
Bulletin of Mathematical BiologyOptimal sequence alignment allowing for long gaps
90 Citations1990Osamu Gotoh
A new algorithm for optimal sequence alignment allowing for long insertions and deletions is developed, and it is modified so that it finds all and only the optimal alignments in a compact form of a directed graph.
Bulletin of Mathematical BiologyOptimal sequence alignment allowing for long gaps
81 Citations1990Osamu Gotoh
A new algorithm for optimal sequence alignment allowing for long insertions and deletions is developed and modified so that it finds all and and only the optimal alignments in a compact form of a directed graph.
BioinformaticsHomology-based gene structure prediction: simplified matching algorithm using a translated codon (tron) and improved accuracy by allowing for long gaps
68 Citations2000Osamu Gotoh
A new convention for encoding a DNA sequence into a series of 23 possible letters (translated codon or tron code) was devised to improve this type of analysis and a dynamic programming algorithm was developed to align a sequence and a protein sequence or profile so that the spliced and translated sequence optimally matches the reference the same as the standard protein sequence alignment allowing for long gaps.