516 search results - page 32 / 104 » Sets of k-Independent Strings |
CPM
2000
Springer
13 years 12 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
EUROGP
2003
Springer
14 years 24 days ago
2003
Springer
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
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 ...
DAWAK
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Detecting repeated portions of strings has important applications to many areas of study including data compression and computational biology. This paper defines and pres...