A polynomial time recognition algorithm for probe interval graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 477-486

  Johnson, Julie L ^a   Spinrad, Jeremy P ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

Algorithms; Human factors; Theory

Indexed keywords

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

References (8)

1. K. Booth, G. Lueker, Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity using PQ-Tree Algorithms, Journal of Computer and System Sciences 13, 335 - 379, 1976.
2. M. Golumbic, Probe Graphs and Interval Sandwich Problems, Manuscript.
3. Tze-Heng Ma , Jeremy P. Spinrad, On the 2-chain subgraph cover and related problems, Journal of Algorithms, v.17 n.2, p.251-268, Sept. 1994 [doi〉10.1006/jagm.1994.1034]
4. Ross M. McConnell , Jeremy P. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, v.201 n.1-3, p.189-241, April 28, 1999 [doi〉10.1016/S0012-365X(98) 00319-7]
5. F. R. McMorris , Chi Wang , Peisen Zhang, On probe interval graphs, Discrete Applied Mathematics, v.88 n.1-3, p.315-324, Nov. 9, 1998 [doi〉10.1016/S0166-218X(98)00077-8]
6. R.H. MShring, F.J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Annals of Discrete Mathematics 19, 257-356, 1984.
7. P. Zhang, Probe interval graphs and its applications to physical mapping of DNA, manuscript, 1994.
8. P. Zhang."United States Patent. Method of Mapping DNA Fragments." {Online} Available http://www.cc.columbia.edu/eu/cie/techlists/ patents/ 5667970.htm July 3, 2000.