Skip to main navigation
Skip to search
Skip to main content
English
中文
Home
Profiles
Research Units
Research output
Projects
Press / Media
Activities
Prizes
Search by expertise, name or affiliation
An almost-linear time and linear space algorithm for the longest common subsequence problem
J. Y. Guo
, F. K. Hwang
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
7
Citations (Scopus)
Overview
Fingerprint
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.
Sort by
Weight
Alphabetically
Mathematics
Longest Common Subsequence
Linear Space
Linear Time
Dynamic Programming
Programming
Engineering & Materials Science
DNA
Dynamic programming