Doubly-constrained LCS and hybrid-constrained LCS problems revisited (Q436604)
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 6059709
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Doubly-constrained LCS and hybrid-constrained LCS problems revisited |
scientific article; zbMATH DE number 6059709 |
Statements
Doubly-constrained LCS and hybrid-constrained LCS problems revisited (English)
0 references
25 July 2012
0 references
finite automata
0 references
longest common subsequence
0 references
algorithms
0 references
combinatorial problems
0 references
0 references
0.8660749793052673
0 references
0.8406702876091003
0 references
0.8319194912910461
0 references
0.8282691240310669
0 references
0.8174647092819214
0 references
