Title

Fast Algorithm For The Longest-Common-Subsequence Problem

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Inf. Sci.

Keywords

Computer Science; Information Systems

Abstract

In this paper, a fast algorithm for the longest-common-subsequence problem is presented which runs in O((p + n)log n), time where p is the total number of pairs of matched positions between the strings. Thus, the average performance of this algorithm is much better than those of the quadratic algorithms proposed earlier and takes only a linear amount of space.

Journal Title

Information Sciences

Volume

20

Issue/Number

1

Publication Date

1-1-1980

Document Type

Article

Language

English

First Page

69

Last Page

82

WOS Identifier

WOS:A1980JD23500006

ISSN

0020-0255

Share

COinS