Sciweavers

CPM
1998
Springer
115views Combinatorics» more  CPM 1998»
13 years 10 months ago
Aligning Alignments
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Weiqing Zhang
CPM
1998
Springer
84views Combinatorics» more  CPM 1998»
13 years 10 months ago
Genome Halving
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
Nadia El-Mabrouk, Joseph H. Nadeau, David Sankoff
COCOON
1998
Springer
13 years 10 months ago
On The Bahncard Problem
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
Rudolf Fleischer
COCOON
1998
Springer
13 years 10 months ago
On Multi-dimensional Hilbert Indexings
Indexing schemes for grids based on space- lling curves (e.g., Hilbert indexings) nd applications in numerous elds. Hilbert curves yield the most simple and popular scheme. We exte...
Jochen Alber, Rolf Niedermeier
CPM
1999
Springer
141views Combinatorics» more  CPM 1999»
13 years 10 months ago
Approximate Periods of Strings
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park,...
CPM
1999
Springer
93views Combinatorics» more  CPM 1999»
13 years 10 months ago
Pattern Matching in Text Compressed by Using Antidictionaries
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, ...
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
13 years 10 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
CPM
1999
Springer
107views Combinatorics» more  CPM 1999»
13 years 10 months ago
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
Gonzalo Navarro, Mathieu Raffinot
CPM
1999
Springer
105views Combinatorics» more  CPM 1999»
13 years 10 months ago
Fast Multi-dimensional Approximate Pattern Matching
Gonzalo Navarro, Ricardo A. Baeza-Yates