Topic
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.
Papers published on a yearly basis
Papers
More filters
•
IBM1
TL;DR: In this paper, a byte-count mask circuit generates a byte count mask which has all 1s for each byte count greater than the number of bytes per memory word and 0s for positions not belonging to the string.
Abstract: A data processor processes data strings from memory where the data strings do not begin or end at a memory boundary. A string is defined in memory by a starting address, a byte count defining the total number of bytes in the string, and a byte offset defining the position of the first byte in the starting address location. The processor stores the byte count and decrements the byte count as each multi-byte word is processed. A byte count mask circuit generates a byte count mask which has all 1s for each byte count greater than the number of bytes per memory word. When the number of bytes remaining to be processed is below the number of bytes in a memory word, the byte count mask generates 1s only for the positions corresponding to the positions of bytes of the string in the last memory word. An offset register stores the offset defining the position of the first byte in the first memory word of the string. The offset is used to shift the byte count mask by a number of positions corresponding to the position of the first byte of the string and inserts 0s in the byte count mask for positions not belonging to the string. A byte-by-byte comparator determines string end conditions and provides an output word with a significant bit indication for each byte for which an end condition has been detected. The output of the byte-by-byte comparator is combined with the shifted byte count mask, and the result is decoded by means of a prioritized decoder which generates a string write mask.
67 citations
••
03 Jun 2004
TL;DR: Matchbox is the first program that delivers automated proofs of termination for some difficult string rewriting systems and can search for proof or disproof of a Boolean combination of match-height properties of a given rewrite system, and some of its transformed variants.
Abstract: The program Matchbox implements the exact computation of the set of descendants of a regular language, and of the set of non-terminating strings, with respect to an (inverse) match-bounded string rewriting system. Matchbox can search for proof or disproof of a Boolean combination of match-height properties of a given rewrite system, and some of its transformed variants. This is applied in various ways to search for proofs of termination and non-termination. Matchbox is the first program that delivers automated proofs of termination for some difficult string rewriting systems.
67 citations
•
13 Sep 1996TL;DR: In this article, the electronic document database searching system displays search results using a display attribute that corresponds to the attribute of the string in each original electronic document, and the system also displays the search results by varying the display attribute according to the frequency of occurrence of the searched string in the original document.
Abstract: The electronic document database searching system displays search results using a display attribute that corresponds to the attribute of the string in each original electronic document. The system also displays the search results using a display attribute that varies in accordance with the frequency of occurrence of the searched string in each original electronic document
67 citations
••
TL;DR: It is concluded that semi-local string comparison turns out to be a useful algorithmic plug-in, which unifies, and often improves on, a number of previous approaches to various substring- and subsequence-related problems.
Abstract: Given two strings, the longest common subsequence (LCS) problem consists in computing the length of the longest string that is a subsequence of both input strings. Its generalisation, the all semi-local LCS problem, requires computing the LCS length for each string against all substrings of the other string, and for all prefixes of each string against all suffixes of the other string. We survey a number of algorithmic techniques related to the all semi-local LCS problem. We then present a number of algorithmic applications of these techniques, both existing and new. In particular, we obtain a new all semi-local LCS algorithm, with asymptotic running time matching (in the case of an unbounded alphabet) the fastest known global LCS algorithm by Masek and Paterson. We conclude that semi-local string comparison turns out to be a useful algorithmic plug-in, which unifies, and often improves on, a number of previous approaches to various substring- and subsequence-related problems.
67 citations