A New Efficient Algorithm for Computing the Longest Common Subsequence

Iliopoulos, Costas S.; Rahman, M. Sohel

by Costas S. Iliopoulos, M. Sohel Rahman

Reference:

A New Efficient Algorithm for Computing the Longest Common Subsequence (Costas S. Iliopoulos, M. Sohel Rahman), In Theory of Computing Systems, volume 45, 2007.

Bibtex Entry:

@ARTICLE{IR07NewEffLCS,
 AUTHOR    = "Costas S. Iliopoulos and M. Sohel Rahman",
 TITLE     = "A New Efficient Algorithm for Computing the Longest Common Subsequence",
 journal   = "Theory of Computing Systems",
 pages     = "355-371",
 volume    = "45",
 number    = "2",
 year      = "2007"
}