Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q417981
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Avivit Levy / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090066232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for string matching with k mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching with k mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for approximately counting mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dictionary matching and indexing with errors and don't cares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128933 / 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: Sorting by Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting permutations by block-interchanges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching with address errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate String Matching with Address Bit Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cost of Interchange Rearrangement in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3717907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055156 / rank
 
Normal rank

Latest revision as of 01:14, 2 July 2024

scientific article
Language Label Description Also known as
English
Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
scientific article

    Statements

    Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 October 2009
    0 references
    0 references
    approximate string matching
    0 references
    rearrangement distances
    0 references
    pattern matching
    0 references
    0 references