Results 31 to 40 of about 5,721,874 (232)
OE Matching Algorithm for Searching Biological Sequences [PDF]
, 2009 String matching algorithms play a key role in many computer science problems, and in the implementation of computer software. This problem has received, and continues to receive a great deal of attention due to various applications in text ...
Osborne, Hugh +4 more
core +1 more source
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
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
Repetitions in strings: Algorithms and combinatorics
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maxime Crochemore +2 more
openaire +4 more sources
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
Simple and flexible detection of contiguous repeats using a suffix tree [PDF]
, 2002 Stoye J, Gusfield D. Simple and flexible detection of contiguous repeats using a suffix tree. Theoretical Computer Science. 2002;270(1-2):843-856.We study the problem of detecting all occurrences of (primitive) tandem repeats and tandem arrays in a ...
Jens Stoye +4 more
core +2 more sources
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
STRING v10: protein–protein interaction networks, integrated over the tree of life
Nucleic Acids Res., 2014 The many functional partnerships and interactions that occur between proteins are at the core of cellular processing and their systematic characterization helps to provide context in molecular systems biology.
Damian Szklarczyk +13 more
semanticscholar +1 more source
Ultra-high throughput string matching for deep packet inspection [PDF]
, 2010 Deep Packet Inspection (DPI) involves searching a packet's header and payload against thousands of rules to detect possible attacks. The increase in Internet usage and growing number of attacks which must be searched for has meant hardware acceleration ...
Wang, Xiaojun +7 more
core +1 more source