Efficient algorithms for the block edit problems (Q963999): 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.ic.2009.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002423246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming algorithms for the mosaic longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding interleaving relationship between sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and fast linear space computation of longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Detecting and Error Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy algorithm for the minimum common string partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy algorithm for edit distance with moves / 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: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Processing and Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edit distance with move operations / 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: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250214 / 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: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485338 / rank
 
Normal rank

Latest revision as of 16:16, 2 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for the block edit problems
scientific article

    Statements

    Efficient algorithms for the block edit problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 April 2010
    0 references
    design of algorithms
    0 references
    string edit distance
    0 references
    block-edit
    0 references
    similarity
    0 references
    dynamic programming
    0 references

    Identifiers