Maximal strip recovery problem with gaps: hardness and approximation algorithms (Q2434927): 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.jda.2012.12.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007237784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triangulating planar graphs under the four-connectivity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability and Approximability of Maximal Strip Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and applications of models of computation. 6th annual conference, TAMC 2009, Changsha, China, May 18--22, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Recovering Syntenic Blocks from Comparative Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recovering syntenic blocks from comparative maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximating bounded variants of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16--18, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum common string partition problem: hardness and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Maximal Strip Recovery: II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of maximal strip recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for the complementary maximal strip recovery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the complementary maximal strip recovery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of Vizing's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tractability of Maximal Strip Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems / rank
 
Normal rank

Latest revision as of 07:12, 7 July 2024

scientific article
Language Label Description Also known as
English
Maximal strip recovery problem with gaps: hardness and approximation algorithms
scientific article

    Statements

    Maximal strip recovery problem with gaps: hardness and approximation algorithms (English)
    0 references
    0 references
    0 references
    0 references
    3 February 2014
    0 references
    algorithmic complexity
    0 references
    approximation algorithms
    0 references
    comparative maps
    0 references
    genome comparison
    0 references
    synteny blocks
    0 references
    0 references
    0 references
    0 references

    Identifiers

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