Two shortest path metrics on well-formed parentheses strings (Q286951)
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 6585356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two shortest path metrics on well-formed parentheses strings |
scientific article; zbMATH DE number 6585356 |
Statements
Two shortest path metrics on well-formed parentheses strings (English)
0 references
26 May 2016
0 references
distance metric
0 references
lattice
0 references
parentheses
0 references
algorithms
0 references
0.7295286059379578
0 references
0.68599534034729
0 references
0.6802849769592285
0 references
0.6794868111610413
0 references
