Construction of probe interval models

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 866-875

  McConnell, Ross M ^a   Spinrad, Jeremy P ^b  

^a The University of Colorado Denver   (United States)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MOLECULAR BIOLOGY; PROBES;

INTERVAL GRAPH; PROBE INTERVAL GRAPHS; PROBE INTERVALS;

GRAPH THEORY;

EID: 84968718651     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. S. Benzer. On the topology of the genetic fine structure, Proc. Nat. Acad. Sci. U.S.A., 45 (1959), pp. 1607-1620.
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 (1976), pp. 335-379.
3. A. Ehrenfeucht and G. Rozenberg. Theory of 2-structures, part 1: Clans, basic subclasses, and mor-phisms, Theoretical Computer Science, 70 (1990) pp. 277-303.
4. A. Ehrenfeucht and G. Rozenberg. Theory of 2-structures, part 2: Representations through labeled tree families, Theoretical Computer Science, 70 (1990) pp. 305-342.
5. T. Gallai. Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar., 18 (1967) pp. 25-66.
6. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
7. W. Hsu. O(mn) algorithms for the recognition and isomorphism problems on circular-arc graphs, SIAM J. Comput., 24 (1995), pp. 411-439.
8. J.L. Johnson and J.P. Spinrad. A polynomial time recognition algorithm for probe interval graphs, Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 12 (2001), pp. 477-486.
9. R. M. McConnell. Linear-time recognition of circular-arc graphs, Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS01), 42 (2001), to appear.
10. R. M. McConnell. An O(n-) incremental algorithm for modular decomposition of graphs and 2-structures, Algorithmica, 14 (1995), pp. 229-248.
11. F.R. McMorris, C. Wang, and P. Zhang. On probe interval graphs, Discrete Applied Mathematics, 88 (1998), pp. 315-324.
12. R. H. Mohring. Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions, Annals of Operations Research, 4 (1985), pp. 195-225.
13. J. H. Muller and -J. P. Spinrad. Incremental modular decomposition, Journal of the ACM, 36 (1989), pp. 1-19.
14. J.P. Spinrad. Doubly lexical ordering of dense 0-1 matrices, Inf. Process. Lett., 45 (1993), pp. 229-235.
15. R. E. Tarjan. Data structures and network algorithms. Society for Industrial and Applied Math., Philadelphia, 1983.
16. P. Zhang. Probe interval graphs and its applications to physical mapping of DNA, manuscript, 1994.
17. P. Zhang. United states patent: Method of mapping DNA fragments, available at www.cc.columbia.edu/cu/cie/techlists/pat-ents/5667970.htm. July 3, 2000.