Compare items in two sequences to find a longest common subsequence

Compare items in two sequences to find a longest common subsequence

Find the longest common subsequence.

Zero dependency Metric Longest Common Subsequence implementation in js

An NPM package for checking if an array is a [subsequence](https://en.wikipedia.org/wiki/Subsequence) of another array.

Generates a linearly spaced index array from a subsequence string.

Get the longest common subsequence of two strings as described in https://en.wikipedia.org/wiki/Longest_common_subsequence_problem

Implementation of the longest common subsequence (diff) algorithm.

Picks an arbitrary subsequence.

Picks an arbitrary subsequence.

Checks if array has a subsequence.

Checks if array has a subsequence.

A JavaScript library to diff two images. Uses the Longest-Common-Subsequence algorithm to allow content to shift.

Checks if array has a subsequence.

Longest Increasing Subsequence algorithm implementation in vanilla JavaScript

Finds first index of a subsequence.

Compare items in two sequences to find a longest common subsequence

Search for a given subsequence in a list of strings and transform the resulting list as required

Checks if array has a subsequence.

Create an iterator which returns a subsequence of iterated values from a provided iterator.