Compare items in two sequences to find a longest common subsequence using Myers' O(ND) difference algorithm
—
Quality
Pending
Does it follow best practices?
Impact
Pending
No eval scenarios have been run
{
"name": "tessl/npm-diff-sequences",
"version": "29.6.0",
"docs": "docs/index.md",
"describes": "pkg:npm/diff-sequences@29.6.3",
"summary": "Compare items in two sequences to find a longest common subsequence using Myers' O(ND) difference algorithm"
}