https://github.com/wollmers/p6-lcs-bv
Longest Common Subsequence implemented with Bit-Vectors
https://github.com/wollmers/p6-lcs-bv
algorithm bit-vector lcs longest-common-subsequence
Last synced: 4 months ago
JSON representation
Longest Common Subsequence implemented with Bit-Vectors
- Host: GitHub
- URL: https://github.com/wollmers/p6-lcs-bv
- Owner: wollmers
- Created: 2016-01-09T07:52:51.000Z (almost 10 years ago)
- Default Branch: master
- Last Pushed: 2017-05-16T10:18:31.000Z (over 8 years ago)
- Last Synced: 2025-03-11T13:54:33.076Z (8 months ago)
- Topics: algorithm, bit-vector, lcs, longest-common-subsequence
- Language: Perl6
- Size: 61.5 KB
- Stars: 1
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
NAME
====
LCS::BV - Bit Vector (BV) implementation of the Longest Common Subsequence (LCS) Algorithm
html
====
SYNOPSIS
========
use LCS::BV;
$lcs = LCS::BV::LCS($a,$b);
ABSTRACT
========
LCS::BV implements the Longest Common Subsequence (LCS) Algorithm and is more than double as fast (Jan 2016) than Algorithm::Diff::LCSidx().
DESCRIPTION
===========
This module is a port from the Perl5 module with the same name.
The algorithm used is based on
H. Hyyroe. A Note on Bit-Parallel Alignment Computation. In
M. Simanek and J. Holub, editors, Stringology, pages 79-87. Department
of Computer Science and Engineering, Faculty of Electrical
Engineering, Czech Technical University, 2004.
METHODS
-------
* LCS($a,$b)
Finds a Longest Common Subsequence, taking two arrayrefs as method arguments. It returns an array reference of corresponding indices, which are represented by 2-element array refs.
SEE ALSO
========
Algorithm::Diff
AUTHOR
======
Helmut Wollmersdorfer lthelmut.wollmersdorfer@gmail.comgt