Invited Lectures |
Identifying and Filtering Near-Duplicate Documents / Andrei Z. Broder |
Machine Learning for Efficient Natural-Language Processing / Fernando Pereira |
Browsing around a Digital Library: Today and Tomorrow / Ian H. Witten |
Summer School Lectures |
Algorithmic Aspects of Speech Recognition: A Synopsis / Adam L. Buchsbaum ; Raffaele Giancarlo |
Some Results on Flexible-Pattern Discovery / Laxmi Parida |
Contributed Papers |
Explaining and Controlling Ambiguity in Dynamic Programming / Robert Giegerich |
A Dynamic Edit Distance Table / Sung-Ryul Kim ; Kunsoo Park |
Parametric Multiple Sequence Alignment and Phylogeny Construction / David Fernández-Baca ; Timo Seppäläinen ; Giora Slutzki |
Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment / Paul Horton |
A Polynomial Time Approximation Scheme for the Closest Substring Problem / Bin Ma |
Approximation Algorithms for Hamming Clustering Problems / Leszek Gasieniec ; Jesper Jansson ; Andrzej Lingas |
Approximating the Maximum Isomorphic Agreement Subtree Is Hard / Paola Bonizzoni ; Gianluca Della Vedova ; Giancarlo Mauri |
A Faster and Unifying Algorithm for Comparing Trees / Ming-Yang Kao ; Tak-Wah Lam ; Wing-Kin Sung ; Hing-Fung Ting |
Incomplete Directed Perfect Phylogeny / Itsik Pe'er ; Ron Shamir ; Roded Sharan |
The Longest Common Subsequence Problem for Arc-Annotated Sequences / Tao Jiang ; Guo-Hui Lin ; Kaizhong Zhang |
Boyer-Moore String Matching over Ziv-Lempel Compressed Text / Gonzalo Navarro ; Jorma Tarhio |
A Boyer-Moore Type Algorithm for Compressed Pattern Matching / Yusuke Shibata ; Tetsuya Matsumoto ; Masayuki Takeda ; Ayumi Shinohara ; Setsuo Arikawa |
Approximate String Matching over Ziv-Lempel Compressed Text / Juha Kärkkäinen ; Esko Ukkonen |
Improving Static Compression Schemes by Alphabet Extension / Shmuel T. Klein |
Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments / Nadia El-Mabrouk |
A Lower Bound for the Breakpoint Phylogeny Problem / David Bryant |
Structural Properties and Tractability Results for Linear Synteny / David Liben-Nowell ; Jon Kleinberg |
Shift Error Detection in Standardized Exams / Steven Skiena ; Pavel Sumazin |
An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC) / Rolf Backofen |
The Combinatorial Partitioning Method / Matthew R. Nelson ; Sharon L. Kardia ; Charles F. Sing |
Compact Suffix Array / Veli Mäkinen |
Linear Bidirectional On-Line Construction of Affix Trees / Moritz G. Maaß |
Using Suffix Trees for Gapped Motif Discovery / Emily Rocke |
Indexing Text with Approximate q-Grams / Erkki Sutinen ; Jani Tanninen |
Simple Optimal String Matching Algorithm / Cyril Allauzen ; Mathieu Raffinot |
Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts / Sven Rahmann ; Eric Rivals |
Periods and Quasiperiods Characterization / Mireille Régnier ; Laurent Mouchard |
Finding Maximal Quasiperiodicities in Strings / Gerth Stølting Brodal ; Christian N.S. Pedersen |
On the Complexity of Determining the Period of a String / Arthur Czumaj |
Author Index |
Invited Lectures |
Identifying and Filtering Near-Duplicate Documents / Andrei Z. Broder |
Machine Learning for Efficient Natural-Language Processing / Fernando Pereira |