Results 141 to 150 of about 147,630 (190)
Some of the next articles are maybe not open access.
On Simon's string searching algorithm
Information Processing Letters, 1993We give sharp bounds for the problem of string matching when only one head moving from the right to the left of the text is used: \((2-1/m)n\) character comparisons for all the text, and \(\min \{1+ \log_ 2m,\text{Card}(A)\}\) character comparisons on each character of the text, where \(m\) is the length of the pattern, \(n\) the length of the text ...
openaire +2 more sources
A review on parameterized string matching algorithms
Journal of Information and Optimization Sciences, 2017Identification of candidate genes and nucleotides are basic uses of the Bioinformatics research.
Rama Singh, Deepak Rai, Rajesh Prasad
openaire +1 more source
Parallel string matching algorithms based on dataflow
Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers, 2003This paper presents efficient dataflow schemes for parallel string matching. Two subproblems known as the exact matching and the k-mismatches problems are covered. Three parallel algorithms based on multiple input (and output) streams are presented. Time complexities of these parallel algorithms are O((n/d)+/spl alpha/), O/spl les//spl alpha//spl les/m,
null Jin Hwan Park, K.M. George
openaire +1 more source
Optimal neural network algorithm for on-line string matching
IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 1998We consider an online string matching problem in which we find all the occurrences of a pattern of m characters in a text of n characters, where all the characters of the pattern are available before processing, while the characters of the text are input one after the other.
Y W, Leung, J S, Zhang, Z B, Xu
openaire +2 more sources
String pattern searching algorithm based on characters indices
2019 4th International Conference on Smart and Sustainable Technologies (SpliTech), 2019In this article we shortly present new string pattern matching algorithm. The algorithm uses novel technique for skipping unnecessary comparisons in pattern searching phase. The pattern searching is applied in almost all branches of science such as bioinformatics, information security, text mining, etc.
Markić, Ivan +2 more
openaire +3 more sources
Experimental results on string matching algorithms
Software: Practice and Experience, 1995AbstractWe present experimental results for string matching algorithms which are known to be fast in practice. We compare these algorithms through two aspects: the number of text character inspections and the running time. These experiments show that for large alphabets and small patterns the Quick Search algorithm of Sunday is the most efficient and ...
openaire +1 more source
Research on string similarity algorithm based on Levenshtein Distance
2017 IEEE 2nd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC), 2017The application of string similarity is very extensive, and the algorithm based on Levenshtein Distance is particularly classic, but it is still insufficient in the aspect of universal applicability and accuracy of results. Combined with the Longest Common Subsequence (LCS) and Longest Common Substring (LCCS), similarity algorithm based on Levenshtein ...
Shengnan Zhang, Yan Hu, Guangrong Bian
openaire +1 more source
Fast String Matching Algorithm Based on the Skip Algorithm
2013String matching is a fundamental problem in computer science. In order to gain higher performance online exact single pattern string matching algorithms, the authors improved the Skip algorithm which is a comparison based exact single pattern string matching algorithm.
Wenqing Wu +3 more
openaire +1 more source
A Fast Approximate String Matching Algorithm on GPU
2015 Third International Symposium on Computing and Networking (CANDAR), 2015The approximate string matching (ASM) problem asks to find a substring of string Y of length n that is most similar to string X of length m. The ASM can be solved by dynamic programming technique, which computes a table of size m × n. The main contribution of this work is to present a memory-access-efficient implementation for computing the ASM on a ...
Lucas S.N. Nunes +3 more
openaire +1 more source
Pattern-Matching Algorithms on Indeterminate Strings
2005In computing, strings are sequences of simple elements (letters) drawn from some alphabet. A string is one of the most basic and important data structures in computer science, it exists everywhere in computer systems. Disk files, contents of memory, source and object code of computer programs, e-mail messages are all examples of strings.
openaire +2 more sources