Distributed code and data propagation algorithm for longest common subsequence problem solving

Abstract

This paper proposes a distributed code and data propagation algorithm for Longest Common Subsequence problem solving and compares this algorithm performance against the algorithm based on J2EE technology. The new algorithm builds a graph devised to propagate classes and data between different nodes and the client, whereas the J2EE algorithm requires more complex communication and database processing. The proposed algorithm's performance in terms of number of nodes and execution time is better than or comparable to that of the existing algorithms. © Springer-Verlag Berlin Heidelberg 2007.