A New Efficient Algorithm for Computing the Longest Common Subsequence.

MLA

Iliopoulos, Costas S., and M.Sohel Rahman. “A New Efficient Algorithm for Computing the Longest Common Subsequence.” Theory of Computing Systems, vol. 45, no. 2, Aug. 2009, pp. 355–71. EBSCOhost, https://doi.org/10.1007/s00224-008-9101-6.

APA

Iliopoulos, C. S., & Rahman, M. S. (2009). A New Efficient Algorithm for Computing the Longest Common Subsequence. Theory of Computing Systems, 45(2), 355–371. https://doi.org/10.1007/s00224-008-9101-6

Chicago

Iliopoulos, Costas S., and M. Sohel Rahman. 2009. “A New Efficient Algorithm for Computing the Longest Common Subsequence.” Theory of Computing Systems 45 (2): 355–71. doi:10.1007/s00224-008-9101-6.