Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728): Difference between revisions
From MaRDI portal
Latest revision as of 12:40, 9 July 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
0 references
0 references
0 references
0 references