On the use of decision diagrams for finding repetition-free longest common subsequences (Q2679779)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the use of decision diagrams for finding repetition-free longest common subsequences |
scientific article; zbMATH DE number 7645983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the use of decision diagrams for finding repetition-free longest common subsequences |
scientific article; zbMATH DE number 7645983 |
Statements
On the use of decision diagrams for finding repetition-free longest common subsequences (English)
0 references
25 January 2023
0 references
repetition-free longest common subsequence
0 references
decision diagram
0 references
maximum independent set
0 references
0.8006880283355713
0 references
0.7844740748405457
0 references
0.7657338380813599
0 references
0.7617653608322144
0 references
0.760569155216217
0 references
