Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product (Q4634027)
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 7051396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product |
scientific article; zbMATH DE number 7051396 |
Statements
Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (English)
0 references
7 May 2019
0 references
fast matrix multiplication
0 references
min-plus product
0 references
language edit distance
0 references
RNA folding
0 references
0.7518569827079773
0 references
0.7395784854888916
0 references
0.7389076948165894
0 references
0.728493869304657
0 references
0.728493869304657
0 references
