can anybody please help me with this project?

[zzh0008]

In this project, my input will be 2 strings consisting of the characters A, G, C, and T. For instance:
agatgctagatttcg
agcctcccgatagcc

and Count the number of positions at which 2 sequences (of equal length) differ.

truly appreciated .

[Cubbi]

inner_product works great for this kind of thing:

#include <iostream>
#include <string>
#include <numeric>
#include <functional>

int main()
{
    std::string s1 = "agatgctagatttcg";
    std::string s2 = "agcctcccgatagcc";

    int diffs = std::inner_product(s1.begin(), s1.end(), s2.begin(), 0,
                                   std::plus<int>(), std::not_equal_to<char>());

    std::cout << "The number of pairwise mismatches: " << diffs << '\n';
}

online live demo: http://ideone.com/SV4MK5

(although, depending on what you're studying you may be expected to write a loop, for example, for(size_t n = 0; n < s1.size(); ++n), which increments a counter whenever s1[n] != s2[n])

[zzh0008]

cubbi, you re the best!! thank you so much for the help.

[zzh0008]

hey, cubby ,
one more question,
how do I Allow the strings to be of different lengths. In this case, it works as follows:

GCCGTAA
GCCG
These have a Hamming Distance of 3, because the "TAA" at the end is not matched in the 2nd string.

TGGC
TAGCAGG
These have a Hamming Distance of 4: Positions 1,4,5,6 don't match.