Algorithm uses standard representations of DNA bases by single characters that specify either a single base (e.g. G for guanine, A for adenine) or a set of bases (e.g. R for either G or A).
IUPAC nucleotide code
|
Base
|
A
|
Adenine
|
C
|
Cytosine
|
G
|
Guanine
|
T (or U)
|
Thymine (or Uracil)
|
R
|
A or G
|
Y
|
C or T (U)
|
S
|
G or C
|
W
|
A or T (U)
|
K
|
G or T (U)
|
M
|
A or C
|
B
|
C or G or T (U)
|
D
|
A or G or T (U)
|
H
|
A or C or T (U)
|
V
|
A or C or G
|
N
|
any base (A or G or C or T (U)
|
. or -
|
gap
|
Algorithm uses the following base pair complementarity:
IUPAC nucleotide code
|
Complement
|
A
|
T
|
C
|
G
|
G
|
C
|
T (or U)
|
A
|
R
|
Y
|
Y
|
R
|
S
|
S
|
W
|
W
|
K
|
M
|
M
|
K
|
B
|
V
|
D
|
H
|
H
|
D
|
V
|
B
|
N
|
N
|
. or –
|
. or –
|
Type or Paste the nucleic acid sequence
Disclaimer: The information contained in this website is provided in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. By using this website, you hereby consent to our disclaimer and agree to its terms.
Send all questions, suggestions and comments to Vlad (vvv900@gmail.com)
Dr. Vladislav Vasilyev
National Computational Infrastructure,
The Australian National University,
Canberra, ACT, 2601, Australia