A learning algorithm for the longest common subsequence problem (Q5463438): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4886052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942627 / 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: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences / 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: Q4398828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(ND)\) difference algorithm and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A longest common subsequence algorithm suitable for similar text strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(NP) sequence comparison algorithm / rank
 
Normal rank

Latest revision as of 14:45, 10 June 2024

scientific article; zbMATH DE number 2192067
Language Label Description Also known as
English
A learning algorithm for the longest common subsequence problem
scientific article; zbMATH DE number 2192067

    Statements

    A learning algorithm for the longest common subsequence problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2005
    0 references
    0 references
    learning algorithm
    0 references
    longest common subsequence
    0 references
    0 references