Computing Common Intervals of $K$ Permutations, with Applications to Modular Decomposition of Graphs

Authors:
Anne Bergeron;Cedric Chauve;Fabien de Montgolfier;Mathieu Raffinot
Affiliations:
bergeron.anne@uqam.ca;cedric.chauve@sfu.ca;fm@liafa.jussieu.fr and raffinot@liafa.jussieu.fr;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2008

Citing 0
Cited 7

Solving the Preserving Reversal Median Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Algorithmic aspects of a general modular decomposition theory

Discrete Applied Mathematics
Average-Case Analysis of Perfect Sorting by Reversals

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Finding Nested Common Intervals Efficiently

RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
New applications of interval generators to genome comparison

Journal of Discrete Algorithms
Survey: A survey of the algorithmic aspects of modular decomposition

Computer Science Review
Preserving inversion phylogeny reconstruction

WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new approach to compute the 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.