10. The apparatus of claim 9 , further comprising: computer-readable instructions stored in the data storage system that are configured to determine whether condition P<L k −M is met; computer-readable instructions stored in the data storage system that are configured to, then loop back to search for the maximal matching length V of the string str and the suffix S(str k ,P) if P<L k −M is met; and computer-readable instructions stored in the data storage system that are configured to determine whether condition k<m is met if P<L k −M is not met.
11. The apparatus of claim 10 , further comprising: computer-readable instructions stored in the data storage system that are configured to increment k by one and looping back to search for the maximal matching length V of the string str and the suffix S(str k ,P) if k<m is met; and computer-readable instructions stored in the data storage system that are configured to perform said output said similarity S(k) if k<m is not met.