Parameterized complexity and approximability of the longest compatible sequence problem (Q456697): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q391096
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sylvain Guillemot / rank
 
Normal rank
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.disopt.2010.08.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027343828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogs & duals of the MAST problem for sequences & trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5471630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematics of Voting and Elections: A Hands-On Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of sequence alignment and consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits fractionally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of short computation and factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4544433 / rank
 
Normal rank

Latest revision as of 18:13, 5 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity and approximability of the longest compatible sequence problem
scientific article

    Statements

    Parameterized complexity and approximability of the longest compatible sequence problem (English)
    0 references
    16 October 2012
    0 references
    parameterized complexity
    0 references
    sequence comparison
    0 references
    longest common subsequence
    0 references
    longest compatible sequence
    0 references
    0 references

    Identifiers