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 amino acid sequences (<svg height="14.85" id="M406" style="vertical-align:-2.22495pt" version="1.1" viewbox="0 0 54.974998 14.85" width="54.974998" 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="M412 140l28 -9q0 -2 -35 -131h-373v23q112 112 161 170q59 70 92 127t33 115q0 63 -31 98t-86 35q-75 0 -137 -93l-22 20l57 81q55 59 135 59q69 0 118.5 -46.5t49.5 -122.5q0 -62 -29.5 -114t-102.5 -130l-141 -149h186q42 0 58.5 10.5t38.5 56.5z" id="x32"></path></g><g transform="matrix(.017,-0,0,-.017,46.741,12.012)"><path d="M241 635q53 0 94 -28.5t63.5 -76t33.5 -102.5t11 -116q0 -58 -11 -112.5t-34 -103.5t-63.5 -78.5t-94.5 -29.5t-95 28t-64.5 75t-34.5 102.5t-11 118.5q0 58 11.5 112.5t34.5 103t64.5 78t95.5 29.5zM238 602q-32 0 -55.5 -25t-35.5 -68t-17.5 -91t-5.5 -105
q0 -76 10 -138.5t37 -107.5t69 -45q32 0 55.5 25t35.5 68.5t17.5 91.5t5.5 105t-5.5 105.5t-18 92t-36 68t-56.5 24.5z" id="x30"></path></g>
</svg>) with lengths from 25 to 320.</table>

Mathematical Problems in Engineering

fig5

Figure 5

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