Results 21 to 30 of about 469,663 (197)
Gravitational Lensing Signature of Long Cosmic Strings [PDF]
, 1997 The gravitational lensing by long, wiggly cosmic strings is shown to produce a large number of lensed images of a background source. In addition to pairs of images on either side of the string, a number of small images outline the string due to small ...
A. A. de Laix +12 more
core +2 more sources
SORTING SUFFIXES OF TWO-PATTERN STRINGS [PDF]
International Journal of Foundations of Computer Science, 2005 Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial division of the suffixes of x into two sets: Step 1 sorts the first set using recursive reduction of the problem, Step 2 determines the order of the suffixes in the second set ...
Franěk, F., Smyth, W.F.
openaire +1 more source
Exact String Matching Algorithms: Survey, Issues, and Future Research Directions
IEEE Access, 2019 String matching has been an extensively studied research domain in the past two decades due to its various applications in the fields of text, image, signal, and speech processing.
Saqib Iqbal Hakak +5 more
doaj +1 more source
Study on dynamic characteristics of drill string in deep-water riserless drilling
Advances in Mechanical Engineering, 2023 The cost and security of ocean drilling are directly related to the efficient exploration and development of ocean resources. The riserless drilling system is usually adopted in the ocean drilling.
Fangfei Huang +4 more
doaj +1 more source
An Improved Algorithm for Approximate String Matching [PDF]
, 1989 Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented.
Galil, Zvi, Park, Kunsoo
core +2 more sources
String Indexing for Patterns with Wildcards [PDF]
Theory of Computing Systems, 2012 We consider the problem of indexing a string $t$ of length $n$ to report the occurrences of a query pattern $p$ containing $m$ characters and $j$ wildcards. Let $occ$ be the number of occurrences of $p$ in $t$, and $ $ the size of the alphabet. We obtain the following results. - A linear space index with query time $O(m+ ^j \log \log n + occ)$.
Bille, Philip +3 more
openaire +4 more sources
Patterned-string tasks: relation between fine motor skills and visual-spatial abilities in parrots. [PDF]
PLoS ONE, 2013 String-pulling and patterned-string tasks are often used to analyse perceptual and cognitive abilities in animals. In addition, the paradigm can be used to test the interrelation between visual-spatial and motor performance. Two Australian parrot species,
Anastasia Krasheninnikova
doaj +1 more source
Compressed Subsequence Matching and Packed Tree Coloring [PDF]
, 2014 We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $\sigma$, our algorithm uses $O(n+\frac{n\sigma}{w})$
A. Tiskin +25 more
core +3 more sources
Avoidable patterns in strings of symbols [PDF]
Pacific Journal of Mathematics, 1979 A word is just a finite string of letters. The word Wavoids the word U provided no substitution instance of Uis a subword of W. W is avoidable if on some finite alpha-bet there is an infinite collection of words each of whichavoids W. W is A th power-free if W avoids x , where x isa letter.
Bean, Dwight R. +2 more
openaire +3 more sources
Efficient pattern matching in elastic-degenerate strings [PDF]
Information and Computation, 2021 In this paper, we extend the notion of gapped strings to elastic-degenerate strings. An elastic-degenerate string can been seen as an ordered collection of k > 1 seeds (substrings/subpatterns) interleaved by elastic-degenerate symbols such that each elastic-degenerate symbol corresponds to a set of two or more variable length strings.
Iliopoulos, Costas S. +2 more
openaire +3 more sources