Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence (Q1029349)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence |
scientific article |
Statements
Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence (English)
0 references
10 July 2009
0 references
algorithms
0 references
longest common subsequence
0 references
topological sort
0 references
0 references
0 references
