Searching subsequences (Q2638800): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The longest common subsequence problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
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: The smallest automaton recognizing the subwords of a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calcul de la distance par les sous-mots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a longest common subsequence for a set of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information-theoretic lower bound 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: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank

Latest revision as of 13:45, 21 June 2024

scientific article
Language Label Description Also known as
English
Searching subsequences
scientific article

    Statements

    Searching subsequences (English)
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    subsequence search
    0 references
    finite automaton
    0 references
    longest common subsequence problem
    0 references
    0 references