Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem (Q3196388): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Approximability of Comparing Genomes with Duplicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inapproximability of the exemplar conserved interval distance problem of genomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Syntactic versus Computational Views of Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-breaking Similarity of Genomes with Gene Repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of the Exemplar Breakpoint Distance Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithm for the Two-Sided Scaffold Filling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete / rank
 
Normal rank

Latest revision as of 23:17, 10 July 2024

scientific article
Language Label Description Also known as
English
Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references