Exact algorithms for the bounded repetition longest common subsequence problem (Q2180128)
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 7200282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for the bounded repetition longest common subsequence problem |
scientific article; zbMATH DE number 7200282 |
Statements
Exact algorithms for the bounded repetition longest common subsequence problem (English)
0 references
13 May 2020
0 references
0.9301264882087708
0 references
0.8378525376319885
0 references
0.8279503583908081
0 references
0.8274133205413818
0 references
