On the complexity of finding common approximate substrings. (Q1426464): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The parameterized complexity of sequence alignment and consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering problems of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474112 / 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: Q4252342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding similar regions in many strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723943 / 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: Pattern recognition in several sequences: Consensus and alignment / rank
 
Normal rank

Revision as of 14:54, 6 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of finding common approximate substrings.
scientific article

    Statements

    On the complexity of finding common approximate substrings. (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    Parameterized complexity
    0 references
    Pattern matching
    0 references
    Common approximate substring
    0 references

    Identifiers