On recovering syntenic blocks from comparative maps (Q1041433): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting constrained 2-interval subsets in 2-interval sets / 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: Linear FPT reductions and computational lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for largest cardinality 2-interval pattern problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the 2-interval pattern problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of 2-interval pattern matching problems / rank
 
Normal rank

Latest revision as of 06:30, 2 July 2024

scientific article
Language Label Description Also known as
English
On recovering syntenic blocks from comparative maps
scientific article

    Statements

    On recovering syntenic blocks from comparative maps (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2009
    0 references
    0 references
    NP-completeness
    0 references
    approximation algorithms
    0 references
    bioinformatics
    0 references
    0 references