Searching subsequences (Q2638800): Difference between revisions

From MaRDI portal
← Older edit
Import240304020342 (talk | contribs)
4,416,906 edits
Set profile property.
ReferenceBot (talk | contribs)
Bots
1,895,659 edits
‎Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(91)90358-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2914364168 / rank
 
Normal rank
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

    title
    Searching subsequences (English)
    0 references
    publication date
    1991
    0 references
    zbMATH Keywords
    subsequence search
    0 references
    finite automaton
    0 references
    longest common subsequence problem
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q45
    0 references
    68Q25
    0 references
    68W10
    0 references
    zbMATH DE Number
    4182848
    0 references
    OpenAlex ID
    W2914364168
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2638800&oldid=34842198"
    Powered by MediaWiki