An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
Approximation algorithms for hitting objects with straight lines
Discrete Applied Mathematics
On the complexity of testing for odd holes and induced odd paths
Discrete Mathematics
Structural properties and decomposition of linear balanced matrices
Mathematical Programming: Series A and B
On physical mapping and the consecutive ones property for sparse matrices
Discrete Applied Mathematics - Special volume on computational molecular biology
A Spectral Algorithm for Seriation and the Consecutive Ones Problem
SIAM Journal on Computing
On the consecutive ones property
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
A simple test for the consecutive ones property
Journal of Algorithms
A note on the consecutive ones submatrix problem
Information Processing Letters
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
A certifying algorithm for the consecutive-ones property
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computing H/D-exchange speeds of single residues from data of peptic fragments
Proceedings of the 2008 ACM symposium on Applied computing
The simultaneous consecutive ones problem
Theoretical Computer Science
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
Journal of Computer and System Sciences
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Discrete Optimization
Set covering with almost consecutive ones property
Discrete Optimization
A polynomial-time algorithm for finding a minimal conflicting set containing a given row
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Consecutive ones property testing: cut or swap
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Faster and simpler minimal conflicting set identification
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are central in computational molecular biology, in particular for physical mapping and ancestral genome reconstruction. In 1972, Tucker gave a characterization of matrices that have the C1P by a set of forbidden submatrices, and a substantial amount of research has been devoted to the problem of efficiently finding such a minimum size forbidden submatrix. This paper presents a new O(Δ3m2(mΔ + n3)) time algorithm for this particular task for a m×n binary matrix with at most Δ 1-entries per row, thereby improving the O(Δ3m2(mn + n3)) time algorithm of Dom et al. [17].