Results 31 to 40 of about 274,129 (290)

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., Nishanthy, T., Ragel, R. G.   +2 more
core   +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, Goto, Keisuke, Inenaga, Shunsuke, Takeda, Masayuki   +3 more
core   +1 more source

Indeterminate string inference algorithms

Journal of Discrete Algorithms, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz   +2 more
openaire   +2 more sources

3-Partition Order-Preserving Pattern Matching

Mathematics
Two 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, Seokchul Kang, Jeong Seop Sim   +2 more
doaj   +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, Kyung-Eun Lee, Hyun-Seok Park   +2 more
doaj   +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, DE Knuth, M Gongora-Blandon, N Singla, RM Karp, RS Boyer, RS Chillar   +6 more
core   +1 more source

Text Indexing for Faster Gapped Pattern Matching

Algorithms
We 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, Daniel Gibney, Sharma V. Thankachan   +2 more
doaj   +1 more source

ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS [PDF]

International Journal of Foundations of Computer Science, 2012
The Parikh vector p(s) of a string s over a finite ordered alphabet Σ = {a1, …, aσ} is defined as the vector of multiplicities of the characters, p(s) = (p1, …, pσ), where pi = |{j | sj = ai}|. Parikh vector q occurs in s if s has a substring t with p(t) = q. The problem of searching for a query q in a text s of length n can be solved simply and worst-
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták   +3 more
openaire   +4 more sources

Heterozygous loss‐of‐function alleles associate the conserved 3′‐5′ exoribonuclease EXOSC10 with hypersensitivity to the anticancer drug 5‐fluorouracil

Molecular Oncology, EarlyView.
EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain, Yann Le Page, Frédéric Percevault, Emmanuelle Becker, Luc Negroni, Almudena Fernandez, Marta Cantero, Diego Muñoz‐Santos, Lluís Montoliu, Cyrille Garnier, Michael Primig   +10 more
wiley   +1 more source

Near-Linear Time Insertion-Deletion Codes and (1+$\varepsilon$)-Approximating Edit Distance via Indexing

, 2019
We introduce fast-decodable indexing schemes for edit distance which can be used to speed up edit distance computations to near-linear time if one of the strings is indexed by an indexing string $I$.
Approximating, Efficiently, Goldwasser Shafi, Haeupler Bernhard, Haeupler Bernhard, Polylogarithmic, Selected   +6 more
core   +1 more source