- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 310328, 17 pages
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.
- W. S. Chen, P. C. Yuen, and X. Xie, “Kernel machine-based rank-lifting regularized discriminant analysis method for face recognition,” Neurocomputing, vol. 74, no. 17, pp. 2953–2960, 2011.
- A. Cherkasov, “Bioinformatics: a practical guide to the analysis of genes and proteins,” American Journal of Human Biology, vol. 17, no. 3, pp. 387–389, 2005.
- E. W. Edmiston, N. G. Core, J. H. Saltz, and R. M. Smith, “Parallel processing of biological sequence comparison algorithms,” International Journal of Parallel Programming, vol. 17, no. 3, pp. 259–275, 1988.
- E. Lander, “Protein sequence comparison on a data parallel computer,” in Proceedings of the International Conference on Parallel Processing (ICPP '88), pp. 257–263, The Pennsylvania State University, University Park, PA, USA, 1988.
- A. Galper and D. L. Brutlag, “Parallel similarity search and alignment with the dynamic programming method,” Tech. Rep., Stanford University, Palo Alto, Calif, USA, 1990.
- D. Maier, “The complexity of some problems on subsequences and supersequences,” Journal of the ACM, vol. 25, no. 2, pp. 322–336, 1978.
- R. A. Wagner and M. J. Fischer, “The string-to-string correction problem,” Journal of the ACM, vol. 21, no. 1, pp. 168–173, 1974.
- D. S. Hirschberg, “A linear space algorithm for computing maximal common subsequences,” Communications of the ACM, vol. 18, no. 6, pp. 341–343, 1975.
- J. D. Ullman, A. V. Aho, and D. S. Hirschberg, “Bounds on the complexity of the longest common subsequence problem,” Journal of the ACM, vol. 23, no. 1, pp. 1–12, 1976.
- J. W. Hunt and T. G. Szymansi, “A fast algorithm for computing longest common subsequences,” Communications of the ACM, vol. 20, no. 5, pp. 350–353, 1977.
- S. Bespamyatnikh and M. Segal, “Enumerating longest increasing subsequences and patience sorting,” Information Processing Letters, vol. 76, no. 1-2, pp. 7–11, 2000.
- W. J. Masek and M. S. Paterson, “A faster algorithm computing string edit distances,” Journal of Computer and System Sciences, vol. 20, no. 1, pp. 18–31, 1980.
- A. Aggarwal and J. Park, “Notes on searching in multidimensional monotone arrays,” in Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pp. 497–512, White Plains, NY, USA, 1988.
- A. Apostolico, M. J. Atallah, L. L. Larmore, and S. McFaddin, “Efficient parallel algorithms for string editing and related problems,” SIAM Journal on Computing, vol. 19, no. 5, pp. 968–988, 1990.
- V. Freschi and A. Bogliolo, “Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism,” Information Processing Letters, vol. 90, no. 4, pp. 167–173, 2004.
- W. Liu and L. Chen, “A fast longest common subsequence algorithm for biosequences alignment,” IFIP International Federation for Information Processing, vol. 258, pp. 61–69, 2008.
- D. Korkin, Q. Wang, and Y. Shang, “An efficient parallel algorithm for the multiple longest common subsequence (MLCS) problem,” in Proceedings of the 37th International Conference on Parallel Processing (ICPP '08), pp. 354–363, Portland, Ore, USA, September 2008.
- Q. Wang, D. Korkin, and Y. Shang, “Efficient dominant point algorithms for the multiple longest common subsequence (MLCS) problem,” in Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI '09), pp. 1494–1499, July 2009.
- Q. Wang, D. Korkin, and Y. Shang, “A fast multiple longest common subsequence (MLCS) algorithm,” IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 3, pp. 321–334, 2011.
- J. Yang, Y. Xu, and Y. Shang, “An efficient parallel algorithm for longest common subsequence problem on GPUs,” in Proceedings of the World Congress on Engineering (WCE '10), vol. 1, pp. 499–504, July 2010.
- M. L. Fredman, “On computing the length of longest increasing subsequences,” Discrete Mathematics, vol. 11, no. 1, pp. 29–35, 1975.
- I. H. Yang, C. P. Huang, and K. M. Chao, “A fast algorithm for computing a longest common increasing subsequence,” Information Processing Letters, vol. 93, no. 5, pp. 249–253, 2005.
- G. S. Brodal, K. Kaligosi, I. Katriel, and M. Kutz, “Faster algorithms for computing longest common increasing subsequences,” in Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM '06), vol. 4900, pp. 330–341, 2006.
- M. Michael, Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate Online, SAMS Press, 2009.
- J. Dean, “Experiences with MapReduce, an abstraction for large-scale computation,” in Proceedings of the 15th International Conference on Parallel Architectures and Compilation Techniques (PACT '06), p. 1, IEEE Press, September 2006.
- J. Dean and S. Ghemawat, “MapReduce: simplified data processing on large clusters,” Communications of the ACM, vol. 15, no. 1, pp. 107–113, 2008.
- Pseudomonas aeruginosa PAO1 chromosome, complete genome, http://www.ncbi.nlm.nih.gov/nuccore/110645304?report=fasta.