Computing a longest common subsequence for a set of strings (Q786541): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Bounds on the Complexity of the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common subsequences of two random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the length of longest increasing subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Systems for Syntactic Pattern Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding minimal length superstrings / 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: Algorithms for the Longest Common Subsequence Problem / 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: The string merging problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / 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: A Sentence-to-Sentence Clustering Procedure for Pattern Analysis / 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: A faster algorithm computing string edit distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spelling correction in systems programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the longest-common-subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Sequences under Deletion/Insertion Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree-to-tree editing problem / 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: Q4133128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the String Editing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195901 / rank
 
Normal rank

Revision as of 10:29, 14 June 2024

scientific article
Language Label Description Also known as
English
Computing a longest common subsequence for a set of strings
scientific article

    Statements

    Computing a longest common subsequence for a set of strings (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    24, 45-59 (1984)
    0 references
    longest common subsequence
    0 references
    analysis of algorithms
    0 references
    string merging
    0 references

    Identifiers