Institute of Computer Science

Pattern Recognition and Bioinformatics

[1]	Abouelhoda, M.I. and Kurtz, S. and Ohlebusch, E. Replacing Suffix Trees with Enhanced Suffix Arrays. Journal of Discrete Algorithms, 2:53-86, 2004. [ bib \| .pdf ]
[2]	Hans-Joachim Böckenhauer and Dirk Bongartz. Algorithmische Grundlagen der Bioinformatik. Teubner, 2003. [ bib ]
[3]	Stefan Kurtz. Foundations of sequence analysis. University of Bielefeld, July 2001. Lecture notes for a course in the Winter Semester 2000/2001. [ bib \| .ps.gz ]
[4]	Stefan Kurtz. Reducing the space requirement of suffix trees. Software - Practice and Experience, 29(13):1149-1171, 1999. [ bib \| .html ]
[5]	Dan Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge, 1997. [ bib ]
[6]	Joao Setubal and Joao Meidanis. Introduction to Computational Molecular Biology. PWS Publishing, Boston, Mass., 1997. [ bib ]
[7]	Stephen F. Altschul, Thomas L. Madden, Alejandro A. Schäffer, Jinghui Zhang, Zheng Zhang, and Webb Miller abd Dvid J. Lipman. Gapped BLAST and PSI-BLAST: a new generation of protein databse search programs. Nucleic Acids Research, 25(17):2289-3402, 1997. [ bib \| .pdf ]
[8]	Michael S. Waterman. Introduction to Computational Biology: Maps, Sequences and Genomes. Chapman & Hall, London, 1995. [ bib ]
[9]	Stephen F. Altschul, Warren Gish, Webb Miller, Eugene W. Myers, and David J. Lipman. Basic local alignment search tool. 215:403-410, 1990. [ bib ]

This file has been generated by bibtex2html 1.79

last update: 09-Jun-06