72 search results - page 14 / 15 » combinatorics 1999 |
CPM
1999
Springer
13 years 9 months ago
1999
Springer
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...
CPM
1999
Springer
13 years 9 months ago
1999
Springer
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 ...
COCOON
1999
Springer
13 years 9 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
CPM
1999
Springer
13 years 9 months ago
1999
Springer
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...
COCOON
1999
Springer
13 years 9 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...