The maximum similarity partitioning problem and its application in the transcriptome reconstruction and quantification problem
by Alex Z. Zaccaron; Said S. Adi; Carlos H.A. Higa; Eloi Araujo
International Journal of Innovative Computing and Applications (IJICA), Vol. 7, No. 3, 2016

Abstract: Reconstruct and quantify the RNA molecules in a cell at a given moment is an important problem in molecular biology that allows one to know which genes are being expressed and at which intensity level. Such problem is known as transcriptome reconstruction and quantification problem (TRQP). Although several approaches were already designed for the TRQP, none of them model it as a combinatorial optimisation problem over strings. In order to narrow this gap, we present here a new combinatorial optimisation problem called maximum similarity partitioning problem (MSPP) that models the TRQP. In addition, we prove that the MSPP is NP-complete in the strong sense and present a greedy heuristic for it and some experimental results.

Online publication date: Thu, 01-Sep-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com