An all-substrings common subsequence algorithm (Q2482100): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3439674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest common subsequence problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / 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: On the Common Substring Alignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a cyclic string-to-string correction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings / rank
 
Normal rank

Latest revision as of 20:33, 27 June 2024

scientific article
Language Label Description Also known as
English
An all-substrings common subsequence algorithm
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references