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

F. Alizadeh/R. Karp/D. Weisser/G. Zweig: Physical mapping of chromosomes
using unique probes. J. Comp. Biol. 2 (1995), 159-184.

C. Armin/C. Stein: Shortest superstrings and the structure of overlapping
strings. J. Comp. Biol. 2 (1995), 307-332.

8208 Richard Arratia/Daniela Martin/Gesine Reinert/Michael Waterman: Poisson
process approximation for sequence repeats, and sequencing by hybridization.
Internet 1996, 67p.

M. Bishop/C. Rawlings (ed.): Nucleic acid and protein sequence analysis -
practical approaches. IRL Press 1988.

A. Blum a.o.: Linear approximation of shortest superstrings.
J. ACM 41/4 (1994), 630-647.

11036 Thomas Christof a.o.: A branch-and-cut approach to physical
mapping of chromosoems by unique end-probes.
J. Comp. Biol. 4 (1997), 433-447.

M. Fellows/M. Hallett/W. Wareham: DNA physical mapping - three ways
difficult. Springer LN CS 726 (1993), 157-168.

849 Larry Goldstein/Michael Waterman: Mapping DNA by stochastic relaxation.
Adv. appl. Math. 8 (1987), 194-207. [4383]

M. Golumbic/H. Kaplan/R. Shamir: On the complexity of DNA physical mapping.
Adv. Appl. Math. 15 (1994), 251-261.

E. Green/P. Greene: Sequence-tagged site (STS) content mapping of human
chromosomes - theoretical considerations and early experiences.
PCR Methods and Appl. ... (1991), 77-90.

D. Greenberg/S. Istrail: Physical mapping by STS hybridization - algorithmic
strategy and the challenge of software evaluation.
J. Comp. Biol. 2 (1995), 219-273.

Sridhar Hannenhalli/W. Feldman/H. Lewis/S. Skiena/Pavel Pevzner: Positional
sequencing by hybridization. CABIOS 12/1 (1996), 19-24.

S. Ho/L. Allison/C. Yee: Restriction site mapping for three or more enzymes.
Comp. Appl. Biosci. 6 (1990), 195-204.

7844 Ramana Idury/Michael Waterman: A new algorithm for DNA sequence
assembly. J. Comp. Biology 2 (1995), 291-306.

11037 Mudita Jain/Eugene Myers: Algorithms for computing and integrating
physical maps using unique probes. J. Comp. Biol. 4 (1997), 449-466.

T. Jiang/Z. Jiang/D. Breslauer: Rotation of periodic strings and short
superstrings. MPI Informatik Saarbruecken, TR ... (1996).

H. Kaplan/R. Shamir/R. Tarjan: Tractability of parametrized completion
problems on chordal and interval graphs - minimum fill-in and physical
mapping. Proc. 35th IEEE Symp. Found. Comp. Sci. 1994, 780-791.

John Kececioglu: Exact and approximation algorithms for DNA sequence
reconstruction. PhD thesis Univ. Arizona 1991.

8177 John Kececioglu/Eugene Myers: Combinatorial algorithms for DNA sequence
assembly. Internet, ca. 1992, 45p.

8177 John Kececioglu/Eugene Myers: Combinatorial algorithms for DNA sequence
assembly. Internet, ca. 1992, 45p.

John Kececioglu/Eugene Myers: Exact and approximate algorithms for the
sequence reconstruction problem. Algorithmica 13/1-2 (1995), 7-51.

E. Lander/R. Langridge/D. Saccoccio: A report on computing in molecular
biology. Mapping and interpreting biological information.
Comm. ACM 34/11 (1991), 33-39.

M. Li: Towards a DNA sequence theory. 
Proc. 31th Annual IEEE Symp. Found. Comp. Sci. 1990, 125-134.

R. Lipschutz: Maximum likelihood DNA sequencing by hybridization.
J. Biomol. Struct. Dyn. 11 (1993), 637-653.

M. Miller/J. Powell: A quantitative comparison of DNA sequence assembly
programs. J. Comp. Biol. 1 (1994), 257-269.

R. Mott/A. Grigoriev/J. Maier/H. Lehrach: Algorithms and software tools
for ordering clone libraries - application to the mapping of the genome
of schizosaccharomyces pombe. Nucl. Acids Res. 21/8 (1993), 1965-1974.

8178 Eugene Myers: Advances in sequence assembly. Internet, ca. 1992, 15p.

8181 Eugene Myers: Toward simplifying and accurately formulating fragment
assembly. Internet, ca. 1995, 21p.

8200 Lee Aaron Newberg/Dalit Naor: A lower bound on the number of solutions
to the probed partial digest problem. Adv. Appl. Math. 14 (1993), 172-183.

H. Peltola/H. Soederland/J. Tarho/E. Ukkonen: Algorithms for some string
matching problems arising in molecular genetics.
Proc. 9th IFIP World Computer Congress 1983, 59-64.

H. Peltola/H. Soederland/E. Ukkonen: SEQUAID - a DNA sequence assembly
program based on a mathematical model. Nucl. Acids Res. 12 (1984), 307-321.

Pavel Pevzner: l-tuple DNA sequencing - a computer analysis.
J. Biomol. Struct. Dyn. 7 (1989), 63-73.

Pavel Pevzner: DNA physical mapping and alternating Eulerian paths in
coloured graphs. Algorithmica 13/1-2 (1995), 77-105.

Pavel Pevzner/R. Liphutz: Towards DNA sequencing chips.
Springer LN CS 841 (1994), 143-158. 

8203 Ethan Port/Fengzhu Sun/Daniela Martin/Michael Waterman: Genomic mapping
by end characterized random clones - a mathematical analysis.
Internet, ca. 1996, 35p.

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

4372 William Schmitt/Michael Waterman: Multiple solutions of DNA restriction
mapping problems. Adv. appl. Math. 12 (1985), 412-427. [4383]

S. Skiena/W. Smith/P. Lemke: Reconstructing sets from interpoint distances.
Proc. 6th Annual Symp. Comp. Geom. 1990, 332-339.

11038 Fengzhu Sun/Gary Benson/Norm Arnheim/Michael Waterman: Poolingg
strategies for establishing physical genome maps usingg FISH.
J. Comp. Biol. 4 (1997), 467-486.

J. Tarhio/E. Ukkonen: A greedy approximation algorithm for constructing
shortest common superstrings. Theor. Comp. Sci. 57 (1988), 131-145.

J. Turner: Approximation algorithms for the shortest common superstring
problem. Inf. and Comp. 83 (1989), 1-20.

4629 Michael Waterman: Some mathematics for DNA restriction mapping.
In 4620 Roberts, 337-345.

Michael Waterman/J. Griggs: Interval graphs and maps of DNA.
Bull. Math. Biol. 48 (1986), 189-195.

G. Zehetner/A. Frischauf/H. Lehrach: Approaches to restriction map
determination. In Bishop/Rawlings 1988, 147-164.