1028 search results - page 44 / 206 » Character sets of strings |
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
SPIRE
2004
Springer
14 years 1 months ago
2004
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
BMCBI
2006
13 years 7 months ago
2006
Background: Character mapping on phylogenies has played an important, if not critical role, in our understanding of molecular, morphological, and behavioral evolution. Until very ...
ICPR
2000
IEEE
13 years 11 months ago
2000
IEEE
Methods for controlling the adaptation process of an on-line handwritten character recognizer are studied. The classifier is based on the -nearest neighbor rule and it is adapted...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Constraint-based mining has been proven to be extremely useful for supporting actionable pattern discovery. However, useful conjunctions of constraints that support domain driven ...