Software reliability via run-time result-checking
Journal of the ACM (JACM)
Graph classes: a survey
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Introduction to Algorithms
Certifying algorithms for recognizing interval graphs and permutation graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Banded structure in binary matrices
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
A note on computing set overlap classes
Information Processing Letters
Phylogenetic graph models beyond trees
Discrete Applied Mathematics
Prediction of Contiguous Regions in the Amniote Ancestral Genome
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Discrete Applied Mathematics
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
Approximability and parameterized complexity of consecutive ones submatrix problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Proper Helly circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
A faster algorithm for finding minimum tucker submatrices
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
On counting interval lengths of interval graphs
Discrete Applied Mathematics
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
Tractability results for the consecutive-ones property with multiplicity
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Consecutive ones property testing: cut or swap
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Using PQ trees for comparative genomics
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Algebraic operations on PQ trees and modular decomposition trees
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Very fast instances for concept generation
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Computer Science Review
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix
Information Processing Letters
Hardness results on the gapped consecutive-ones property problem
Discrete Applied Mathematics
| Hi-index | 0.01 |
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set family does not have the property. The forbidden substructure has size O(n), where n is the size of the domain. The PQ tree is a well-known data structure for representing all consecutive-ones orderings. We show that it is given by a substitution decomposition of arbitrary set families that has not been described previously. This observation gives a generalization of the PQ tree to arbitrary set families, and we give a linear-time algorithm to compute it.