An algorithm with linear expected running time for string editing with substitutions and substring reversals (Q963370): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming cabbage into turnip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for approximate string matching with swaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block edit models for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate nearest neighbors and sequence comparison with block operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for sequence comparison with block reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and computation of evolutionary distances: Pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Processing and Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank

Latest revision as of 17:32, 2 July 2024

scientific article
Language Label Description Also known as
English
An algorithm with linear expected running time for string editing with substitutions and substring reversals
scientific article

    Statements

    An algorithm with linear expected running time for string editing with substitutions and substring reversals (English)
    0 references
    0 references
    19 April 2010
    0 references
    0 references
    algorithms
    0 references
    edit distance
    0 references
    substring reversal
    0 references
    dynamic programming
    0 references
    expected running time
    0 references
    0 references