Computing equality-free and repetitive string factorisations (Q2634669): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2016.01.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2238855891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of string partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2955004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diverse Palindromic Factorization Is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exact Block Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Equality-Free String Factorisations / rank
 
Normal rank

Latest revision as of 11:36, 11 July 2024

scientific article
Language Label Description Also known as
English
Computing equality-free and repetitive string factorisations
scientific article

    Statements

    Computing equality-free and repetitive string factorisations (English)
    0 references
    0 references
    18 February 2016
    0 references
    0 references
    string factorisations
    0 references
    NP-hard string problems
    0 references
    parameterised complexity
    0 references
    multivariate algorithmics
    0 references
    0 references