Sciweavers

1028 search results - page 24 / 206
» Character sets of strings
Sort
View
TCS
2002
13 years 7 months ago
Presentations of computably enumerable reals
We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.
Rodney G. Downey, Geoffrey LaForte
ICPR
2006
IEEE
14 years 8 months ago
CAPTCHA Challenge Tradeoffs: Familiarity of Strings versus Degradation of Images
It is a well documented fact that, for human readers, familiar text is more legible than unfamiliar text. Current-generation computer vision systems also are able to exploit some ...
Jon Louis Bentley, Sui-Yu Wang
ALMOB
2006
102views more  ALMOB 2006»
13 years 7 months ago
Mining, compressing and classifying with extensible motifs
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...
Alberto Apostolico, Matteo Comin, Laxmi Parida
BMCBI
2010
143views more  BMCBI 2010»
13 years 5 months ago
A genome alignment algorithm based on compression
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison
IPL
2010
107views more  IPL 2010»
13 years 6 months ago
Disjoint pattern matching and implication in strings
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
Leonid Libkin, Cristina Sirangelo