Longest common subsequence problem for unoriented and cyclic strings (Q868937)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5129779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Longest common subsequence problem for unoriented and cyclic strings |
scientific article; zbMATH DE number 5129779 |
Statements
Longest common subsequence problem for unoriented and cyclic strings (English)
0 references
26 February 2007
0 references
longest common subsequence
0 references
LCS
0 references
cyclic string
0 references
sequence comparison
0 references
pattern recognition
0 references
graph
0 references
hypergraph
0 references
maximum stable set
0 references
maximum independent set
0 references
approximation
0 references
parameterized complexity
0 references
NP-hard
0 references
W[1]-hard
0 references
0 references
0.8171538710594177
0 references
0.812114417552948
0 references
0.8051212430000305
0 references
0.8047090768814087
0 references
0.8024789094924927
0 references
