Tractability results for the consecutive-ones property with multiplicity

Authors:
Cedric Chauve;Ján Maňuch;Murray Patterson;Roland Wittler
Affiliations:
Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada;Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada and Department of Computer Science, UBC, Vancouver, BC, Canada;Department of Computer Science, UBC, Vancouver, BC, Canada;Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada and Technische Fakultät, Universität Bielefeld, Bielefeld, Germany
Venue:
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Year:
2011

Citing 6
Cited 0

On the consecutive ones property

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

Theoretical Computer Science
A simple test for the consecutive ones property

Journal of Algorithms
A certifying algorithm for the consecutive-ones property

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Consistency of sequence-based gene clusters

RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A binary matrix has the Consecutive-Ones Property (C1P) if its columns can be ordered in such a way that all 1's in each row are consecutive. We consider here a variant of the C1P where columns can appear multiple times in the ordering. Although the general problem of deciding the C1P with multiplicity is NP-complete, we present here a case of interest in comparative genomics that is tractable.