Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence (Q1029349)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence |
scientific article; zbMATH DE number 5577386
| 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; zbMATH DE number 5577386 |
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
0.87370276
0 references
0.85834014
0 references
0.85834014
0 references
0.8574102
0 references
0.85319704
0 references
0.8526275
0 references
0.8513877
0 references
