1975 ALinearSpaceAlgForCompMaxComSub

From GM-RKB
Jump to: navigation, search

Subject Headings: Longest Common Subsequence Task, Longest Common Subsequence Algorithm.

Notes

Cited By

Quotes

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.,


 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
1975 ALinearSpaceAlgForCompMaxComSubDan S. HirschbergA Linear Space Algorithm for Computing Maximal Common Subsequenceshttp://www.cs.zju.edu.cn/people/yedeshi/Alinearspace-p341-hirschberg.pdf10.1145/360825.3608611975
AuthorDan S. Hirschberg +
doi10.1145/360825.360861 +
titleA Linear Space Algorithm for Computing Maximal Common Subsequences +
titleUrlhttp://www.cs.zju.edu.cn/people/yedeshi/Alinearspace-p341-hirschberg.pdf +
year1975 +