STRING HAMMING DISTANCE

STRING HAMMING DISTANCE

Let Subcommand

Given two equal length strings, returns the count of the number of character positions that match.

LET <dist> = STRING HAMMING DISTANCE <s1> <s2>
where <dist> is a parameter containing the Hamming distance;
            <s1> is the name of a pre-existing string;
and     <s2> is the name of a pre-existing string.

The <s1> and <s2> strings must be the same length.

LET IFLAG = STRING HAMMING DISTANCE S1 S2

The strings on the right hand side of the equal sign must be previously existing strings. That is, expressions are not allowed. For example, the following will result in an error message
LET IFLAG = STRING HAMMING DISTANCE "gmail.com" "gmail.org"

you need to do

LET STRING S1 = gmail.com
LET STRING S2 = gmail.org
LET SOUT = STRING HAMMING DISTANCE S1 S2


The name on the left hand side of the equal sign may be a previously existing parameter. However, if it is a previously existing string, variable, or matrix name, an error will be reported and the requested parameter will not be created.

None

None

HAMMING DISTANCE	=	Compute the Hamming distance of two vectors.
EUCLIDEAN DISTANCE	=	Compute the Euclidean distance.
COSINE DISTANCE	=	Compute the cosine distance.
MANHATTAN DISTANCE	=	Compute the Manhattan distance.
LET STRING	=	Defines a string.
READ STRING	=	Reads a string from a file.

Data Management

2018/10

 
LET STRING S1 = 1011100111
LET STRING S2 = 1010010110
LET DIST = STRING HAMMING DISTANCE S1 S2
PRINT DIST
    

The following output is returned

 
 PARAMETERS AND CONSTANTS--

     DIST    --  0.4000000E+01