Access Restriction

Author Hirschberg, D. S.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Editing ♦ Subsequence ♦ Longest common sequence ♦ String correction
Abstract The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadratic time and in linear space.
Description Affiliation: Princeton Univ., Princeton, NJ (Hirschberg, D. S.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 18
Issue Number 6
Page Count 3
Starting Page 341
Ending Page 343

Open content in new tab

   Open content in new tab
Source: ACM Digital Library