1. Aho A, Hopcroft J, Ulman (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading
2. Akl SG (1990) Parallel synergy or can a parallel computer be more efficient than the sum of its parts? Tech. Report. 90-285, Queen’s University, Kingston, Ontario (1990)
3. LNS;CER Alves,2003
4. Alves CER, Cáceres EN, Song SW (2006) A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica 45(3):301–335
5. Alves C, Caceres E, Dehne F, Song S (2002) Parallel dynamic programming for solving the string editing problem on a CGM/BSP. In: Proc 14th ACM symp on parallel algorithms and architectures (SPAA). ACM Press, New York, pp 275–281. ACM Dig Library