The Protein Threading Problem is in P? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

The Protein Threading Problem is in P?

Abstract

This work is about a problem from computational biology known as protein threading problem. By finding out an appropriate linear mixed-integer programming (MIP) formulation we demonstrate that the real-live instances of this problem could be efficiently solved by using only some linear-programming (LP) solver instead of special-purpose branch&bound algorithm. This is due to the fact that within the frame of MIP model proposed, all biological instances, we were able to test, attain their optima at feasible vertices of the underlying LP polytope which is the essence of the statement in the title.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4577.pdf (278.31 Ko) Télécharger le fichier

Dates and versions

inria-00072011 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072011 , version 1

Cite

Nicola Yanev, Rumen Andonov. The Protein Threading Problem is in P?. [Research Report] RR-4577, INRIA. 2002. ⟨inria-00072011⟩
149 View
105 Download

Share

Gmail Facebook X LinkedIn More