A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm (Q507395): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Efficient string matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms on Strings, Trees and Sequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding approximate patterns in strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A faster algorithm computing string edit distances / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3651735 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for approximate string matching / rank | |||
Normal rank | |||
Revision as of 08:54, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm |
scientific article |
Statements
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm (English)
0 references
6 February 2017
0 references
approximate string matching
0 references
edit distance
0 references
Four-Russians' algorithm
0 references
parallelization
0 references
