FACC: A Novel Finite Automaton Based on Cloud Computing for the Multiple Longest Common Subsequences Search

Algorithm 1

The pseudocode of the preprocessing algorithm.

Algorithm Pre-processing (InitStringSet)

Input: InitStringSet: a initial string set.

Output: Σ :common alphabet over InitStringSet

     StringSet: the result of pre-processed InitStringSet

(1)  for each string 𝑆_𝑖 in InitStringSet

(2)  tempSet = ∅

(3)  for each character  𝑆_𝑖[j] in 𝑆_𝑖

(4)   if (𝑆_𝑖[𝑗]∉tempSet)

(5)    tempSet = tempSet  ∪  {𝑆_𝑖[j]}

(6)    if (𝑆_𝑖[j] ∈ map)

(7)     map (𝑆_𝑖[j]) = map (𝑆_𝑖[j]) + 1

(8)    else

(9)     map (𝑆_𝑖[j]) = 1

(10)  endfor

(11) endfor

(12) Σ=∅

(13) for each character  char[i] in map

(14) if (map(char[i]) == size (InitStringSet))

(15)   Σ = Σ  ∪  {char[i]}

(16) endfor

(17) StringSet = InitStringSet

(18) for each string 𝑆_𝑖 in StringSet

(19)  for each character  𝑆_𝑖[j] in 𝑆_𝑖

(20)    if (𝑆_𝑖[j] ∉ Σ)

(21)     delete (𝑆_𝑖[j])

(22)  endfor

(23) endfor

(24) return Σ and StringSet