1215 search results - page 175 / 243 » Combinatorics |
CPM
2000
Springer
15 years 2 months ago
2000
Springer
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
CPM
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
COCOON
1999
Springer
15 years 2 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
15 years 2 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 ...
CPM
1999
Springer
15 years 2 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...