Greedy string tiling is a token-sequence matching algorithm that finds the longest contiguous matching token runs between two source files, removes them, and repeats until no match exceeds a minimum length. It is the engine inside JPlag and a foundational technique in modern code plagiarism checker platforms. Instructors see it every time a system flags two Java assignments as 87