The longest filled common subsequence problem (Q5110878): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
The longest filled common subsequence problem | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2017.14 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2742408471 / rank | |||
Normal rank | |||
| Property / title | |||
The longest filled common subsequence problem (English) | |||
| Property / title: The longest filled common subsequence problem (English) / rank | |||
Normal rank | |||
Revision as of 08:34, 30 July 2024
scientific article; zbMATH DE number 7203319
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The longest filled common subsequence problem |
scientific article; zbMATH DE number 7203319 |
Statements
25 May 2020
0 references
longest common subsequence
0 references
approximation algorithms
0 references
computational complexity
0 references
fixed-parameter algorithms
0 references
The longest filled common subsequence problem (English)
0 references
