Results 21 to 30 of about 17,415 (264)
Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms
Intensif: Jurnal Ilmiah Penelitian Teknologi dan Penerapan Sistem Informasi, 2022 Several studies regarding excellent exact string matching algorithms can be used to identify similarity, including the Rabin-Karp, Winnowing, and Horspool Boyer-Moore algorithms.
Abdul Fadlil +2 more
doaj +1 more source
Consistent Unsupervised Estimators for Anchored PCFGs
Transactions of the Association for Computational Linguistics, 2020 Learning probabilistic context-free grammars (PCFGs) from strings is a classic problem in computational linguistics since Horning ( 1969 ). Here we present an algorithm based on distributional learning that is a consistent estimator for a large class of ...
Clark, Alexander, Fijalkow, Nathanaël
doaj +1 more source
Rotation of bits: a classical and quantum perspective
Journal of Electrical Systems and Information Technology, 2021 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
Small Longest Tandem Scattered Subsequences
Scientific Annals of Computer Science, 2021 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
Indeterminate string inference algorithms
Journal of Discrete Algorithms, 2012 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]
2020 IEEE International Conference on Data Mining (ICDM), 2020 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
Computing Maximal Lyndon Substrings of a String
Algorithms, 2020 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
InformationThe 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
IEEE Access, 2020 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
Nanoscale Research Letters, 2022 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