A Fixed Parameter Tractable Integer Program for Finding the Maximum Order Preserving Submatrix

Abstract : Order-preserving submatrices are an important tool for the analysis of gene expression data. As finding large order-preserving submatrices is a computationally hard problem, previous work has investigated both exact but exponential-time as well as polynomial-time but inexact algorithms for finding large order-preserving submatrices. In this paper, we propose a novel exact algorithm to find maximum order preserving submatrices which is fixed parameter tractable with respect to the number of columns of the provided gene expression data. In particular, our algorithm is based on solving a sequence of mixed integer linear programs and it exhibits better guarantees as well as better runtime performance as compared to the state-of-the-art exact algorithms. Our empirical study in benchmark datasets shows large improvement in terms of computational speed.
Document type :
Conference papers
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-00641896
Contributor : Gemma C Garriga <>
Submitted on : Tuesday, April 17, 2012 - 6:35:04 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on : Monday, November 26, 2012 - 2:50:50 PM

File

icdm-2011.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00641896, version 1

Collections

Citation

Jens Humrich, Thomas Gaertner, Gemma Garriga. A Fixed Parameter Tractable Integer Program for Finding the Maximum Order Preserving Submatrix. Proceedings of the IEEE International Conference of Data Mining, ICDM 2011, Dec 2011, Vancouver, Canada. ⟨hal-00641896⟩

Share

Metrics

Record views

609

Files downloads

496