Algebraic operations on PQ trees and modular decomposition trees

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

Volumn 3787 LNCS, Issue , 2005, Pages 421-432

  McConnell, Ross M ^a   De Montgolfier, Fabien ^b  

^a Department of Environmental and Radiological Health Sciences   (United States)

^b UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC OPERATIONS; COMBINATORIAL STRUCTURES; MODULAR DECOMPOSITION TREES; PQ TREES;

BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; GRAPH THEORY; SET THEORY; TREES (MATHEMATICS);

ALGEBRA;

EID: 33744916045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_37     Document Type: Conference Paper

References (25)

1. S. Benzer. On the topology of the genetic fine structure. Proc. Nat. Acad. Sci. U.S.A., 45:1607-1620, 1959.
2. S. Booth and S. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci., 13:335-379, 1976.
3. M. Chein, M. Habib, and M. C. Maurer. Partitive hypergraphs. Discrete Mathematics, 37:35-50, 1981.
4. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.
5. 2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs. Journal of Algorithms, 16:283-294, 1994.
6. A. Ehrenfeucht and G. Rozenberg. Theory of 2-structures, part 2: Representations through labeled tree families. Theoretical Computer Science, 70:305-342, 1990.
7. T. Gallai. Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar., 18:25-66, 1967.
8. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
9. Dan Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge, 1997.
10. Steffen Heber and Jens Stoye. Finding all common intervals of k permutations. In CPM, pages 207-218, 2001.
11. W.L. Hsu and R.M. McConnell. PC trees and circular-ones arrangements. Theoretical Computer Science, 296:59-74, 2003.
12. Gad M. Landau, Laxmi Parida, and Oren Weimann. Using pq trees for comparative genomics. In CPM'05, pages 128-143, 2005.
13. R. M. McConnell. Linear-time recognition of circular-arc graphs. Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS01), 42:386-394, 2001.
14. R. M. McConnell. A certifying algorithm for the consecutive-ones property. Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA04), 15:to appear, 2004.
15. R. M. McConnell and J. P. Spinrad. Modular decomposition and transitive orientation. Discrete Mathematics, 201(1-3):189-241, 1999.
16. R.M. McConnell. Linear-time recognition of circular-arc graphs. Algorithmica, 37:93-147, 2003.
17. R.M. McConnell and F de Montgolfier. Linear-time modular decomposition of directed graphs. Discrete Applied Mathematics, 2005.
18. R.M. McConnell and J.P. Spinrad. Construction of probe interval models. Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 866-875, 2002.
19. F.R. McMorris, C. Wang, and P. Zhang. On probe interval graphs. Discrete Applied Mathematics, 88:315-324, 1998.
20. R. H. Möhring. Algorithmic aspects of comparability graphs and interval graphs. In I. Rival, editor, Graphs and Order, pages 41-101. D. Reidel, Boston, 1985.
21. R. H. Möhring. Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions. Annals of Operations Research, 4:195-225, 1985.
22. R. H. Möhring and F. J. Radermacher. Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics, 19:257-356, 1984.
23. R.R. Sokal and C.D. Michener. A statistical method for evaluating systematic relationships. The University of Kansas Scientific Bulletin, 38:1409-1438, 1958.
24. T. Uno and M. Yagiura. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica, 26(2):290-309, 2000.
25. P. Zhang. United states patent: Method of mapping DNA fragments. Technical report, Available at www.cc.columbia.edu/cu/cie/techlists/patents/5667970.htm, July 2000.