Table 2 Conditions for skipping motif L=〈M,S j,k ,T〉
From: Efficient sequential and parallel algorithms for finding edit distance based motifs
Rule | Conditions (in all rules t≥0) |
|---|---|
1 | (j+k≤m)∧〈j,D〉∈T |
2 | {〈j+t,D〉,〈j+t+1,R〉}⊆T |
3 | (j+k≤m)∧{〈j,R〉,〈j+1,R〉,…,〈j+t,R〉,〈j+t+1,D〉}⊆T |
4 | {〈j+t,D〉,〈j+t,I〉}⊆T |
5 | {〈j+t,D〉,〈j+t+1,I〉}⊆T |
6 | {〈j+t,R〉,〈j+t,I〉}⊆T |
7 | (j>1)∧〈j,I〉∈T |
8 | (j>1)∧{〈j,R〉,〈j+1,R〉,…,〈j+t,R〉,〈j+t+1,I〉}⊆T |
9 | (j+k≤m)∧〈j+k,I〉∈T |