The greedy algorithm for edit distance with moves (Q1045883): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2005.08.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030016852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / 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: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / 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: Q4737692 / rank
 
Normal rank

Latest revision as of 08:17, 2 July 2024

scientific article
Language Label Description Also known as
English
The greedy algorithm for edit distance with moves
scientific article

    Statements

    The greedy algorithm for edit distance with moves (English)
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    0 references
    edit distance with moves
    0 references
    approximation algorithms
    0 references
    analysis of algorithms
    0 references
    greedy algorithm
    0 references
    string matching
    0 references
    0 references