On The Parameterized Intractability Of Motif Search Problems*

Author： Fellows Michael   Gramm† Jens   Niedermeier‡ Rolf  

Publisher： Springer Publishing Company

ISSN： 0209-9683

Source： Combinatorica, Vol.26, Iss.2, 2006-04, pp. : 141-167

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Intractability Results for Positive Quadrature Formulas and Extremal Problems for Trigonometric Polynomials

By Novak E.  

Journal of Complexity, Vol. 15, Iss. 3, 1999-09 ,pp. : 299-316

Academic Press

Access to resources Recommend Favorite

On the parameterized complexity of the Multi-MCT and Multi-MCST problems

By Chen Wenbin   Schmidt Matthew   Samatova Nagiza  

Journal of Combinatorial Optimization, Vol. 21, Iss. 2, 2011-02 ,pp. : 151-158

Springer Publishing Company

Access to resources Recommend Favorite

Parameterized complexity of basic decision problems for tree automata

By Charatonik Witold  

International Journal of Computer Mathematics, Vol. 90, Iss. 6, 2013-06 ,pp. : 1150-1170

Taylor & Francis Ltd

Access to resources Recommend Favorite

Intractability Results for Integration and Discrepancy

By Novak E.   Woźniakowski H.  

Journal of Complexity, Vol. 17, Iss. 2, 2001-06 ,pp. : 388-441

Academic Press

Access to resources Recommend Favorite

Parameterized preconditioned Hermitian and skew-Hermitian splitting iteration method for saddle-point problems

By Li Xu   Yang Ai-Li   Wu Yu-Jiang  

International Journal of Computer Mathematics, Vol. 91, Iss. 6, 2014-06 ,pp. : 1224-1238

Taylor & Francis Ltd

Access to resources Recommend Favorite