The string merging problem (Q1154285): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Code Generation for Expression Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studies in abstract families of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing maximal common subsequences / 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: An Extension of the String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Sequences under Deletion/Insertion Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the distance between two finite sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the String Editing Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:42, 13 June 2024

scientific article
Language Label Description Also known as
English
The string merging problem
scientific article

    Statements

    The string merging problem (English)
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    21, 20-30 (1981)
    0 references
    string modification
    0 references
    string matching
    0 references
    costs of editing
    0 references
    longest common subsequence
    0 references
    shortest common supersequence
    0 references