String Matching with Multicore CPUs: Performing Better with the Aho-Corasick Algorithm
, 2014 Multiple string matching is known as locating all the occurrences of a given number of patterns in an arbitrary string. It is used in bio-computing applications where the algorithms are commonly used for retrieval of information such as sequence analysis
Arudchutha, S. +2 more
core +1 more source
Improved Parallel Rabin-Karp Algorithm Using Compute Unified Device Architecture
, 2018 String matching algorithms are among one of the most widely used algorithms in computer science. Traditional string matching algorithms efficiency of underlaying string matching algorithm will greatly increase the efficiency of any application. In recent
D Xu +6 more
core +1 more source
Developing JSequitur to Study the Hierarchical Structure of Biological Sequences in a Grammatical Inference Framework of String Compression Algorithms [PDF]
Genomics & Informatics, 2012 Grammatical inference methods are expected to find grammatical structures hidden in biological sequences. One hopes that studies of grammar serve as an appropriate tool for theory formation.
Bulgan Galbadrakh +2 more
doaj +1 more source
Faster Compact On-Line Lempel-Ziv Factorization [PDF]
, 2013 We present a new on-line algorithm for computing the Lempel-Ziv factorization of a string that runs in $O(N\log N)$ time and uses only $O(N\log\sigma)$ bits of working space, where $N$ is the length of the string and $\sigma$ is the size of the alphabet.
Bannai, Hideo +4 more
core +2 more sources
3-Partition Order-Preserving Pattern Matching
MathematicsTwo strings of equal length are called order-isomorphic if their relative orders are identical at every position. The classical order-preserving pattern matching (OPPM) problem finds all substrings in a text T that are order-isomorphic to a pattern P ...
Joong Chae Na +2 more
doaj +1 more source
Fast $q$-gram Mining on SLP Compressed Strings
, 2011 We present simple and efficient algorithms for calculating $q$-gram frequencies on strings represented in compressed form, namely, as a straight line program (SLP). Given an SLP of size $n$ that represents string $T$, we present an $O(qn)$ time and space
Bannai, Hideo +3 more
core +1 more source
Optimal Substring-Equality Queries with Applications to Sparse Text Indexing
, 2020 We consider the problem of encoding a string of length $n$ from an integer alphabet of size $\sigma$ so that access and substring equality queries (that is, determining the equality of any two substrings) can be answered efficiently.
Prezza, Nicola
core +1 more source
Text Indexing for Faster Gapped Pattern Matching
AlgorithmsWe revisit the following version of the Gapped String Indexing problem, where the goal is to preprocess a text T[1..n] to enable efficient reporting of all occ occurrences of a gapped pattern P=P1[α..β]P2 in T.
Md Helal Hossen +2 more
doaj +1 more source
Double Scaling Limits and Twisted Non-Critical Superstrings [PDF]
, 2006 We consider double-scaling limits of multicut solutions of certain one matrix models that are related to Calabi-Yau singularities of type A and the respective topological B model via the Dijkgraaf-Vafa correspondence.
A. Giveon +35 more
core +3 more sources
Research on Advanced Control Method of Multiple Photovoltaic Strings Input Type Recognition
Frontiers in Energy Research, 2022 In order to decrease the performance effect of a single string in part of a photovoltaic (PV) array and increase the adaptive PV power generation, independent multiple series-connected PV strings are usually adopted in PV system projects to implement the
Yiwang Wang +7 more
doaj +1 more source