Maximal common connected sets of interval graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3109, Issue , 2004, Pages 359-372

  Habib, Michel ^a   Paul, Christophe ^a   Raffinot, Mathieu ^b  

^a CNRS   (France)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; PATTERN MATCHING;

COMPUTATIONAL BIOLOGY; CONNECTED SETS; INCLUSION ORDERING; INPUT GRAPHS; INTERVAL GRAPH; MAXIMAL CLIQUE; PATH DECOMPOSITION; TIME ALGORITHMS;

GRAPH THEORY;

EID: 33646932629     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_27     Document Type: Article

References (14)

1. M.-P. Béal, A. Bergeron, and M. Raffinot. Gene Teams and Hopcroft's Partionning Framework. 2003. Submitted.
2. A. Bergeron, S. Corteel, and M. Raffinot. The algorithmic of gene teams. In Workshop on Algorithms in Bioinformatics (WABI), number 2452 in Lecture Notes in Computer Science, pages 464-476. Springer-Verlag, Berlin, 2002.
3. H. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11(1-2), 1993.
4. K.S. Booth and G.S. Lueker. Testing for the consecutive ones properties, interval graphs and graph planarity using pq-tree algorithm. J. Comput. Syst. Sci., 13:335-379, 1976.
5. 2 |V|). Theoretical Computer Science, 19(1):85-98, 1982.
6. D.G. Corneil, S. Olariu, and L. Stewart. The ultimate interval graph recognition algorithm? In Proceedings of the ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 175-180, 1998.
7. G.A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Uni. Hamburg, 25, 1961.
8. A.-T. Gai, M. Habib, G. Paul, and M. Raffinot. Identifying Common Connected Components of Graphs. Technical report, (RR-LIRMM-03016), 2003. http://www.lirmm.fr/~paul.
9. P. Galinier, M. Habib, and C. Paul. Chordal graphs and their clique graph. In M. Nagl (Ed.), editor, Graph-Theoretic Concepts in Computer Science, WG'95, volume 1017 of Lecture Notes in Computer Science, pages 358-371, Aachen, Germany, June 1995. 21st Internationnal Workshop WG'95, Springer.
10. M. Habib, R. McConnell, C. Paul, and L. Viennot. Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoretical Computer Science, 234:59-84, 2000.
11. J. Holm, K. De Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. Journal of the ACM, 48(4):723-760, 2001.
12. J. E. Hopcroft. An n log n algorithm for minimizing the states in a finite automaton. In Z. Kohavi, editor, The Theory of Machines and Computations, pages 189-196. Academic Press, 1971.
13. C.G. Lekkerkerker and J.C. Boland. Representation of a finite graph by a set of intervals on the real line. Fund. Math., 51:45-64, 1962.
14. TERAPROT project. http://www.infobiogen.fr/services/Teraprot/.