A systolic array for the longest common subsequence problem

Robert, Y., & Tchuenté, M. (1985). A systolic array for the longest common subsequence problem. Information Processing Letters, 21(4), 191–198. https://doi.org/10.1016/0020-0190(85)90058-4

Robert, Yves, and Maurice Tchuenté. “A systolic array for the longest common subsequence problem.” Information Processing Letters, vol. 21, no. 4, 1985, pp. 191–98, https://doi.org/10.1016/0020-0190(85)90058-4.

Robert, Yves, and Maurice Tchuenté. 1985. “A systolic array for the longest common subsequence problem.” Information Processing Letters 21 (4): 191–98. https://doi.org/10.1016/0020-0190(85)90058-4.

Robert, Y. and Tchuenté, M. (1985) ‘A systolic array for the longest common subsequence problem’, Information Processing Letters, 21(4), pp. 191–198. Available at: https://doi.org/10.1016/0020-0190(85)90058-4.

@article{robert1985systolic,
  title = {{A systolic array for the longest common subsequence problem}},
  author = {Robert, Yves and Tchuenté, Maurice},
  journal = {Information Processing Letters},
  volume = {21},
  number = {4},
  pages = {191--198},
  year = {1985},
  doi = {10.1016/0020-0190(85)90058-4}
}