About this Journal Submit a Manuscript Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 310328, 17 pages
http://dx.doi.org/10.1155/2012/310328
Research Article

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

1School of Computer Science and Technology, Xidian University, Xi'an 710071, China
2School of Software, Xidian University, Xi'an 710071, China

Received 14 April 2012; Accepted 30 August 2012

Academic Editor: Hailin Liu

Copyright © 2012 Yanni Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to Cite this Article

Yanni Li, Yuping Wang, and Liang Bao, “FACC: A Novel Finite Automaton Based on Cloud Computing for the Multiple Longest Common Subsequences Search,” Mathematical Problems in Engineering, vol. 2012, Article ID 310328, 17 pages, 2012. doi:10.1155/2012/310328