1. Plagiarism detection
Yesha Gupta

2. String Matching Algorithms:
KMP
LCSS
Rabin-Karp fingerprints
an algorithm of choice for multiple pattern search

3. Testing text file information:
21 Lines
Each line(treated as pattern) is of different length
Max line size: 370
Minimum line size: 85

4. LCSS is performing very slow Rabin Karp performed better than KMP
Why? Efficient use of Hashing techniques

5. KMP generated optimum output. Rabin Karp did not.
Why? Because of fixed length patterns in a text

6. Testing text file information:
21 Lines
Each line(treated as pattern) is of same length

7. Result of RabinKarp and
KMP is the same
Why?
Each pattern has same length

8. Execution time of RabinKarp is slightly better than KMP