\documentstyle[german,a4wide]{article}
\pagestyle{empty}

\begin{document}
%\parindent0cm
%\parskip2mm

\begin{center}
\huge \bf Vortr\"age im Seminar \\
Combinatorial Pattern Matching \\
(Abteilung IV, WS1995/96)
\end{center}

\section{Optimal Parsing of Strings}

A.~Hartman, M.~Rodeh, {\sl Optimal Parsing of Strings},
In: Combinatorical Algorithms on Words, A.~Apostolico, Z.~Galil (Ed.),
Springer, 1985, 155--167

\section{Searching Subsequences}

Ricardo A.~Baeza-Yates, {\sl Searching Subsequences}, Theoretical
Computer Science, Vol.~{\bf 78}, 1991, 363--376

\section{Approximating Shortest Superstrings}

Shang-Hua Teng, Frances Yao, {\sl Approximating Shortest Superstrings},
Proceedings of the 34th IEEE Symposium on Foundations of Computer Science
(FOCS), 1993, 158--165

\section{Time-Space Optimal String Matching}

M. Crochemore, {\sl String Matching on Ordered Alphabets}, 
Theoretical Computer Science, Vol.~{\bf 92}, 1992, 33--47

\section{Suffix Arrays}

Udi Manber, Gene Myers, {\sl Suffix Arrays: A New Method for On-Line
String Searches}, SIAM Journal on Computing, Vol.~{\bf 22}, Oct.~1993,
935--948

\section{Suffix Binary Search Trees}

Rob Irving, {\sl Suffix Binary Search Trees}, Technical Report TR-1995-7,
Department of Computing Science, University of Glasgow, April 1995

\section{Computing Covers of a String}

Dennis Moore, W.F.~Smyth, {\sl An Optimal Algorithm to Compute All the 
Covers of a String}, Information Processing Letters, Vol.~{\bf 50},
1994, 239--246

Dennis Moore, W.F.~Smyth, {\sl A Correction to ``An Optimal Algorithm to 
Compute All the Covers of a String''}, Information Processing Letters,
Vol.~{\bf 54}, 1995, 101--103

\section{Dynamic Dictionary Matching}

Ramana M.~Idury, Alejandro A.~Sch\"affer, {\sl Dynamic Dictionary Matching
with Failure Functions}, Theoretical Computer Science, Vol.~{\bf 131},
1994, 295--310

\section{Finding Repetitions in a String}

Michael G. Main, Richard J. Lorentz, {\sl An O(n log n) Algorithm for 
Finding All Repetitions in a String}, Journal of Algorithms, Vol.~{\bf 5},
1984, 422-432

S.~Rao Kosaraju, {\sl Computation of Squares in a String},
5th Annual Symp.~on Combinatorial Pattern Matching,
Lecture Notes in Computer Science, 
Vol.~{\bf 807}, 1994, 146-150

\section{Fast Multiple Keyword Searching}

Jong Yong Kim, John Shawe-Taylor, {\sl Fast Multiple Keyword Searching},
3rd Annual Symp.~on Combinatorial Pattern Matching, Lectures Notes in
Computer Science, Vol.~{\bf 644}, 1992, 41--51

\section{Speeding up Dynamic Programming}

Zvi Galil, Raffaele Giancarlo, {\sl Speeding up Dynamic Programming with 
Applications to Molecular Biology}, Theoretical Computer Science, Vol~{\bf 64},
1989, 107--118

\section{String Matching with Don't-Care Patterns}

Ron Y.~Pinter, {\sl Efficient String Matching with Don't-Care Patterns}, In:
A. Apostolico and Z. Galil (eds.), Combinatorial Algorithms on Words, 
NATO Advanced Science Institute Series F: Computer and System Sciences, 
Vol.~{\bf 12}, 1985, 11--29

\section{Multiple Sequence Alignment 1}

John Kececioglu, {\sl The Maximum Weight Trace Problem in Multiple Sequence 
Alignment}, 4th Annual Symp.~on Combinatorial Pattern Matching, 
Lecture Notes in Computer Science, Vol.~{\bf 684},
1993, 106--119

\section{Multiple Sequence Alignment 2}

J.~Meidanis, J.~Setubal, {\sl Multiple Alignment of Biological Sequences
with Gap Flexibility}, LATIN'95: Theoretical Informatics,
Lecture Notes in Computer Science, 1995, Vol.~{\bf 911},
411--426

\section{Approximate String Matching with Suffix Automata}

Esko Ukkonen, Derick Wood, {\sl Approximate String Matching with Suffix 
Automata}, Algorithmica, Vol.~{\bf 10}, 1993, 353--364

\section{Efficient Text Searching of Regular Expressions}

Ricardo A. Baeza-Yates, {\sl Efficient Text Searching of Regular Expressions},
ICALP'89, Lecture Notes in Computer Science, Vol.~{\bf 372}
1989, 46--62

\section{Vortragstermine}
Die Vortr\"age finden jeweils Dienstags um 16 c.t. in Raum N102 statt,
beginnend mit der ersten Woche im WS 1995/96.

\section*{Wie h\"alt man einen Informatik-Seminarvortrag?}

Tips zur Vorbereitung eines Vortrags k\"onnen \"uber das World Wide Web

\end{document}



