An almost-linear time and linear space algorithm for the longest common subsequence problem

J. Y. Guo*, F. K. Hwang

*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

Fingerprint

Dive into the research topics of 'An almost-linear time and linear space algorithm for the longest common subsequence problem'. Together they form a unique fingerprint.

Mathematics

INIS

Computer Science

Economics, Econometrics and Finance