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

Algorithm 2

The pseudocode for constructing Atm in parallel by MapReduce.

Algorithm Build-Atm(Pos, dsucSet)

Input: 𝑄₀: the initial state of the Atm (0,0,…,0)

   tabSet: the set of successor tables for T drawn from Σ

Output: Atm: a Atm of T for MLCS

(1)  Atm = NULL, 𝑄={𝑄₀}

(2)  Build-Atm(𝑄, tabSet)

(3)   dispatch |𝑄| map functions in parallel do

(4)     for each 𝑄_𝑖∈𝑄, for ∀𝑎∈Σ dispatch a Map function

(5)      𝑄_𝑗=𝛿(𝑄_𝑖,𝑎)

(6)      if 𝑄_𝑗∉𝑄 and 𝑄_𝑗≠Φ

(7)        𝑄=𝑄∪𝑄_𝑗

(8)     end for

(9)   reduce all the results of the Map functions

(10) reduce all the results of the Map functions

(11) Build-Atm(𝑄, tabSet)

(12) return Atm

(13) end