3270 search results - page 23 / 654 » Approximate String Processing |
WCE
2007
13 years 8 months ago
2007
—One problem of generating a model to recognize any string is how to generate one that is generalized enough to accept strings with similar patterns and, at the same time, is spe...
AAIM
2006
Springer
14 years 1 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
FCT
2003
Springer
14 years 24 days ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
FCT
2003
Springer
14 years 24 days ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...