The set of parameterized \(k\)-covers problem (Q418000): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059909702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal superprimitivity testing for strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient detection of quasiperiodicities in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line string superprimitivity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to compute all the covers of a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover Array String Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the cover array in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results for the \(k\)-covers problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized approximate regularities in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized pattern matching: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alphabet dependence in parameterized matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate parameterized matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple matching of parameterized patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Longest Common Parameterized Subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375757 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 04:44, 5 July 2024

scientific article
Language Label Description Also known as
English
The set of parameterized \(k\)-covers problem
scientific article

    Statements

    The set of parameterized \(k\)-covers problem (English)
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    parameterized pattern matching
    0 references
    set of \(k\)-covers
    0 references
    NP-complete
    0 references
    logical models
    0 references

    Identifiers