1. Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic construction of the transitive closure of a directed graph (English translation). Sov. Math. Dokl. 11, 1209–1210 (1975)
2. Arslan, A.N., Egecioglu, Ö: Algorithms for the constrained longest common subsequence problems. In: Stringology, pp. 24–32 (2004)
3. Arslan, A.N., Egecioglu, Ö: Algorithms for the constrained longest common subsequence problems. Int. J. Found. Comput. Sci. 16(6), 1099–1109 (2005)
4. Bender, M.A., Farach-Colton, M.: The lca problem revisited. In: LATIN, pp. 88–94 (2000)
5. Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: SPIRE, pp. 39–48 (2000)