Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-012-9588-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2168333158 / rank | |||
Normal rank | |||
Revision as of 00:10, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion |
scientific article |
Statements
Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (English)
0 references
21 January 2015
0 references
design of algorithms
0 references
longest common subsequence
0 references
constrained LCS
0 references
NP-hard
0 references
finite automata
0 references
