Sciweavers

CPM
1999
Springer
141views Combinatorics» more  CPM 1999»
13 years 9 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 9 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 9 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 9 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 9 months ago
Fast Multi-dimensional Approximate Pattern Matching
Gonzalo Navarro, Ricardo A. Baeza-Yates
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
13 years 9 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
13 years 9 months ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell
CPM
1999
Springer
93views Combinatorics» more  CPM 1999»
13 years 9 months ago
Shift-And Approach to Pattern Matching in LZW Compressed Text
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Set...
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
13 years 9 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
CPM
1999
Springer
99views Combinatorics» more  CPM 1999»
13 years 9 months ago
On the Complexity of Positional Sequencing by Hybridization
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Shara...