Bulletin of Mathematical Biology

, Volume 48, Issue 2, pp 189–195 | Cite as

Interval graphs and maps of DNA

  • Michael S. Waterman
  • Jerrold R. Griggs


A special class of interval graphs is defined and characterized, and an algorithm is given for their construction. These graphs are motivated by an important representation of DNA called restriction maps by molecular biologists. Circular restriction maps are easily included.


Bipartite Graph Interval Graph Molecular Biologist Incidence Matrice Interval Representation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Benzer, S. 1959. “On the topology of genetic fine structure.”Proc. natn. Acad. Sci. U.S.A. 45, 1607–1620.CrossRefGoogle Scholar
  2. Booth, K. S. and G. S. Leuker. 1976. “Testing for the consecutive ones property, interval graphs, and graph planarity using PO algorithms.”J. Comput. Syst. Sci. 13, 335–379.MATHGoogle Scholar
  3. Danna, K. J., G. H. Sack and D. Nathans. 1973. “Studies of Simian Virus 40 DNA. VII. A cleavage map of the SV40 genome.”J. molec. Biol. 78, 363–376.CrossRefGoogle Scholar
  4. Fitch, W. M., T. F. Smith, and W. W. Ralph. 1983. “Mapping the order of DNA restriction fragments.”Gene 22, 19–29.CrossRefGoogle Scholar
  5. Fulkerson, D. R. and O. A. Gross. 1964. “Incidence matrices with the consecutive 1s property.”Bull. Am. math. Soc. 70, 681–684.MATHMathSciNetCrossRefGoogle Scholar
  6. Gilmore, P. C. and A. J. Hoffman. 1964. “A characterization of comparability graphs and of interval graphs.”Can. J. Math. 16, 539–548.MATHMathSciNetGoogle Scholar
  7. Golumbic, M. C. 1980.Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press.MATHGoogle Scholar
  8. Jungck, J. R., G. Dick and A. G. Dick. 1982. “Computer-assisted sequencing, interval graphs, and molecular evolution.”Bio-Syst. 15, 259–273.Google Scholar
  9. Lekkerkerker, C. G. and J. C. Boland. 1962. “Representation of a finite graph by a set of intervals on the real line.”Fund. Math. 51, 45–64.MATHMathSciNetGoogle Scholar

Copyright information

© Society for Mathematical Biology 1986

Authors and Affiliations

  • Michael S. Waterman
    • 1
  • Jerrold R. Griggs
    • 2
  1. 1.Departments of Mathematics and of Biological SciencesUniversity of Southern CaliforniaLos AngelesUSA
  2. 2.Department of Mathematics and StatisticsUniversity of South CarolinaUSA

Personalised recommendations