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.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.04.028 / rank
Normal rank
 
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
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.04.028 / rank
 
Normal rank

Latest revision as of 19:46, 9 December 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
    0 references
    0 references
    0 references
    0 references
    6 February 2017
    0 references
    approximate string matching
    0 references
    edit distance
    0 references
    Four-Russians' algorithm
    0 references
    parallelization
    0 references

    Identifiers