Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
In this paper, we propose a novel neural network model called RNN Encoder‐ Decoder that consists of two recurrent neural networks… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
2009
2009
In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between… Expand
Highly Cited
2000
Highly Cited
2000
  • G. Paun
  • J. Comput. Syst. Sci.
  • 2000
  • Corpus ID: 15761839
We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a… Expand
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1997
Highly Cited
1997
Part I. Exact String Matching: The Fundamental String Problem: 1. Exact matching: fundamental preprocessing and first algorithms… Expand
Highly Cited
1997
Highly Cited
1997
Linear-Time Construction of Suffix Trees We will present two methods for constructing suffix trees in detail, Ukkonen’s method… Expand
  • figure 5.1
  • figure 5.3
Highly Cited
1985
Highly Cited
1985
Preface 1. Introduction 2. Phase transitions in the early universe 3. Topological defects 4. String field theory 5… Expand
Highly Cited
1977
Highly Cited
1977
An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum… Expand
  • table 3
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… Expand
  • figure 2
  • figure 4
Highly Cited
1975
Highly Cited
1975
This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of… Expand
  • figure 1
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… Expand