Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728)
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: Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion |
scientific article; zbMATH DE number 6388499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion |
scientific article; zbMATH DE number 6388499 |
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
0 references
0 references
0 references
0 references
0 references
0.9031983017921448
0 references
0.8932847380638123
0 references
0.8837401270866394
0 references
0.8325555324554443
0 references
