Sciweavers

CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
14 years 3 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»
14 years 3 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»
14 years 3 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»
14 years 3 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»
14 years 3 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...
CPM
1999
Springer
94views Combinatorics» more  CPM 1999»
14 years 3 months ago
Finding Maximal Pairs with Bounded Gap
Gerth Stølting Brodal, Rune B. Lyngsø...
COCOON
1999
Springer
14 years 3 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
COCOON
1999
Springer
14 years 3 months ago
Multi-party Finite Computations
Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof ...
COCOON
1999
Springer
14 years 3 months ago
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
Takeaki Uno
COCOON
1999
Springer
14 years 3 months ago
Using Generalized Forecasts for Online Currency Conversion
El-Yaniv et al. presented an optimal on-line algorithm for the unidirectional currency conversion problem based on the threat-based strategy. Later, al-Binali pointed out that this...
Kazuo Iwama, Kouki Yonezawa