Table of Contents
NetBLAST searches for sequences similar to a
query sequence. The query and the database searched can be either peptide or
nucleic acid in any combination. NetBLAST can search only databases maintained
BLAST, or Basic Local Alignment Search Tool, uses the method of Altschul et al. (J. Mol. Biol. 215; 403-410 (1990)) to search for similarities between a query sequence and all the sequences in a database. The query sequence and the database you want to search can be either protein or nucleic acid in any combination.
Accelrys GCG (GCG) NetBLAST program is an interface to the BLAST service provided by NCBI's web server at www.ncbi.nlm.nih.gov, or by their email server email@example.com.
At the time this document was written, the server at NCBI was offering version 2 of BLAST, which is described in Altschul et al. (Nucleic Acids Res. 25(17): 3389-3402 (1997)). BLAST2 is known as "gapped BLAST" because it generates gapped alignments between query and database sequences. It also runs three times as fast as the original BLAST.
NetBLAST supports five different programs in the BLAST family:
BLASTP, Protein Query Searching a Protein Database
Each database sequence is compared to the query in a separate protein-protein pairwise comparison.
BLASTX, Nucleotide Query Searching a Protein Database
The query is translated, and each of the six products is compared to each database sequence in a separate protein-protein pairwise comparison.
BLASTN, Nucleotide Query Searching a Nucleotide Database
Each database sequence is compared to the query in a separate nucleotide-nucleotide pairwise comparison.
TBLASTN, Protein Query Searching a Nucleotide Database
Each nucleotide database sequence is translated, and each of the six products is compared to the query in a separate protein-protein pairwise comparison.
TBLASTX, Nucleotide Query Searching a Nucleotide Database
The query and each database sequence are both translated in six frames, and each of the 12 products is compared in 36 different pairwise comparisons. Because this program involves more computation than the others, the BLAST server at NCBI will not accept requests for searches of the Non-redundant (nr) database.
Normally, NetBLAST decides which BLAST program you want to use simply by looking at the type (protein or nucleic acid) of your query sequence and the database you have selected. In the case of nucleotide-nucleotide searches, there are two programs that can do the search. By default, BLASTN is used. To search using TBLASTX instead, use the -TBLASTX parameter.
NetBLAST can only search remote databases maintained by NCBI. Remote searches require almost no resources from your own computer. More importantly, the databases at NCBI are updated daily. Keep in mind, however, that using NetBLAST is a security risk if your sequence data are confidential.
BLAST is a statistically driven search method that finds regions of similarity between your query and database sequences and produces gapped alignments of these regions. Within these aligned regions, the sum of the scoring matrix values of their constituent symbol pairs is higher than some level that you would expect to occur by chance alone.
NetBLAST prompts you to set an expectation level for the entire search. By default this level is 10.0, which means that hits are reported only if they have a score that would be expected to occur purely by chance no more than 10 times in this particular search.
Here is a session using NetBLAST to find the sequences in the Non-redundant Protein database with similarities to a zein gene:
NetBLAST search with what query sequence ? PIR:zizm99
NETBLAST searches for sequences similar to a query sequence. The query and the
database searched can be either peptide or nucleic acid in any combination.
NETBLAST can search only databases maintained at the National Center for
Biotechnology Information (NCBI) in Bethesda, Maryland, USA.
Search for query in what sequence database:
1) nr p Non-redundant GenBank CDS translations+PDB+SwissProt+PIR
2) pdb p PDB protein sequences
3) swissprot p SwissProt sequences
4) yeast p Saccharomyces cerevisiae protein sequences
5) kabat p Kabat Sequences of Proteins of Immunological Interest
6) alu p Translations of Select Alu Repeats from REPBASE
7) month p All new or revised GenBank CDS translation+PDB+SwissProt+PI
8) ecoli p E. coli genomic CDS translations
9) nr n Non-redundant GenBank+EMBL+DDBJ+PDB sequences (but no EST's
10) pdb n PDB nucleotide sequences
11) vector n Vector subset of GenBank
12) yeast n Saccharomyces cerevisiae genomic nucleotide sequences
13) est n Non-redundant Database of GenBank+EMBL+DDBJ EST Division
14) sts n Non-redundant Database of GenBank+EMBL+DDBJ STS Division
15) htgs n High Throughput Genomic Sequences
16) mito n Database of mitochondrial sequences, Rel. 1.0, July 1995
17) kabat n Kabat Sequences of Nucleic Acid of Immunological Interest
18) epd n Eukaryotic Promotor Database
19) alu n Select Alu Repeats from REPBASE
20) month n All new or revised GenBank+EMBL+DDBJ+PDB sequences released
21) gss n Genome Survey Sequence, includes singlepass genomic data,
22) ecoli n E. coli genomic nucleotide sequences.
Please choose one (* 1 *):
Ignore hits expected to occur by chance more than (* 10.0 *) times?
Limit the number of sequences in my output to (* 250 *) ? 25
What should I call the output file (* zizm99.netblastp *) ?
Done. Wrote search results to zizm99.netblastp
Below is part of the output from the search in the example session:
The output has four parts: 1) an introduction that tells where the search occurred and what database and query were compared; 2) a list of the sequences in the database containing HSPs (high-scoring segment pairs) whose scores were least likely to have occurred by chance; 3) a display of the alignments of the HSPs showing identical and similar residues; and 4) a list of the parameter settings used for the search.
By default, NetBLAST looks for alignments that contain gaps. If you look only for alignments that do not contain gaps, there will often be more than one segment pair associated with each database sequence.
The query sequence for this search has been filtered. Filtering
eliminates low complexity regions that commonly give spuriously high
scores that reflect compositional bias rather than significant
position-by-position alignment. Filtering can eliminate these potentially
confounding matches (e.g., hits against proline-rich regions or poly-A
tails) from the blast reports, leaving regions whose blast statistics
reflect the specificity of their pairwise alignment.
BLASTP 2.0.11 [Jan-20-20000]
Reference: Altschul, Stephen F., Thomas L. Madden, Alejandro A. Schaffer,
Jinghui Zhang, Zheng Zhang, Webb Miller, and David J. Lipman (1997),
"Gapped BLAST and PSI-BLAST: a new generation of protein database search
programs", Nucleic Acids Res. 25:3389-3402.
Query= pir1:zizm99 19K zein precursor (clone ZG99) - maize
Database: Non-redundant GenBank CDS
453,530 sequences; 139,661,590 total letters
Sequences producing significant alignments: (bits) Value
sp|P04704|ZEA2_MAIZE ZEIN-ALPHA PRECURSOR (19 KD) (CLONE ZG99) >... 302
sp|P24449|ZEAC_MAIZE ZEIN-ALPHA PRECURSOR (19 KD) (PMS1) >gi|100... 282
pir||S07172 19K zein precursor (clone Z4) - maize >gi|4388702|em... 281
prf||1107201G zein M6 [Zea mays] 189 2e-47
sp|P04705|ZEAB_MAIZE ZEIN-ALPHA PRECURSOR (19 KD) (CLONE PZ19.1)... 179 2e-44
gi|168697 (M60835) zein [Zea mays] 174 6e-43
>sp|P04704|ZEA2_MAIZE ZEIN-ALPHA PRECURSOR (19 KD) (CLONE ZG99)
zein precursor (clone ZG99) - maize
>gi|22519|emb|CAA24717| (V01470) zein [Zea mays]
>gi|22534|emb|CAA24726| (V01479) zein [Zea mays]
Length = 235
Score = 302 bits (764), Expect = 3e-81
Identities = 161/235 (68%), Positives = 161/235 (68%)
Query: 1 MAAKIFCLIMXXXXXXXXXXXXIFPQCSQAPIASLLPPYLSPAMSSVCENPILLPYRIQQ 60
Sbjct: 1 MAAKIFCLIMLLGLSASAATASIFPQCSQAPIASLLPPYLSPAMSSVCENPILLPYRIQQ 60
Query: 61 AIAAGIXXXXXXXXXXXXXXXXXXXXXXXXXXNIRXXXXXXXXXXXXXXYSQQQQFLPFN 120
AIAAGI NIR YSQQQQFLPFN
Sbjct: 61 AIAAGILPLSPLFLQQSSALLQQLPLVHLLAQNIRAQQLQQLVLANLAAYSQQQQFLPFN 120
Query: 121 QLAALNSAAYXXXXXXXPFSQLAAAYPRQFLPFNQLAALNSHAYVQQQQLLPFSQLAAVS 180
Sbjct: 121 QLAALNSAAYLQQQQLLPFSQLAAAYPRQFLPFNQLAALNSHAYVQQQQLLPFSQLAAVS 180
Query: 181 PAAFLTQQQLLPFYLHTAPNVGTXXXXXXXXXXXXXXXTNPAAFYQQPIIGGALF 235
Sbjct: 181 PAAFLTQQQLLPFYLHTAPNVGTLLQLQQLLPFDQLALTNPAAFYQQPIIGGALF 235
>pir||S20853 glutenin low molecular weight chain precursor - durum wheat
(fragment) >gi|21930|emb|CAA44473| (X62588) LMW glutenin
Length = 285
Score = 31.3 bits (69), Expect = 8.0
Identities = 30/83 (36%), Positives = 36/83 (43%), Gaps = 6/83 (7%)
Query: 110 YSQQQQFLPFNQLAALNSAAYXXXXXXXPFSQLAAAYPRQFLPFNQLAALNSHAYVQQQQ 169
+SQQQQ PF Q + S PF Q Q PF+Q L QQQQ
Sbjct: 50 FSQQQQQQPFPQQPSF-SQQQPILPQGPPFPQQTQPVLPQQSPFSQQQQLILPP--QQQQ 106
Query: 170 LLPFSQLAAVSPAAFLTQQQLLP 192
LP Q++ V P+ QQL P
Sbjct: 107 QLPQQQISIVQPSVL---QQLNP 126
Database: Non-redundant GenBank CDS
Posted date: Feb 7, 2000
Number of letters in database: 139,661,590
Number of sequences in database: 453,530
Lambda K H
0.326 0.136 0.00
Lambda K H
0.270 0.0470 4.94e-324
Gap Penalties: Existence: 11, Extension: 1
Number of Hits to DB: 39173302
Number of Sequences: 453530
Number of extensions: 1017006
Number of successful extensions: 3526
Number of sequences better than 10.0: 69
Number of HSP's better than 10.0 without gapping: 65
Number of HSP's successfully gapped in prelim test: 5
Number of HSP's that attempted gapping in prelim test: 2388
Number of HSP's gapped (non-prelim): 231
length of query: 235
length of database: 139,661,590
effective HSP length: 53
effective length of query: 182
effective length of database: 115,624,500
effective search space: 21043659000
effective search space used: 21043659000
X1: 15 ( 7.0 bits)
X2: 38 (14.8 bits)
X3: 64 (24.9 bits)
S1: 40 (21.7 bits)
S2: 69 (31.3 bits)
Each aligned segment pair has a normalized score expressed in bits that lets you estimate the magnitude of the search space you would have to look through before you would expect to find an HSP score as good as or better than this one by chance. If the bit score is 30, you would have to score, on average, about 1 billion independent segment pairs (2(30)) to find a score this good by chance. Each additional bit doubles the size of the search space. This bit score represents a probability; one over two raised to this power is the probability of finding such a segment by chance. Bit scores represent a probability level for sequence comparisons that is independent of the size of the search.
The size of the search space is proportional to the product of the query sequence length times the sum of the lengths of the sequences in the database. This product, referred to as N in Altschul's publications, is multiplied by a coefficient K to get the size of the search space. When searching protein databases with protein queries, K is about 0.13. NetBLAST uses estimates of K produced before it runs by random simulation (Altschul & Gish, Methods in Enzymology 266; 460-480 (1996)).
There is a probability associated with each pairwise comparison in the list and with each segment pair alignment. The number shown in the list is the probability that you would observe a score or group of scores as high as the observed score purely by chance when you do a search against a database of this size.
An ideal search would find hits that go from extremely unlikely to ones whose best scores should have occurred by chance alone (that is, with probabilities approaching 1.0).
If you specify ungapped alignments to NetBLAST, a third column of data will appear in your output under the heading N. The number in that column indicates how many HSPs were involved in computing the statistics for the sequence. If the number is greater than 1, the scores of multiple HSPs were combined to produce the result. See the ALGORITHM topic for more information.
At the end of the output is a listing of parameter settings along with some trace information about the search.
NetBLAST accepts a single protein sequence or a single nucleic acid sequence as the query sequence. The function of NetBLAST depends on whether your input sequence is protein or nucleotide. Programs determine the type of a sequence by the presence of either Type: N or Type: P on the last line of the text heading just above the sequence. If your sequence is not the correct type, turn to Appendix VI for information on how to change or set the type of a sequence.
NetBLAST+ searches for sequences similar to a query
sequence. The query and the database searched can be either peptide or nucleic
acid in any combination. NetBLAST+ can search only databases maintained at the
NetFetch retrieves sequences from NCBI listed in a NetBLAST output file. You can also use it to retrieve sequences individually by sequence name or accession number. The output of NetFetch is an RSF file.
FastA does a Pearson and Lipman search for similarity between a query sequence and a group of sequences of the same type (nucleic acid or protein). For nucleotide searches, FastA may be more sensitive than BLAST.
TFastA does a Pearson and Lipman search for similarity between a protein query sequence and any group of nucleotide sequences. TFastA translates the nucleotide sequences in all six reading frames before performing the comparison. It is designed to answer the question, "What implied protein sequences in a nucleotide sequence database are similar to my protein sequence?"
FastX does a Pearson and Lipman search for similarity between a nucleotide query sequence and a group of protein sequences, taking frameshifts into account. FastX translates both strands of the nucleic sequence before performing the comparison. It is designed to answer the question, "What implied protein sequences in my nucleic acid sequence are similar to sequences in a protein database?"
TFastX does a Pearson and Lipman search for similarity between a protein query sequence and any group of nucleotide sequences, taking frameshifts into account. It is designed to be a replacement for TFastA, and like TFastA, it is designed to answer the question, "What implied protein sequences in a nucleotide sequence database are similar to my protein sequence?"
SSearch does a rigorous Smith-Waterman search for similarity between a query sequence and a group of sequences of the same type (nucleic acid or protein). This may be the most sensitive method available for similarity searches. Compared to BLAST and FastA, it can be very slow.
ProfileSearch uses a profile (representing a group of aligned sequences) as a query to search the database for new sequences with similarity to the group. The profile is created with the program ProfileMake. MotifSearch uses a set of profiles (representing similarities within a family of sequences) as a query to either a) search a database for new sequences similar to the original family, or b) annotate the members of the the original family with details of the matches between the profiles and each of the members. Normally, the profiles are created with the program MEME.
FrameSearch searches a group of protein sequences for similarity to one or more nucleotide query sequences, or searches a group of nucleotide sequences for similarity to one or more protein query sequences. For each sequence comparison, the program finds an optimal alignment between the protein sequence and all possible codons on each strand of the nucleotide sequence. Optimal alignments may include reading frame shifts.
BLAST+ searches one or more nucleic acid or protein databases for sequences similar to one or more query sequences of any type. BLAST+ can produce gapped alignments for the matches it finds.
NetFetch+ retrieves sequences from NCBI listed in a NetBLAST output file. You can also use it to retrieve sequences individually by sequence name or accession number. The output of NetFetch+ is an RSF file.
FastA+ does a Pearson and Lipman search for similarity between a query sequence and a group of sequences of the same type (nucleic acid or protein). For nucleotide searches, FastA+ may be more sensitive than BLAST+.
TFastA+ does a Pearson and Lipman search for similarity between a protein query sequence and any group of nucleotide sequences. TFastA+ translates the nucleotide sequences in all six reading frames before performing the comparison. It is designed to answer the question, "What implied protein sequences in a nucleotide sequence database are similar to my protein sequence?"
FastX+ does a Pearson and Lipman search for similarity between a nucleotide query sequence and a group of protein sequences, taking frameshifts into account. FastX translates both strands of the nucleic sequence before performing the comparison. It is designed to answer the question, "What implied protein sequences in my nucleic acid sequence are similar to sequences in a protein database?"
TFastX+ does a Pearson and Lipman search for similarity between a protein query sequence and any group of nucleotide sequences, taking frameshifts into account. It is designed to be a replacement for TFastA+, and like TFastA+, it is designed to answer the question, "What implied protein sequences in a nucleotide sequence database are similar to my protein sequence?"
Searching remote databases opens up the possibility of unauthorized access to your query sequence. You should not use confidential query sequences for remote searches.
NetBLAST does not accept a conventional GCG sequence specification for the search set. You can search only databases known to NetBLAST, maintained at NCBI, and each only in its entirety. You cannot restrict the range of the sequence used as the query.
You cannot select a list size or expectation threshold of more than 1,000. The output file can be quite large. If you run out of disk space you may have to delete one or more files before you can continue working.
Because of the way NetBLAST must estimate certain statistical parameters (see the ALGORITHM topic in this document), the number of scoring matrices available for use with NetBLAST is limited. Currently, valid choices for the -MATRix parameter are BLOSUM62 (the default), BLOSUM45, BLOSUM80, PAM30, and PAM70.
Gap creation and gap extension penalties are supported in limited combinations depending upon which scoring matrix is in use. Specifying invalid gap penalties will cause the server to run the search using the default scoring matrix, BLOSUM62, with its default gap creation and extension penalties (11 and 1, respectively). The following table shows the allowed combinations for amino acids. The first values listed are the defaults for each scoring matrix.
Scoring Matrix Gap Opening Penalty Gap Extension Penalty
BLOSUM62 11 1
BLOSUM80 10 1
BLOSUM45 14 2
PAM30 9 1
PAM70 10 1
BLASTN accepts positive integers for gap penalties, with default values of 5 and 2 for Gap Opening and Extension, repectively. If you specify an unacceptable value for either of these penalties, the corresponding default value is used.
Gapped alignments are not an option when running TBLASTX.
To name a searchable database interactively, choose the number of the database of interest from the menu. On the command line, use a parameter like -INfile2=nr to choose the name of the database you want to search.
Unfortunately, since some of the database names (for example nr) appear in the menu as both nucleotide and protein databases, NetBLAST cannot be sure which you mean if you use parameter like -INfile2=nr on the command line. Therefore, if the database you want to search cannot be named unambiguously with the -INfile2 parameter, add either -DBNucleotideonly or -DBProteinonly to the command line.
NetBLAST is a client for an implementation of gapped BLAST (Altschul et al., Nucleic Acids Research 25; 3389-3402 (1997)), a heuristic algorithm for searching protein and nucleic acid databases for similarities to query sequences.
The above example demonstrates BLASTP, which searches for similarities between protein queries and protein databases, as a prototype for BLAST. However, the ideas are immediately applicable to comparisons involving conceptual translations of query sequences and databases, and extend to similarity searches between nucleic acid sequences as well.
BLAST compares a query sequence with a database sequence by first locating two non-overlapping sequence segments in common within a certain distance of each other, and then attempts to extend these putative "hits" into locally optimal alignments between the sequences being compared. A more detailed description is provided below.
NetBLAST uses a substitution matrix (such as the BLOSUM or PAM matrices) to assign a score to the alignment of any pair of amino acids. An aggregate score for an alignment segment can be computed by summing the scores of each amino acid pair in that segment. When given two sequences to compare, the original (ungapped) BLAST algorithm searches for arbitrary but equal length segments within each sequence that have a maximal aggregate score which meets or exceeds some threshold or cutoff score. NetBLAST looks for locally optimal alignments between the two sequences whose scores cannot be improved either by extending or trimming. Such locally optimal alignments are called "high-scoring segment pairs," or HSPs.
If you assume a simple protein model in which amino acids occur randomly at all positions and in proportion to the frequencies at which they are found within the database and query sequences, then we can compute a normalized score (expressed in units called bits) from the nominal score of an HSP. Such normalized scores allow direct statistical comparison of results regardless of the scoring system used (see "Generating Gapped Extensions" for a caveat to this). Furthermore, the normalized score can be used to compute an expect value, or E-value, which is the number of distinct HSPs having at least that normalized score expected to occur by chance. This theory has not been proved for gapped local alignments and their associated scores, but there are indications that it remains valid (Altschul et al., 1997).
The central idea of the BLAST algorithm is that any statistically significant alignment between two sequences is likely to contain a high-scoring pair of aligned words. A word is simply a sequence segment of specified length (usually 3 for protein sequences). BLAST begins its comparison of a query sequence to a database by scanning the database for words that score at least the threshold score T when aligned with some word within the query sequence. Any word pair satisfying this condition is called a hit. The diagonal of a hit involving words starting at positions (x, y) of the database and query sequences is defined as x-y. The distance between two hits on the same diagonal is defined as the difference between their first coordinates.
Once a hit is found, BLAST determines whether the hit lies within an alignment having an aggregate score high enough to be reported. It does this by extending the hit in both directions until the running alignment's score has dropped more than some quantity X below the maximum score yet attained. This extension step is quite costly, taking upwards of 90% of BLAST's execution time under most circumstances.
In order to reduce the number of extensions it has to perform, BLAST takes advantage of the fact that an interesting HSP is typically much longer than a single hit. In fact, it is likely to contain multiple hits on the same diagonal within a relatively short distance of one another. Therefore, BLAST chooses a length A and invokes an ungapped extension if and only if two non-overlapping hits are found on the same diagonal within distance A of one another. (Any hit that overlaps the most recent one is ignored.)
Gapped extensions allow BLAST to maintain its sensitivity while tolerating a much higher chance of missing any single moderately scoring HSP. However, gapped extensions take about 500 times longer to execute than ungapped extensions. Therefore, BLAST triggers a gapped extension for an HSP only when its score exceeds a moderate score (Sg) specifically chosen so that no more than about one gapped extension is invoked per 50 database sequences.
To generate the gapped local alignment, BLAST uses a standard dynamic programming algorithm for pairwise sequence alignment which traverses the cells of a path graph, the dimensions of which are the lengths of the two sequences being compared, performing a fixed amount of computation per each cell. Starting from a single aligned pair of residues, called the seed, the dynamic programming proceeds both forward and backward through the path graph considering only those cells for which the optimal local alignment score falls no more than X below the best alignment score yet found. (This description is a generalization of BLAST's method for constructing HSPs.) The region of the path graph explored adapts to the alignment being produced.
The seed for the dynamic programming is the central residue pair of the length-11 segment of the HSP having the highest alignment score. If the HSP itself is shorter than 11 residues in length, its central pair of residues is chosen.
The resulting gapped alignment is reported only if it has an E-value low enough to be of interest. For any alignment actually reported, BLAST performs a gapped extension that records "traceback" information (Sankoff and Kruskal, 1983) using a substantially larger X parameter than that employed during the search stage to increase the accuracy of the alignment.
Because BLAST produces gapped alignments only for those few database sequences likely to be related to the query, it cannot estimate the parameters necessary to compute normalized scores on the fly. Instead, BLAST must rely on estimates of these parameters generated beforehand by random simulation. For this reason, BLAST cannot use a scoring system for which no simulation has been performed and still produce accurate estimates of statistical significance.
Bit Scores and the Size of the Search
Altschul has shown that for sequences that have diverged by a certain amount, there is an informativeness (or ability to discriminate between chance scores and significant scores) associated with each residue pair in the segment pair. This informativeness is the amount of information obtainable from each residue pair in a real alignment that can be used to distinguish the real alignment from a random one. This informativeness can be expressed in bits. The sum of the information available from each residue pair in a segment is the segment pair's score in bits. Such scores are intuitively understandable as the significance of a segment pair score. To express such scores as a fraction you would divide 1 by 2 to the number of bits in the score. For example, if a segment pair has a bit-score of 16, then the appropriate fraction (1/2(16)=1/65,536) would suggest that you should see a score this high by chance about once for every 65,000 independent segment pairs you examine.
For nucleotide sequences that have not diverged, there should be an informativeness of about 2 bits per nucleotide pair. For protein sequences that have not diverged, the informativeness should be slightly over 4 bits per amino acid pair. (The informativeness per pair goes down as the sequences diverge and a segment pair score is maximally informative only when a scoring matrix appropriate to the extent of divergence between the sequences is used to calculate the score.)
The bit scores are absolute, but the expectation of finding any particular score depends on the size of the search space. The number of places where a segment pair might originate is proportional to the product of the length of the query times the sum of the lengths of all the sequences searched. This product is multiplied by a coefficient K to get the size of the search space. When searching protein databases with protein queries, K is approximately 0.13.
For a query sequence of length 300 aa searching a database of 12 million residues, the size of the search space would be 300 x 12,000,000 x 0.13 or 468,000,000. For a search this size, a score that only occurs once in every 65,000 potential segment pairs (that is, with a bit score of 16) would be expected to occur about 7,200 times by chance alone.
If the database being searched is highly redundant (as it might be if it contained several hundred homologous cytochromes), then size of the search space calculated by these methods will overestimate the size of the real search space.
Using NetBLAST for Nucleotide Searches
By default NetBLAST ignores HSPs that do not contain a perfect match of at least 11 nucleotides (22 bits). This is stringent enough that many obviously significant relationships are not found.
The detection of distant relationships between proteins is easier than between nucleotide sequences, even if the nucleotide sequences have to be translated in all six frames to make the amino acid comparison. To give a rough magnitude to this generalization, it is possible to detect similarities in proteins that have diverged by 250 substitutions per 100 residues (250 PAM units) while nucleotide similarities become obscure at distances much greater than 50 substitutions per 100 nucleotides (50 DNA PAM units). Nonetheless, when the nucleotide sequences being compared do not code for proteins, you have no alternative but to search at the nucleotide level.
List Size Limit
A list size that is too small to display all the significant hits is a common problem. Both the screen and the output file will print a warning showing the number of significant hits that are not shown in the list. To see the unlisted hits you must run the search again with the list size limit set high enough to include everything significant. The output can get very large if you set the list size to 1,000. It cannot be set to more than 1,000. If you cannot display everything of interest with a list size limit of 1,000, see the topic FILTERING OUT LOW COMPLEXITY SEQUENCES.
Segment Pair Alignment Limit
NetBLAST displays alignments of segment pairs from the top 100 sequences in the list. You can adjust this limit with -ALIgnments.
Using NetBLAST to search a large local database can take a long time. You may want to run searches in the batch queue. You can specify that this program run at a later time in the batch queue by using -BATch. Run this way, the program prompts you for all the required parameters and then automatically submits itself to the batch or at queue. For more information, see "Using the Batch Queue" in Section 3, Using Programs in the User's Guide.
NetBLAST searches both strands of nucleic acid query sequences and database entries. It is no longer possible to limit the seach to only one strand of the query or database sequences.
Relationship to FastA
For protein database searches, BLAST and FastA have similar sensitivity, although the different algorithms employed make it possible, at least in principle, for FastA to find things that BLAST misses and vice versa. For nucleotide database searches with nucleotide query sequences, FastA may be more sensitive, since by default BLAST ignores segment pairs that do not contain a perfect match of at least 11 adjacent nucleotides (22 bits). This default misses many obviously significant relationships. If you are looking for nucleotide sequence homologs that do not code for proteins (that is, if your search cannot be done at the amino acid level), we suggest you use the FastA program instead of BLAST.
NetBLAST filters out regions of low complexity from query sequences by default. You can turn filtering off by using the -NOFILter parameter. Searches against a nucleotide database with nucleotide queries (blastn) employ the DUST filter program (Hancock and Armstrong, Comput. Appl. Biosci. 10: 67-70 (1994); Tatusov and Lipman, unpublished). All other searches employ the SEG filter program (Wootton and Federhen, Computers in Chemistry 17: 149-163 (1993); Wootton and Federhen, Methods in Enzymology 266: 554-571 (1996)). For a general discussion of the role of filtering in search strategies, see Altschul et al., Nature Genetics 6: 119-129 (1994).
Short repeats and low complexity sequences, such as glutamine-rich regions, confound most database searching methods. For NetBLAST, the random model against which the significance of segment pair scores is evaluated assumes that at each position, each residue has a probability of occurring which is proportional to its composition in the database as a whole. Low complexity or highly repetitive sequences are inconsistent with this assumption.
Low complexity sequence found by the filter program is substituted using the letter N in nucleotide sequence and the letter X in amino acid sequence. Here is an example of a sequence aligned to a filtered copy of itself to show which parts are filtered out:
1 MAAKIFCLIMXXXXXXXXXXXXIFPQCSQAPIASLLPPYLSPAMSSVCENPILLPYRIQQ 60
1 MAAKIFCLIMLLGLSASAATASIFPQCSQAPIASLLPPYLSPAMSSVCENPILLPYRIQQ 60
61 AIAAGIXXXXXXXXXXXXXXXXXXXXXXXXXXNIRXXXXXXXXXXXXXXYSQQQQFLPFN 120
61 AIAAGILPLSPLFLQQSSALLQQLPLVHLLAQNIRAQQLQQLVLANLAAYSQQQQFLPFN 120
121 QXXXXXXXXXXXXXXXXPFSQLAAAYPRQFLPFNQLAALNSHAYVXXXXXXPFSQLAAVS 180
121 QLAALNSAAYLQQQQLLPFSQLAAAYPRQFLPFNQLAALNSHAYVQQQQLLPFSQLAAVS 180
181 PAAFLTQQQLLPFYLHTAPNVGTXXXXXXXXXXXXXXXTNPAAFYQQPIIGGALF 235
181 PAAFLTQQQLLPFYLHTAPNVGTLLQLQQLLPFDQLALTNPAAFYQQPIIGGALF 235
NetBLAST normally uses the BLOSUM62 scoring matrix from Henikoff and Henikoff (Proc. Natl. Acad. Sci. USA 89; 10915-10919 (1992)) whenever the sequences being compared are proteins (including cases where nucleotide databases or query sequences are translated into protein sequences before comparison). You can specify alternate scoring matrices BLOSUM45, BLOSUM80, PAM70 or PAM30 with -MATrix, for example -MATrix=PAM30.
The seminal paper on this subject is Stephen Altschul's "Amino acid substitution matrices from an information theoretic perspective" (J. Mol. Biol. 219; 555-565 (1991)). If you are new to this literature, an easier place to start reading might be Altschul et al., "Issues in searching molecular sequence databases" (Nature Genetics, 6; 119-129 (1994)).
There is no external scoring matrix for nucleotide-nucleotide searches (that is, searches where both the query and the database are nucleotide sequences and where you have not used -TBLASTX.
NetBLAST normally uses the standard genetic code if either the query or the database sequences requires translation. If your query comes from a system where this genetic code is inappropriate, you can select any of these alternative codes by the numbers given in the following table:
1 Standard or Universal
2 Vertebrate Mitochondrial
3 Yeast Mitochondrial
4 Mold, Protozoan, Coelenterate Mitochondrial and Mycoplasma/Spiroplasma
5 Invertebrate Mitochondrial
6 Ciliate Macronuclear
7 [Do not use this index]
8 [Do not use this index]
9 Echinodermate Mitochondrial
10 Alternate Ciliate (Euplotid) Macronuclear
12 Alternate Yeast Nuclear
13 Ascidian Mitochondrial
14 Flatworm Mitochondrial
15 Alternate Ciliate (Blepharisma) Nuclear
16 Chlorophycean Mitochondrial
21 Trematode Mitochondrial
You cannot specify an alternate genetic code for the database sequences.
The numbering for each of these codes has changed from version 1.3 of BLAST (used in release 8.0 of GCG) and you can no longer use the numbers zero, seven, and eight!
There are a number of possible problems with client/server applications running over the Internet. You should try to find out if you are being charged for network communications and you should certainly worry about the security and integrity of your sequences. There is always a possibility that a server will become overloaded and that your search will take much longer than normal or that your output will be lost altogether because of a network or server computer glitch. If you are working in Europe there may be services available through EMBnet that are more appropriate or robust than the NCBI BLAST server.
All parameters for this program may be added to the command line. Use -CHEck to view the summary below and to specify parameters before the program executes. In the summary below, the capitalized letters in the parameter names are the letters that you must type in order to use the parameter. Square brackets ([ and ]) enclose parameter values that are optional.
Minimal Syntax: % netblast [-INfile1=]pir:zizm99 -Default
[-INfile2=]nr specifies database to search
-EXPect=10.0 ignores scores that would occur by chance
more than 10 times
-LIStsize=250 sets maximum number of sequences listed in the
[-OUTfile1=]zizm99.netblastp names the output file
Local Data Files:
[-DATa1=netblast.rdbs] names the list of available remote databases
-MATRix=blosum62 assigns a scoring matrix for proteins
-NOFILter suppresses filtering of low complexity regions
out of nucleotide and protein query sequences
-GAPweight=11 sets gap creation penalty
-LENgthweight=1 sets gap extension penalty
-TBLASTX if query and database are both nucleotide,
translates both and does protein comparisons
-TRANSlate=1 names genetic code for translating query
-DBNucleotideonly searches only nucleic databases
-DBProteinonly searches only protein databases
sends HTTP query to NCBI's net server (default)
sends email to NCBI's email server
-ALIgnments=100 sets number of sequences for which to show
-NOGAPS produce ungapped alignments using sum statistics
-BATch submits program to batch queue
-PROXY="gateway.company.com:99/" specifies the host and port of a proxy server
-APPend="string;string..." appends each string, on a separate line,
to the query (NCBI's email format)
The original paper describing BLAST is Altschul, Stephen F., Gish, Warren, Miller, Webb, Myers, Eugene W., and Lipman, David J. (1990). Basic local alignment search tool. J. Mol. Biol. 215; 403-410. Gapped BLAST is described in Altschul, Stephen F., Madden, Thomas L., Schaffer, Alejandro A., Zhang, Jinghui, Zhang, Zheng, Miller, Webb, and Lipman, David J. (1997). Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res. 25(17);3389-3402.
The files described below supply auxiliary data to this program. The program automatically reads them from a public data directory unless you either 1) have a data file with exactly the same name in your current working directory; or 2) name a file on the command line with an expression like -DATa1=myfile.dat. For more information see Section 4, Using Data Files in the User's Guide.
NetBLAST reads the file netblast.rdbs, which lists the available remote databases in the menu. Updated versions of this file are available through GCG Database Update Service or by request.
You can set the parameters listed below from the command line.
Following some of the optional parameters described below is a letter or short expression in parentheses. These are the names of the corresponding parameters at the bottom of your BLAST output.
This parameter lets you increase the number of hits in your output with scores that would be expected to have occurred by chance alone. Your setting for the number of random hits you will tolerate is used to calculate a cutoff score (S) below which MSPs or multiple HSPs (S2) are ignored. BLAST calculates this cutoff score for you. There is nothing to prevent many biologically significant, but statistically insignificant segment pairs from being screened out, so you may sometimes want to increase this parameter in order to have an opportunity see them.
Limits the number of short descriptions of matching sequences reported to a any number in the range 0 through 1000, even if more sequences had scores above the expectation cutoff. The default is default list size 250.
Limits the number of pairwise alignments to to any number in the range 0 through 1000, even if more sequences had scores above the expectation cutoff. The default value is 100.
The LISTsize and ALIgnments limits are are often too small to display everything significant. The number of sequences that would have been returned if unlimited is listed under the Run Parameters heading in the output under "Number of sequences better than." This truncation of your output is by intention, since the output from BLAST is usually very large and the first level of inference from most searches can be made from the most significant hits.
Suppresses filtering out low-complexity regions from query sequences.
By default, the SEG filter (Wootton and Federhen, Computers Chem. 17(2); 149-163 (1993)) masks low-complexity sequences in protein sequences, and the DUST filter (Hancock and Armstrong, Computer Applications in the Biosciences 10; 67-70 (1994)) performs the same function for nucleic acid sequences. Masked regions are excluded from the search. These regions are replaced with X's (in protein sequences) or N's (in nucleic acid sequences) in the output to let you identify the regions that were excluded.
Sets the amino acid substitution matrix to use. BLAST normally uses the BLOSUM62 amino acid substitution matrix from Henikoff and Henikoff for protein sequence comparisons (including all cases where nucleotide database or query sequences are translated before comparison). The other available options are are BLOSUM45, BLOSUM80, PAM30, and PAM70. For more information, see the topic AMINO ACID SCORING.
Sets the penalty for adding a gap to the alignment. See the RESTRICTIONS topic for more information about setting the gap opening penalty.
Sets the penalty for lengthening an existing gap in the alignment. See the RESTRICTIONS topic for more information about setting the gap extension penalty.
You can use this parameter when searching a nucleotide sequence database with a nucleotide query sequence. BLAST will then translate the query and every sequence in the database and examine all pairwise combinations to find similarities at the amino acid level.
Because such doubly translated searches require a lot of computing, NCBI currently prohibits TBLASTX searches of the nr database.
Gapped alignments are not available with TBLASTX searches.
When BLAST must translate a nucleotide query sequence, it uses the standard ("universal") genetic code. If your query comes from a system where this is inappropriate, you can select any of the alternative codes listed under the topic ALTERNATIVE GENETIC CODES.
Confines the menu to search sets containing nucleotide sequences.
Confines the menu to search sets containing protein sequences.
Performs non-gapped alignments. By default, NetBLAST performs gapped alignments, unless you use TBLASTX, where gapped alignments are not available.
Submits the program to the batch queue for processing after prompting you for all required user inputs. Any information that would normally appear on the screen while the program is running is written into a log file. Whether that log file is deleted, printed, or saved to your current directory depends on how your system manager has set up the command that submits this program to the batch queue. All output files are written to your current directory, unless you direct the output to another directory when you specify the output file.
Specifies the host and port of a proxy server to use. This parameter causes the request to be sent through the proxy which might be your company's firewall. Not all firewalls require proxy settings; therefore, you should check with your network or system administrator before using this option. The complete URL for NCBI is passed in the GET or POST request. The syntax of the proxy specification is, hostname:portnumber. If the ":portnumber" is omitted, port 80 is assumed.
By default NetBLAST makes use of the HTTP server maintained by NCBI at the URL given above. Should there ever be a reason to change this URL, you may do so by specifying -URL.
You can send your query to NCBI's e-mail server instead by including this qualifier. The HTTP and email servers produce the same result; they differ only in the network mechanism with which they communicate.
The e-mail server may occasionally get backed up with requests. When this happens, repeat submissions of the same request only compound the problem. So that access to the computationally intensive BLASTX, TBLASTN and TBLASTX programs can be continue to be provided, please refrain from re-submitting all searches -- not just BLASTX, TBLASTN, or TBLASTX requests -- within 24 hours of the first submission, when a response has not been received. A 24-hour wait should allow sufficient time for the queues to be clear of other requests or for any underlying problem
GCG implementation of NetBLAST is what is known as a shell program. After collecting your input parameters, the shell calls the NCBI BLAST server and sends it a query in NCBI's email query format. If you are familiar with that format, you can pass additional parameters to NCBI by using this parameter. Use semicolons to separate multiple command lines. Here is an example:
%netblast -append="HTML yes;PATH firstname.lastname@example.org"
Please call us if there are additional parameters you want to use with BLAST that you would like to look more like native GCG parameters.
You can read the current version of the general BLAST documentation on the World Wide Web at http://www.ncbi.nlm.nih.gov/BLAST/blast_help.html. Additional documentation may be obtained by sending e-mail to email@example.com. The body of the message should just the single word "HELP".
Printed: May 27, 2005 13:49
Copyright (c) 1982-2005 Accelrys Inc. All rights reserved.
Licenses and Trademarks: Discovery Studio ®, SeqLab ®, SeqWeb ®, SeqMerge ®, GCG ® and, the GCG logo are registered trademarks of Accelrys Inc.
All other product names mentioned in this documentation may be trademarks, and if so, are trademarks or registered trademarks of their respective holders and are used in this documentation for identification purposes only.