A Bit-String Longest-Common-Subsequence Algorithm
Information Processing Letters (1986)
- ISSN: 00200190
- DOI: 10.1016/0020-0190(86)90091-8
Available from www.csse.monash.edu.au
or
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.
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
10 Readers on Mendeley
by Discipline
by Academic Status
40% Professor
30% Student (Master)
10% Doctoral Student
by Country
40% Saudi Arabia
10% United Kingdom
10% Japan
