Longest common subsequence problem for unoriented and cyclic strings (Q868937): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2006.10.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2006.10.002 / rank | |||
Normal rank | |||
Latest revision as of 06:11, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Longest common subsequence problem for unoriented and cyclic strings |
scientific article |
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
