1. Data Structures and Algorithms;Aho,1983
2. The longest common subsequence problem revisited;Apostolico;Algorithmica,1987
3. On the economic construction of the transitive closure of a direct graph;Arlazarov;Sov. Math. Dokl.,1970
4. P. Bonizzoni, A. Ehrenfeucht, Approximation of the shortest common supersequence with ratio less than the alphabet size, Technical Report TR 149-95, Dipartimento di Scienze Della Informazione, Universitá Degli Studi di Milano, 1996.
5. Introduction to Algorithms;Cormen,1990