String factorisations with maximum or minimum dimension (Q2006777): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1912.10140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genome Rearrangements and Sorting by Reversals / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping the genome / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing equality-free and repetitive string factorisations / rank
 
Normal rank

Latest revision as of 19:57, 23 July 2024

scientific article
Language Label Description Also known as
English
String factorisations with maximum or minimum dimension
scientific article

    Statements

    String factorisations with maximum or minimum dimension (English)
    0 references
    0 references
    0 references
    12 October 2020
    0 references
    string factorisation
    0 references
    NP-hard problems
    0 references
    approximation algorithms
    0 references

    Identifiers