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

<table>The time performance comparison between FACC and FAST-LCS on 20 DNA sequences (<svg height="14.85" id="M405" style="vertical-align:-2.22495pt" version="1.1" viewbox="0 0 46.8125 14.85" width="46.8125" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.012)"><path d="M162 -163h-61v866h61v-866z" id="x7C"></path></g><g transform="matrix(.017,-0,0,-.017,4.533,12.012)"><path d="M570 168l-39 -168h-498v23l262 301l-248 304v22h471q4 -71 11 -146l-29 -4q-17 65 -37 88q-12 15 -36 20.5t-79 5.5h-181l211 -256l-243 -287h280q51 0 77 20.5t49 83.5z" id="x3A3"></path></g><g transform="matrix(.017,-0,0,-.017,14.698,12.012)"><path d="M162 -163h-61v866h61v-866z" id="x7C"></path></g><g transform="matrix(.017,-0,0,-.017,23.878,12.012)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,38.582,12.012)"><path d="M456 178h-96v-72q0 -51 12.5 -62.5t72.5 -16.5v-27h-256v27q65 5 78 17t13 62v72h-260v28q182 271 300 426h40v-407h96v-47zM280 225v295h-2q-107 -148 -196 -295h198z" id="x34"></path></g>
</svg>) with lengths from 25 to 180.</table>

Mathematical Problems in Engineering

fig4

Figure 4

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