Q3143773 (Q3143773): 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: Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest common subsequence problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linear-space computations of longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3985349 / 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: Q4942627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some limit results for longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / 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: New algorithms for the LCS 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: A linear space algorithm for the LCS problem / 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: 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: Q4862293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133128 / 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
Property / cites work
 
Property / cites work: An O(NP) sequence comparison algorithm / rank
 
Normal rank

Latest revision as of 23:32, 5 July 2024

scientific article
Language Label Description Also known as
English
No label defined
scientific article

    Statements

    0 references
    0 references
    4 December 2012
    0 references
    0 references
    longest common subsequence problem
    0 references
    Rick's algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references