String (computer science)

Known as: String-oriented, String algorithm, String data type 
In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable. The latter may… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We describe the design of a string programming/expression language that supports restricted forms of regular expressions… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2007
Highly Cited
2007
* Department of Biology and Graduate Degree Program in Ecology, Colorado State University, Fort Collins, CO 80523, USA… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We perform static analysis of Java programs to answer a simple question: which values may occur as results of string expressions… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We explain how the string spectrum in flat space and pp-waves arises from the large N limit, at fixed g YM , of U(N) N = 4 super… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper presents a collection of string algorithms that are at the core of several biological problems such as creating… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We introduce a new text-indexing data structure, the String B-Tree, that can be seen as a link between some traditional external… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1991
Highly Cited
1991
These chunks correspond in some way to prosodic patterns. It appears, for instance, that the strongest stresses in the sentence… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
In 1974 Wagner and Fischer [l] defined a distance measure on strings, based on minimum-cost sequences of edit operations needed… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1977
Highly Cited
1977
An algorithm is presented that searches for the location, “<italic>i</italic>l” of the first occurrence of a character string… (More)
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1974
Highly Cited
1974
The string-to-string correction problem is to determine the distance between two strings as measured by the minimum cost sequence… (More)
Is this relevant?