Results 31 to 40 of about 70,442,116 (202)
Rotation of bits: a classical and quantum perspective
Bit rotation is an operation similar to shift except that the bits that fall off at one end are put back to the other end. In left rotation, the bits that fall off at left end are put back at right end.
Peter Nimbe +2 more
doaj +1 more source
Indeterminate string inference algorithms
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sumaiya Nazeen +2 more
openaire +2 more sources
Hide and Mine in Strings: Hardness and Algorithms [PDF]
We initiate a study on the fundamental relation between data sanitization (i.e., the process of hiding confidential information in a given dataset) and frequent pattern mining, in the context of sequential (string) data. Current methods for string sanitization hide confidential patterns introducing, however, a number of spurious patterns that may harm ...
G. Bernardini (Giulia) +9 more
openaire +6 more sources
Small Longest Tandem Scattered Subsequences
We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string.
Luıs M. S. Russo +1 more
doaj +1 more source
Computing Maximal Lyndon Substrings of a String
There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal ...
Frantisek Franek, Michael Liut
doaj +1 more source
Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance
The edit distance is a metric of dissimilarity between strings, widely applied in computational biology, speech recognition, and machine learning. Let ek(n) denote the average edit distance between random, independent strings of n characters from an ...
Gianfranco Bilardi, Michele Schimd
doaj +1 more source
Optimized Signature Selection for Efficient String Similarity Search
In this paper, we study the problem of string similarity search to retrieve in a database all strings similar to a query string within a given threshold. To measure the similarity between strings, we use edit distance.
Taegyoung Lee, Tae-Sun Chung, Jongik Kim
doaj +1 more source
Direct Visualisation of Skyrmion Lattice Defect Alignment at Grain Boundaries
We present a method to directly visualise a statistical analysis of skyrmion defect alignment at grain boundaries in the skyrmion host $$\hbox {Cu}_2$$ Cu 2 OSeO3.
Thomas Schönenberger +6 more
doaj +1 more source
Modeling emergence of Wolbachia toxin-antidote protein functions with an evolutionary algorithm
Evolutionary algorithms (EAs) simulate Darwinian evolution and adeptly mimic natural evolution. Most EA applications in biology encode high levels of abstraction in top-down population ecology models.
John Beckmann +2 more
doaj +1 more source
Efficient top-k string similarity query algorithms
Computing top-k similar strings based on edit distance,i.e.,given a query string σ and string set S,finding k similar strings to σ based on edit distance from S.Firstly,two adaptive filter strategies based on length-skip index are proposed,such that to ...
Zi-yang CHEN +3 more
doaj +2 more sources

