Algorithms for closest and farthest string problems via rank distance (Q2327465)
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: Algorithms for closest and farthest string problems via rank distance |
scientific article; zbMATH DE number 7117275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for closest and farthest string problems via rank distance |
scientific article; zbMATH DE number 7117275 |
Statements
Algorithms for closest and farthest string problems via rank distance (English)
0 references
15 October 2019
0 references
0.8648406863212585
0 references
0.8182713389396667
0 references
0.7702649831771851
0 references
0.7515237331390381
0 references
