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

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 3, 2008, Pages 1022-1039

  Bergeron, Anne ^a   Chauve, Cedric ^b   De Montgolfier, Fabien ^c   Raffinot, Mathieu ^b  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Common interval; Modular decomposition; Permutation; Pq tree

Indexed keywords

COMMON INTERVAL; COMMON INTERVALS; K PERMUTATIONS; LINEAR SPACES; MODULAR DECOMPOSITION; NEW APPROACHES; PERMUTATION; PQ-TREE; QUADRATIC NUMBER; SIMPLE AND EFFICIENT ALGORITHMS;

ALGORITHMS;

COMPUTER SCIENCE;

EID: 69649089147     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/060651331     Document Type: Article

References (19)

1. S. Bérard, A. Bergeron, and C. Chauve, Conserved structures in evolution scenarios, in Comparative Genomics, RECOMB 2004 International Workshop, Lect. Notes in Bioinform. 3388, Springer-Verlag, Berlin, 2004, pp. 1-15.
2. A. Bergeron, C. Chauve, F. de Montgolfier, and M. Raffinot, Computing common intervals of K permutations, with applications to modular decomposition of graphs, in Proceedings of the 13th Annual European Symposium on Algorithms (ESA), Lecture Notes in Comput. Sci. 3669, Springer-Verlag, Berlin, 2005, pp. 779-790.
3. S. Booth and G. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-trees algorithms, J. Comput. System Sci., 13 (1976), pp. 335-379.
4. A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph Classes: A Survey, SIAM Monogr. Discrete Math. Appl. 3, SIAM, Philadelphia, 1999.
5. B. M. Bui Xuan, M. Habib, and C. Paul, Revisiting T. Uno and M. Yagiura's algorithm, in Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Comput. Sci. 3827, Springer-Verlag, Berlin, 2005, pp. 146-155.
6. C. Capelle and M. Habib, Graph decompositions and factorizing permutations, in Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems (ISTCS), IEEE Computer Society, New York, 1997, pp. 132-143.
7. M. Chein, M. Habib, and M. C. Maurer, Partitive hypergraphs, Discrete Math., 37 (1981), pp. 35-50.
8. A. Cournier and M. Habib, A new linear algorithm for modular decomposition, in Proceedings of the 19th International Colloquium of Trees in Algebra and Programming (CAAP), Lecture Notes in Comput. Sci. 787, Springer-Verlag, Berlin, 1994, pp. 68-84.
9. E. Dahlhaus, J. Gustedt, and R. M. McConnell, Efficient and practical algorithms for sequential modular decomposition, J. Algorithms, 41 (2001), pp. 360-387.
10. M. FIGEAC and J.-S. Varré, Sorting by reversals with common intervals, in Proceedings of the 4th International Workshop of Algorithms in Bioinformatics (WABI), Lecture Notes in Comput. Sci. 3240, Springer-Verlag, Berlin, 2004, pp. 26-37.
11. M. Habib, F. de Montgolfier, and C. Paul, A simple linear-time modular decomposition algorithm for graphs, using order extension, in Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT), Lecture Notes in Comput. Sci. 3111, Springer-Verlag, Berlin, 2004, pp. 187-198.
12. S. Heber and J. Stoye, Finding all common intervals of k permutations, in Proceedings of the 12th Annual Symposium of Combinatorial Pattern Matching (CPM), Lecture Notes in Comput. Sci. 2089, Springer-Verlag, Berlin, 2001, pp. 207-218.
13. G. M. Landau, L. Parida, and O. Weimann, Gene proximity analysis across whole genomes via PQ trees, J. Comput. Biol., 12 (2005), pp. 1289-1306.
14. R. M. McConnell and F. de Montgolfier, Algebraic operations on PQ-trees and modular decomposition trees, in Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Comput. Sci. 3787, Springer-Verlag, Berlin, 2005, pp. 421-432.
15. R. M. McConnell and J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, in Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1994, pp. 536-545.
16. R. M. McConnell and J. Spinrad, Ordered vertex partitioning, Discrete Math. Theor. Comput. Sci., 4 (2000), pp. 45-60.
17. R. H. Möhring and F. J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Ann. Discrete Math., 19 (1984), pp. 257-356.
18. A. Schrijver, Combinatorial Optimization, Springer-Verlag, Berlin, 2003.
19. T. UNO and M. YAGIURA, Fast algorithms to enumerate all common intervals of two permutations, Algorithmica, 26 (2000), pp. 290-309.