Research Article
FACC: A Novel Finite Automaton Based on Cloud Computing for the Multiple Longest Common Subsequences Search
Table 1
Notations and their meanings.
| Notations | Meaning |
| | The common alphabet of N sequences | | The set of alphabets in the ith sequence | | The kth sequence, with d being the number of sequences drawn from | T | A set of sequences drawn from | | A matched pair | | The set of the FA states | δ | The FA’s transition function | | The FA’s initial state | F | The set of the FA’s final states | Atm | The FA recognizing/accepting all of the CSs of sequences from T | | Kleene closure of , is a sequence from with the length of zero or nonzero} | L(Atm) | A language recognized/accepted by the Atm |
|
|