Finding the gapped longest common subsequence by incremental suffix maximum queries (Q2252523)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the gapped longest common subsequence by incremental suffix maximum queries |
scientific article |
Statements
Finding the gapped longest common subsequence by incremental suffix maximum queries (English)
0 references
18 July 2014
0 references
algorithm
0 references
longest common subsequence
0 references
incremental suffix maximum query
0 references
0 references
