String (computer science)

About: String (computer science) is a research topic. Over the lifetime, 19430 publications have been published within this topic receiving 333247 citations. The topic is also known as: str & s.

Data structure management tagging system

Abstract: An adaptive data compression and decompression system having a fixed dictionary size is disclosed. The compression system builds a data dictionary tree such that each path in the tree represents a string ω, which was, along with its prefixes, in the input character stream being compressed. The root node and all nodes that do not represent a single character word in the input stream are tagged. Additionally, each non-root node is associated with a unique output code. As strings from the input stream of characters are matched against the tree, the node tags are updated. When a match fails, a new node is added. The new node is associated with a new code and a tag. When the dictionary is full, the root tag identifies the tag of a node that can be deleted. The decompression system builds a similar tapped decompression dictionary.

Method and system for addressing locations based upon latitude and longitude positions

Abstract: A method and system for locating an address of a space based upon latitude and longitude coordinates. The latitude and longitude positioning system includes a global positioning satellite for measuring the latitude and longitude coordinates of the space to be addressed and a device for generating a unique variable string based upon the measured latitude and longitude coordinates. The variable string is stored in a storage device and a device for selectively disseminating the variable string is provided for informing persons desirous of learning the location of the space of the variable address string. The variable string may be represented as a numerical string. A keypad is also provided connected to the generating device for inputting data related to special features related to the location of the space such as a height of the space and floor on which the space is located within a structure. The dissemination device includes a modem for connection with a telephone line for transmitting the address string to a party on an opposite end of a telephone communication channel established on the telephone line, a send button for initiating transmission of the variable string across the telephone line and an emergency button for initiating a telephone call by the modem to an emergency services station for transmission of the variable string across the telephone line to the emergency services station.

Interactive image tagging

Abstract: Techniques are described for performing automatic generation of one or more tags associated with an image file. One or more ink annotations for a displayed image are received. Handwriting recognition processing of the one or more ink annotations is performed. A string is generated and the string includes one or more recognized words used to form the one or more tags associated with the image file. The handwriting recognition processing and generating the string are performed in response to receiving the ink annotations.

Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform

Abstract: We describe succinct and compact representations of the bidirectional bwt of a string s ∈ Σ* which provide increasing navigation power and a number of space-time tradeoffs. One such representation allows to extend a substring of s by one character from the left and from the right in constant time, taking O(|s| log |Σ|) bits of space. We then match the functions supported by each representation to a number of algorithms that traverse the nodes of the suffix tree of s, exploiting connections between the bwt and the suffix-link tree. This results in near-linear time algorithms for many sequence analysis problems (e.g. maximal unique matches), for the first time in succinct space.

Compression method, method for compressing entry word index data for a dictionary, and machine translation system

Abstract: A n-gram statistical analysis is employed to acquire frequently appearing character strings of n characters or more, and individual character strings having n characters or more are replaced by character translation codes of 1 byte each. The correlation between the original character strings having n characters and the character translation codes is registered in a character translation code table. Assume that a character string of three characters, i.e., a character string of three bytes, “sta,” is registered as 1-byte code “e5” and that a character string of four characters, i.e., a character string of four bytes, “tion,” is registered as 1-byte code “f1.” Then, the word “station,” which consists of a character string of seven characters, i.e., seven bytes, is represented by the 2-byte code “e5 f1,” so that this contributes to a compression of five bytes.