Computing common intervals of K permutations, with applications to modular decomposition of graphs

Authors:
Anne Bergeron;Cedric Chauve;Fabien de Montgolfier;Mathieu Raffinot
Affiliations:
Département d’informatique, Université du Québec à Montréal, Canada;Département d’informatique, Université du Québec à Montréal, Canada;LIAFA, Université Denis Diderot – Case 7014, Paris, France;CNRS – Laboratoire Génome et Informatique, Evry, France
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 8
Cited 16

Linear-time modular decomposition and efficient transitive orientation of comparability graphs

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient and practical algorithms for sequential modular decomposition

Journal of Algorithms
Finding All Common Intervals of k Permutations

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A New Linear Algorithm for Modular Decomposition

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Graph decompositions and factorizing permutations

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Algebraic operations on PQ trees and modular decomposition trees

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Conservation of combinatorial structures in evolution scenarios

RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics

Perfect Sorting by Reversals Is Not Always Difficult

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Competitive graph searches

Theoretical Computer Science
A more efficient algorithm for perfect sorting by reversals

Information Processing Letters
New algorithms for text fingerprinting

Journal of Discrete Algorithms
An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree

RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Perfect DCJ Rearrangement

RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Solving the Preserving Reversal Median Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Faster Text Fingerprinting

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
A fast and exact algorithm for the perfect reversal median problem

ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
Computation of median gene clusters

RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Ultra-perfect sorting scenarios

RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Gapped permutation patterns for comparative genomics

WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Revisiting t. uno and m. yagiura's algorithm

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Perfect sorting by reversals is not always difficult

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
An algorithmic view on multi-related-segments: a unifying model for approximate common interval

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Longest common separable pattern among permutations

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple and efficient algorithms to compute the set of all common intervals of K permutations, that can contain a quadratic number of intervals, as well as a linear space basis of this set of common intervals. Finally, we show how our results on permutations can be used for computing the modular decomposition of graphs in linear time.