### Table 4: Plagiarism detected under tokenised longest common substrings metric

"... In PAGE 6: ...The results for the tokenised longest common substrings metric, as shown in Table4 , are also largely conclusive. There is a slight curiosity with the implementation of the metric used in that it returns slightly less than a score of 100 for identical submissions.... ..."

### Table 6: Restricting the search for the first longest common substring (underlined).

"... In PAGE 7: ... This both prevents the algorithm from assigning the same target region to two source columns and also diminishes the run-time for the task. Table6 graphically represents the matrix of operations for com- paring instance henry to rhwarner from Table 1, where the target has been masked to remove regions already covered by the partial translation formula. In this case, two possible recipes are present and both substrings have the same length; thus we select the left-most, or earliest occurring, recipe as indicated, leading to the refined translation formula %first[1-1]last[1-n].... ..."

### Table 4: The longest common string (underlined). R stands for a replaced character, I for an inserted character and D for a deleted one.

"... In PAGE 5: ... Hunt and Szymanski [9] provide an interesting solution of complexity O((n + R) log n) where n is the length of the longest string and R is the number of substring matches between the two strings. Most of these methods rely on a matrix of operations sim- ilar to Table4 which illustrates the different matches possible for... ..."

### Table 5: Longest aligned common strings

1996

Cited by 1

### Table 2: Longest Common Subsequence of the First Product

### Table 1: Fully dynamic reachability algorithms.

2004

"... In PAGE 2: ... This is the first algorithm that breaks the O(n2) update barrier for all graphs with o(n2) edges. The new algorithm and some of the previously existing algorithms for the dynamic reachability problem are compared in Table1 . Our algorithm has the fastest update time, among all algorithms that work on all graphs, but alas the slowest query time.... ..."

### Table 1: Fully dynamic reachability algorithms.

"... In PAGE 2: ... This is the first algorithm that breaks the O(n2) update barrier for all graphs with o(n2) edges. The new algorithm and some of the previously existing algorithms for the dynamic reachability problem are compared in Table1 . Our algorithm has the fastest update time, among all algorithms that work on all graphs, but alas the slowest query time.... ..."

### Table 1. Fully dynamic reachability algorithms.

2002

Cited by 16

### Table 1. Fully dynamic reachability algorithms.

2002

Cited by 16