34 search results - page 1 / 7 » Situations as Strings |
ENTCS
2006
13 years 4 months ago
2006
IPL
2010
13 years 2 months ago
2010
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...
ISMB
1998
13 years 5 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
STOC
2000
ACM
13 years 8 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
ICSE
2009
IEEE-ACM
14 years 5 months ago
2009
IEEE-ACM
Modern software applications require internationalization to be distributed to different regions of the world. In various situations, many software applications are not internatio...