We discuss the expected length of the longest common substring(not subsequence) between two random strings of length n each,and show that it grows only logarithmically as a function of n -much slower than the growth of the expected longest commonsubsequence discussed in Lecture 11a.