Classes of cost functions for string edit distance (Q1355732): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Horst Bunke / rank
Normal rank
 
Property / author
 
Property / author: Horst Bunke / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric optimization of sequence alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(ND)\) difference algorithm and its variations / rank
 
Normal rank

Latest revision as of 12:49, 27 May 2024

scientific article
Language Label Description Also known as
English
Classes of cost functions for string edit distance
scientific article

    Statements

    Classes of cost functions for string edit distance (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 May 1997
    0 references
    0 references
    minimum cost
    0 references
    edit distance
    0 references
    longest common subsequence
    0 references