Note: BLAT search is not available for hub_24769_Honey bee A. mellifera (amel4.5); defaulting to Human Jan. 2022 (T2T CHM13v2.0/hs1)
BLAT on DNA is designed to
quickly find sequences of 95% and greater similarity of length 25 bases or
more. It may miss more divergent or shorter sequence alignments. It will find
perfect sequence matches of 20 bases.
BLAT on proteins finds sequences of 80% and greater similarity of length 20 amino
acids or more. In practice DNA BLAT works well on primates, and protein
BLAT on land vertebrates.
BLAT is not BLAST. DNA BLAT works by keeping an index of the entire genome
in memory. The index consists of all overlapping 11-mers stepping by 5 except for
those heavily involved in repeats. The index takes up about
2 gigabytes of RAM. RAM can be further reduced to less than 1 GB by increasing step size to 11.
The genome itself is not kept in memory, allowing
BLAT to deliver high performance on a reasonably priced Linux box.
The index is used to find areas of probable homology, which are then
loaded into memory for a detailed alignment. Protein BLAT works in a similar
manner, except with 4-mers rather than 11-mers. The protein index takes a little
more than 2 gigabytes.
BLAT was written by Jim Kent.
Like most of Jim's software, interactive use on this web server is free to all.
Sources and executables to run batch jobs on your own server are available free
for academic, personal, and non-profit purposes. Non-exclusive commercial
licenses are also available. See the
website for details.
For more information on the graphical version of BLAT, click the Help
button on the top menu bar or see the Genome Browser FAQ.