Results 161 to 170 of about 469,663 (197)

Inverted lists string pattern matching

2009 2nd IEEE International Conference on Computer Science and Information Technology, 2009
This paper presents two algorithms of string pattern matching. These algorithms employ the inverted lists to accommodate the string pattern to be searched for. The first solution scans the text in a single pass for all occurrences of string pattern. The second solution, which improves the first one, takes the comparison times equal to the length of ...
Chouvalit Khancome, Veera Boonjing
openaire   +1 more source

Strings, trees, and patterns

Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Strings and Patterns

2017
PHP strings are a series of bytes and do not contain any information about how those bytes should be translated to characters.
openaire   +1 more source

String patterns of leading digits

Applied Mathematics and Computation, 1983
This paper reviews numerous theoretical results on properties of string sequences generated by leading digits of 2^n and explores their practical implications. The result of Rajagopal et al. on statistical properties of string sequences is discussed. Several recent ideas on the graph-theoretic complexity of string sequences of leading digits are then ...
Iyengar, S. Sitharama, Rajagopal, A. K., Uppuluri, V. R. R.   +2 more
openaire   +2 more sources

Pattern Avoidance and Overlap in Strings

Combinatorics, Probability and Computing, 2002
Consider a finite alphabet Ω and patterns which consist of characters from Ω. For a given pattern w, let cor(w) denote its autocorrelation, which can be seen as a measure of the amount of overlap in w. Letting aw(n) denote the number of strings over Ω of length n which do not contain w as a substring, the main result of this paper is: If cor(w) >
openaire   +1 more source

Contrast pattern kernel for strings

SPIE Proceedings, 2011
In this work we present a contrast pattern kernel for strings. In this kernel, the feature extraction is based on contrast patterns, that are substrings (patterns) common for the positive class but rare for the negative one. The presented idea can be also illustrated as the extension of a spectrum kernel, investigated in previous work [11].
Jakub Węcławski, Stanisław Jankowski
openaire   +1 more source

A2KD string pattern Matching Algorithm

2015 1st International Conference on Next Generation Computing Technologies (NGCT), 2015
String matching problem is to find all the occurrences of a given string pattern in a large string text. This problem is fundamental in computer Science and is the basic need of many applications; some of the most popular Multipattern String Matching Algorithm is “Aho-Corasick” and “Boyre Moore”.
Aditi Gupta, Divyansh Jaiswal, Kartikeya Sinha, Aman Duggal   +3 more
openaire   +1 more source

Finding approximate patterns in strings

Journal of Algorithms, 1985
Consider the ''approximate pattern matching problem'': decide whether the string x of length n, contains a substring q, whose edit distance to the given string p of length m is at most t; in J. Algorithms 1, 359-373 (1980; Zbl 0454.68110), \textit{P. H. Sellers} gives an algorithm which solves this problem in time O(mn). The paper under review presents
openaire   +1 more source

A string pattern—matching algorithm

Journal of Systems and Software, 1993
Abstract A string pattern-matching algorithm uses a character string, pattern , to search another character string, text , for the first or all occurrence(s) of the pattern in the text. This article presents a string patternmatching algorithm using a mapping table and an automaton. The number of states of the automaton is equal to the length of the
openaire   +1 more source

Flexible Pattern Matching in Strings

2002
String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational ...
Gonzalo Navarro, Mathieu Raffinot
openaire   +1 more source