Journal Article

A bit-string longest-common-subsequence algorithm

Information Processing Letters (1986) 23(5) 305-310
DOI: 10.1016/0020-0190(86)90091-8
44Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A longest-common-subsequence algorithm is described which operates in terms of bit or bit-string operations. It offers a speedup of the order of the word-length on a conventional computer. © 1986.

Author supplied keywords

Cite

CITATION STYLE

APA

Allison, L., & Dix, T. I. (1986). A bit-string longest-common-subsequence algorithm. Information Processing Letters, 23(5), 305–310. https://doi.org/10.1016/0020-0190(86)90091-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free