Literatur

BJL⁺94

A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis.
Linear approximation of shortest superstrings.
J. ACM, 41(4):630-647, 1994.

BL76

K. Booth and G. Lueker.
J. Comp. Sys. Sci., 13:333-379, 1976.

GK97

Robert Giegerich and Stefan Kurtz.
From Ukkonen to McCreight and Weiner: A unifying View of Linear-Time Suffix Tree Construction.
Algorithmica, 19(3):331-353, 1997.

Got82

O. Gotoh.
An improved algorithm for matching biological sequences.
J. Mol. Biol., 162:705-708, 1982.

Gus97

Dan Gusfield.
Algorithms on strings, trees, and sequences : computer science and computational biology.
Cambridge University Press, New York, NY, 1rst ed. edition, 1997.

GW87

L. Goldstein and M. S. Waterman.
Mapping DNA by stochastic relaxation.
Adv. Appl. Math., 8:194-207, 1987.

Hor97

Paul Horton.
String Algorithms and Machine Learning Applications for Computational Biology.
PhD dissertation, UC Berkeley, Department of Computer Science, December 1997.

JRR97

M. Jünger, G. Reinelt, and G. Rinaldi.
The Traveling Salesman Problem, pages 199-221.
John Wiley & Sons, 1997.
M. Dell`Amico and F. Maffioli and S. Martello (eds), Annotated Bibliographies in Combinatorial Optimization.

Ler97

Martin Lermen.
Multiple sequence alignment.
Master's thesis, Universität des Saarlandes, Im Stadtwald, 66123 Saarbrücken, 1997.

McC76

Edward M. McCreight.
A space-economical suffix tree construction algorithm.
Journal of the ACM, 23(2):262-272, 1976.

PL94

P. A. Pevzner and R. J. Lipshutz.
Towards DNA sequencing chips.
In Proc. 19-th Int. Conf. Math. Found. Comp. Sci., Lecture Notes in Comp. Sci. 841, pages 143-158, 1994.

SM97

Joao Carlos Setubal and Joao Meidanis.
Introduction to computational molecular biology.
PWS Publishing Company, Boston, 1997.

Swe95

E. S. Sweedyk.
A 2 1/2 appoximation Algorithm for shortest common superstring.
PhD thesis, University of California, Berkeley, Department of Computer Science, 1995.

Ukk95

Esko Ukkonen.
On-line construction of suffix-trees.
Algorithmica, 14:249-260, 1995.

Wat95

Michael S. Waterman.
Introduction to computational biology : maps, sequences, and genomes.
Chapman & Hall, London, 1995.

Wei73

P. Weiner.
Linear pattern matching algorithms.
In Proc. of 14-th IEEE Symp. on Switching and Automata theory, pages 1-11, 1973.

ZFL88

G. Zehetner, A. Frischauf, and H. Lehrach.
Approaches to restriction map determination, pages 147-164.
IRL Press, Oxford, 1988.
M. J. Bishop and C. J. Rawlings (eds.), Nucl. Acid and Protein Sequence Analysis, Practical Approaches.

Zie97

Kurt Ziegenbein.
Bewertung verschiedener paarweiser alignment-methoden, ersetzungsmatrizen und gap-funktionen.
Master's thesis, Universität des Saarlandes, Im Stadtwald, 66123 Saarbrücken, 1997.