F. Alizadeh/R. Karp/L. Newberg/D. Weisser: Physical mapping of
chromosomes - a combinatorial problem in molecular biology.
Algorithmica 13 (1995), 52-76.

Benzer: On the topology of genetic fine structure.
Proc. Nat. Ac. Sci. USA 45 (1959), 1607-1620.
In this paper Benzer, studying the structure of bacterial genes,
introduced interval graphs.

J. Boland/C. Lekkerkerker: Representation of a finite graph by
a set of intervals on the real line.
Fund. Math. 51 (1962), 45-64.

K. Booth/G. Leuker: Testing for the consecutive ones property,
interval graphs, and graph planarity using PQ-tree algorithms.
J. Computer and Systems Sci. 13 (1976), 335-379.

C. Coombs/J. Smith: On the detection of structures in attitude and
developmental processes. Psych. Rev. 80 (1973), 337-351.

9841 Margaret Cozzens/N. Mahadev: Consecutive one's properties for
matrices and graphs including variable diagonal entries.
In 4620 Roberts, 75-94.

P. Fishburn: Interval orders and interval graphs - a study of partially
ordered sets. Wiley 1985.

D. Fulkerson/O. Gross: Incidence matrices and interval graphs.
Pacific J. Math. 15 (1965), 835-855.

P. Gilmore/A. Hoffman: A characterization of comparability graphs
and interval graphs. Can. J. Math. 16 (1964), 539-548.

M. Golumbic: Algorithmic graph theory and perfect graphs.
Academic Press 1980.

14171 Dan Gusfield: Algorithms on strings, trees, and sequences.
Cambridge UP 1999, 530p. DM 150.

G. Hajos: U''ber eine Art von Graphen.
Int. Math. Nachr. 2 (1957), 65.

G. Hajos: U''ber eine Konstruktion nicht n-fa''rbbarer Graphen.
Wiss. Z. Martin-Luther-Univ. Halle 10 (1961), 116-117.

F. Harary (ed.): Proof techniques in graph theory. Academic Press 1969.

David Kendall: A statistical approach to Flinders Petrie's sequence
dating. Bull. Int. Stat. Inst. 40 (1963), 657-680.

David Kendall: Some problems and methods in statistical archaeology.
World Archaeology 1 (1969), ...

9853 David Kendall: Incidence matrices, interval graphs, and seriation in
archaelogy. Pacific J. Math. 28 (1969), 565-570.

Victor Klee: What are the intersection graphs of arcs in a circle?
Am. Math. Monthly 76 (1969), 810-813.

C. Lekkerkerker/J. Boland: Representation of a finite graph by a set
of intervals on the real line. Fund. Math. 51 (1962), 45-64.

1354 Boris Mirkin/Sergei Rodin: Graphs and genes.
Springer 1984. 3-540-12657-0.

14228 Pavel Pevzner: Computational molecular biology.
MIT Press 2000, 310p. $45.

Fred Roberts: Representations of indifference relations.
PhD Thesis Stanford Univ. 1968.

Fred Roberts: Indifference graphs. In Harary 1969, ...

Fred Roberts (ed.): Graph theory and its applications to problems
of society. SIAM 1978.

4620 Fred Roberts (ed.): Applications of combinatorics and graph
theory to the biological and social sciences. Springer 1989.

9839 Fred Roberts: Applications of combinatorics and graph theory to
the biological and social sciences: Seven fundamental ideas.
In 4620 Roberts, 1-37.

W. Robinson: A method for chronologically ordering archaeological deposits.
American Antiquity 16 (1951), 293-301.

H. Ryser: Combinatorial configurations.
SIAM J. Appl. Math. 17 (1969), 593.

14166 Joao Setubal/Joao Meidanis: Introduction to computational
biology. PWS 1997, 300p. DM 167.

D. Skrein: A relationship between triangulated graphs, comparability
graphs, proper interval graphs, proper circular -arc graphs, and
nested interval graphs. J. Graph Theory 6 (1982), 309-316.

K. Stoffers: Scheduling of traffic lights - a new approach.
Transport Res. 2 (1968), 199-234.

Alan Tucker: Characterizing the consecutive 1's property.
Proc. 2nd Chapel Hill Conf. Comb. Math. Appl. 1970, 472-477.

Alan Tucker: Matrix characterizations of circular-arc graphs.
Pacific J. Math. 38 (1971), ...
 
9852 Alan Tucker: A structure for the consecutive 1's property.
J. Comb. Theory 12 B (1972), 153-162.

9733 Michael Waterman: Introduction to computational biology. Maps,
sequences and genomes. Chapman & Hall 1996, 450p. 0-41299-391-0. DM 95.