As may be appreciated, the longest common subsequence may not be a contiguous sequence of segments within the first sequence of segments or within the second sequence of segments. Accordingly, the systems described herein may identify each contiguous subsequence of common segments (i.e., each subsequence of common segments that is contiguous in both the first and second sequence of segments) in the process of determining the longest common (but non-contiguous) subsequence. In this manner, the systems described herein may identify the set of common (contiguous) temporal subsequences between the first media data object and the second media data object. As will be explained in greater detail below, systems described herein may treat each such contiguous subsequence as a token within a temporal string of tokens—a string to which edit operations could be applied (e.g., adding, deleting, and/or replacing tokens—i.e., contiguous subsequences of segments) to describe differences between the content of the first and second media data objects. In addition, systems described herein may identify, within the first and/or the second sequence, contiguous subsequences of (differing) segments before, after, or in between contiguous subsequences of common segments. These systems may also treat these contiguous subsequences of differing segments as tokens within the temporal string of tokens for the respective first and second media data objects (representing, e.g., tokens removed from or replaced within the first media data object and/or tokens added to or replaced within the second media data object).