Results 11 to 20 of about 272,212 (190)
Exact and kernelization algorithms for Closet String
Selecciones Matemáticas, 2020 In this paper we address CLOSEST STRING problem that arises in web searching, coding theory and computational molecular biology. To solve it is to find a string that minimizes the maximum Hamming distance from a given set of strings. CLOSEST STRING is an
Omar Latorre Vilca
doaj +1 more source
TopicStriKer: A topic kernels-powered approach for text classification
Results in Engineering, 2023 Topic models are unsupervised machine learning techniques that output clusters of “topics” represented as co-occurring words with their associated probability distributions.
Nikhil V. Chandran +2 more
doaj +1 more source
Combinatoric topological string theories and group theory algorithms
Journal of High Energy Physics, 2022 A number of finite algorithms for constructing representation theoretic data from group multiplications in a finite group G have recently been shown to be related to amplitudes for combinatoric topological strings (G-CTST) based on Dijkgraaf-Witten ...
Sanjaye Ramgoolam, Eric Sharpe
doaj +1 more source
Boosting Perturbation-Based Iterative Algorithms to Compute the Median String
IEEE Access, 2021 The most competitive heuristics for calculating the median string are those that use perturbation-based iterative algorithms. Given the complexity of this problem, which under many formulations is NP-hard, the computational cost involved in the exact ...
Pedro Mirabal +4 more
doaj +1 more source
Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings
Algorithms, 2019 We present two modifications of Duval’s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it is able to
Sukhpal Singh Ghuman +2 more
doaj +1 more source
Parallel String Sample Sort [PDF]
, 2013 We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we propose string ...
J. Kärkkäinen +9 more
core +3 more sources
International Journal Of Engineering And Computer Science, 2018 To analyze the content of the documents, the various pattern matching algorithms are used to find all the occurrences of a limited set of patterns within an input text or input document. In order to perform this task, this research work used four existing string matching algorithms; they are Brute Force algorithm, Knuth-Morris-Pratt algorithm (KMP ...
Preeti Narooka +2 more
openaire +2 more sources
Computational Dynamics of a 3D Elastic String Pendulum Attached to a Rigid Body and an Inertially Fixed Reel Mechanism [PDF]
, 2009 A high fidelity model is developed for an elastic string pendulum, one end of which is attached to a rigid body while the other end is attached to an inertially fixed reel mechanism which allows the unstretched length of the string to be dynamically ...
Lee, Taeyoung +2 more
core +5 more sources
APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING
Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska, 2017 We consider the application of multiple pattern matching (Multi AOSO on q-Grams) algorithm for approximate pattern matching. We propose the on-line approach which translates the problem from approximate pattern matching into a multiple pattern one ...
Robert Susik
doaj +1 more source
Novel Algorithms for Graph Clustering Applied to Human Activities
Mathematics, 2021 In this paper, a novel algorithm (IBC1) for graph clustering with no prior assumption of the number of clusters is introduced. Furthermore, an additional algorithm (IBC2) for graph clustering when the number of clusters is given beforehand is presented ...
Nebojsa Budimirovic, Nebojsa Bacanin
doaj +1 more source