A fast algorithm for computing longest common subsequences

Hunt, James W.; Szymanski, Thomas G.

doi:10.1145/359581.359603

Record: found
Abstract: not found
Article: not found

A fast algorithm for computing longest common subsequences

Author(s): James W. Hunt , Thomas G. Szymanski

Publication date (Print): May 1977

Journal: Communications of the ACM

Publisher: Association for Computing Machinery (ACM)

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

Related collections

Author and article information

Journal

Title: Communications of the ACM

Abbreviated Title: Commun. ACM

Publisher: Association for Computing Machinery (ACM)

ISSN (Print): 00010782

Publication date (Print): May 1977

Volume: 20

Issue: 5

Pages: 350-353

Article

DOI: 10.1145/359581.359603

SO-VID: d9b3444b-a5a7-4913-bfea-b83ee7496591

History

Data availability:

A fast algorithm for computing longest common subsequences

Read this article at

Abstract

Related collections

Electronic Workshops in Computing (eWiC)

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 1,848

Cited by 63