PHP implementation of an algorithm to solve the longest common subsequence problem.
PHP-Longest-Common-Subsequence is a PHP implementation of an algorithm to solve the 'longest common subsequence' problem.
From Wikipedia - Longest common subsequence problem:
The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from the longest common substring problem: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences. The longest common subsequence problem is a classic computer science problem, the basis of data comparison programs such as the diff utility, and has applications in bioinformatics. It is also widely used by revision control systems such as Git for reconciling multiple changes made to a revision-controlled collection of files.
This PHP implementation is based on eloquent/php-lcs, adding a little more flexibility in order to handle, not only the common text, but also the differences.
Require triun/longest-common-subsequence package with composer using the following command:
composer require triun/longest-common-subsequenceuse Triun\LongestCommonSubsequence\Solver;
$solver = new Solver;
$sequenceA = array('B', 'A', 'N', 'A', 'N', 'A');
$sequenceB = array('A', 'T', 'A', 'N', 'A');
// calculates the LCS to be array('A', 'A', 'N', 'A')
$lcs = $solver->solve($sequenceA, $sequenceB);Bug reports and feature requests can be submitted on the Github Issue Tracker.
See CONTRIBUTING.md for information.
This repository is open-sourced software licensed under the MIT license