Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

longest common subsequence problem · Vinony

EntityQ141001· pop 19· linked from 79 articles

longest common subsequence problem

Sign in to save

the problem of finding a sequence that is a subsequence of each of a given set of sequences and is as long as possible

Connections

computer science

International Standard Book Number

digital object identifier

regular expression

computational linguistics

Levenshtein distance

dynamic programming

Categories

Combinatorics Dynamic programming NP-complete problems Polynomial-time problems Problems on strings

Sources

wikipedia.externallinksexternallink

What links here79 pages

Hirschberg's algorithm

Jaro–Winkler distance

Levenshtein distance

longest increasing subsequence

Aho–Corasick algorithm

Boyer–Moore string search algorithm

regular expression

ternary search tree

bitap algorithm

Hamming distance

Knuth–Morris–Pratt algorithm

Damerau–Levenshtein distance

Tracy–Widom distribution

Václav Chvátal

string-searching algorithm

computational biology

regular grammar

Markov algorithm

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

longest train services

Entitydist 0.64

Entitydist 0.64

dynamic programming

Entitydist 0.68

Entitydist 0.68

binary search algorithm

Entitydist 0.70

partition of an interval

Entitydist 0.71

Template:Str sub long

Entitydist 0.71

Entitydist 0.72

Entitydist 0.73

Shortest remaining time

Entitydist 0.73

worst-case execution time

Entitydist 0.73

Colletes longiceps

Entitydist 0.73