An efficient algorithm for enumerating longest common increasing subsequences (Q2695270)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for enumerating longest common increasing subsequences |
scientific article |
Statements
An efficient algorithm for enumerating longest common increasing subsequences (English)
0 references
30 March 2023
0 references
LCIS
0 references
trie
0 references
data structure
0 references
