One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) that exhibit similar expression patterns. This is the so-called biclustering problem. In this paper, we consider two variations of the biclustering problem: the consensus submatrix problem and the bottleneck submatrix pr...

We study in this paper computational and statistical boundaries for submatrix localization. Given one observation of (one or multiple non-overlapping) signal submatrix (of magnitude λ and size km×kn) embedded in a large noise matrix (of size m × n), the goal is to optimal identify the support of the signal submatrix computationally and statistically. Two transition thresholds for the signal to ...

In this paper, an iterative method is proposed for solving the matrix inverse problem AX = B for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix A0, a solution A ∗ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of init...

Let A be a nonnegative idempotent matrix. It is shown that the Schur complement of a submatrix, using the Moore-Penrose inverse, is a nonnegative idempotent matrix if the submatrix has a positive diagonal. Similar results for the Schur complement of any submatrix of A are no longer true in general.

Let A be a nonnegative idempotent matrix. It is shown that the Schur complement of a submatrix, using the Moore-Penrose inverse, is a nonnegative idempotent matrix if the submatrix has a positive diagonal. Similar results for the Schur complement of any submatrix of A are no longer true in general.

In this paper we investigate some matrix structures on C that have a good behaviour under Schur complementation. The first type of structure is closely related to low displacement rank matrices. Next, we show that for a matrix having a low rank submatrix, also the Schur complement must have a low rank submatrix, which we can explicitly determine. This property holds even if the low rank submatr...

We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the problem to find a maximum-size submatrix of a 0/1-matrix such that the submatrix has the C1P. Moreover, we achieve a proble...