Pages that link to "Item:Q1367540"

The following pages link to The parameterized complexity of sequence alignment and consensus (Q1367540):

Displaying 21 items.

• Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
• On the parameterized complexity of the multi-MCT and multi-MCST problems (Q630185) (← links)
• On the parameterized complexity of associative and commutative unification (Q729894) (← links)
• Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
• On parameterized complexity of the multi-MCS problem (Q1019178) (← links)
• Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
• On the complexity of finding common approximate substrings. (Q1426464) (← links)
• The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706) (← links)
• Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
• \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
• The complexity of irredundant sets parameterized by size (Q1971218) (← links)
• A multiparametric view on answer set programming (Q2317973) (← links)
• Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
• Multiple genome rearrangement by swaps and by element duplications (Q2456364) (← links)
• A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
• On the Parameterized Complexity of Associative and Commutative Unification (Q2946004) (← links)
• Parameterized Complexity and Approximability of the SLCS Problem (Q3503583) (← links)
• Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)