Efficient algorithms for approximate string matching with swaps (Q1288533): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sparse dynamic programming I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data structures and algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm For Approximate String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel and serial approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(ND)\) difference algorithm and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate string matching with suffix automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank

Latest revision as of 20:06, 28 May 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for approximate string matching with swaps
scientific article

    Statements