GitHub

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 ...
GitHub

Herrera741/Longest-Non-Increasing-Subsequence

In this project you will design, implement, and analyze two algorithms for the same problem. For this problem, you will design two separate algorithms, describe the algorithms using clear pseudocode, ...
IEEE

Heuristic Algorithms for the Longest Filled Common Subsequence Problem

Abstract: At CPM 2017, Castelli et al. define and study a new variant of the Longest Common Subsequence Problem, termed the Longest Filled Common Subsequence Problem (LFCS). For the LFCS problem, the ...
www.cs.utexas.edu

The problem of the maximum length of an ascending subsequence.

We consider a sequence of N elements A(1) through A(N) . The order of increasing subscript value will be denoted by “the order from left to right”. From such a sequence we can take so-called ...