Global-Local alignment
This global-local alignment finds whole-length (of the query) versus
local-part (of the target protein in the database) similarity between
two amino acid sequences, based on Needleman-Wunsch style dynamic-programming
method.
Query sequence is compared to all sequences in the specified database
(SWISS-PROT protein sequence database, or PDB-REPRDB structure database).
Gap cost is calculated as "cost = a + bk", where "a" is the opening gap
cost, "b" is the extend gap cost, and "k" is the gap length. User can set
any coefficient for "a" and "b", though it is recommended to use the default
settings for usual cases.
This global-local alignment also takes so-called out gap costs into accounts.
An out gap is a gap that exist outside of alignment.
If only very smaller region of the query matches to the (partial) sequence
of target, an out gap cost tends to become large. Thus in this case, user
is recommended to use zero or smaller coefficient for out gap costs.
Global alignment
This global-global alignment finds whole-length versus whole-length
similarity between two amino acid sequences, based on Needleman-Wunsch
style dynamic-programming method.
Query sequence is compared to all sequences in the specified database
(SWISS-PROT protein sequence database, or PDB-REPRDB structure database).
Gap cost is calculated as "cost = a + bk", where "a" is the opening gap
cost, "b" is the extend gap cost, and "k" is the gap length. User can set
any coefficient for "a" and "b", though it is recommended to use the default
settings for usual cases.
Like the global-local alignment described above, this global alignment
also takes so-called out gap costs into accounts.
An out gap is a gap that exist outside of alignment.
If two sequences have very different length, an out gap cost tends to become
large. Thus in this case, user is recommended to use zero or smaller
coefficient for out gap costs.
Needleman, S.B., Wunsch, C.D.: "A general method applicable to the search for similarities in the amino acid sequence of two proteins."
J. Mol. Biol. Vol.48, pp.443-453 (1970).
KLGQGCFGEVWMGTWNGTTRVAIKTLKPGTMSPEAFLQEAQVMKKLRHEKLVQLYAVVSEEPIYIVTEYMSKGSLLDFLK
>CSRC_HUMAN KLGQGCFGEVWMGTWNGTTRVAIKTLKPGTMSPEAFLQEAQVMKKLRHEKLVQLYAVVSEEPIYIVTEYMSKGSLLDFLK( If the field 'Query label=' is blank, the label after '>' in the first line will be used as the label for the sequence. The character '>' in the sequence will terminate the sequence, and other non-alphabetical characters will be removed. )
Maximum length is 2,000 a.a.
If you selected Database:SWISS-PROT, sequence length =< 300 a.a.
![]() |
PAPIA system, ![]() Copyright © 1997-2000, Parallel Application TRC Lab. , RWCP , Japan Copyright © 2001, Computational Biology Research Center , AIST , Japan |