The longest run subsequence problem (Q6487630)
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 7651126
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The longest run subsequence problem |
scientific article; zbMATH DE number 7651126 |
Statements
The longest run subsequence problem (English)
0 references
7 February 2023
0 references
alignments
0 references
assembly
0 references
string algorithm
0 references
longest subsequence
0 references
0.7568378448486328
0 references
0.748000979423523
0 references
0.7437001466751099
0 references
0.7427746057510376
0 references
0.7413261532783508
0 references
