Algorithm to find exact matches in two strings

We have a string of characters from an alphabet of 4 letters {ACGT}. The string is G=3 bln
characters long. We have a 100 characters long string R from the same alphabet.
● How would you find all exact matches of the shorter string R in the long string G?
Describe the algorithm itself, not function calls.