Results 61 to 70 of about 272,212 (190)

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-
Péter Burcsi, Cicalese, Ferdinando, Gabriele Fici, Liptak, Zsuzsanna   +3 more
openaire   +4 more sources

Improved algorithms for approximate string matching (extended abstract)

BMC Bioinformatics, 2009
Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition.
Papamichail Georgios, Papamichail Dimitris   +1 more
doaj   +1 more source

Evolving neural networks with genetic algorithms to study the string landscape

Journal of High Energy Physics, 2017
We study possible applications of artificial neural networks to examine the string landscape. Since the field of application is rather versatile, we propose to dynamically evolve these networks via genetic algorithms.
Fabian Ruehle
doaj   +1 more source

Space-efficient detection of unusual words

, 2015
Detecting all the strings that occur in a text more frequently or less frequently than expected according to an IID or a Markov model is a basic problem in string mining, yet current algorithms are based on data structures that are either space ...
A Apostolico, A Apostolico, CAR Hoare, D Belazzougui, D Belazzougui, J Herold, J Lin, M Crochemore, S Chairungsee   +8 more
core   +1 more source

PMS6MC: A Multicore Algorithm for Motif Discovery

Algorithms, 2013
We develop an efficient multicore algorithm, PMS6MC, for the (l; d)-motif discovery problem in which we are to find all strings of length l that appear in every string of a given set of strings with at most d mismatches. PMS6MC is based on PMS6, which is
Shibdas Bandyopadhyay, Sartaj Sahni, Sanguthevar Rajasekaran   +2 more
doaj   +1 more source

Efficient quantum gates and algorithms in an engineered optical lattice

Scientific Reports, 2021
In this work, trapped ultracold atoms are proposed as a platform for efficient quantum gate circuits and algorithms. We also develop and evaluate quantum algorithms, including those for the Simon problem and the black-box string-finding problem.
A. H. Homid, M. Abdel-Aty, M. Qasymeh, H. Eleuch   +3 more
doaj   +1 more source

Searching for Signatures of Cosmic Superstrings in the CMB

, 2009
Because cosmic superstrings generically form junctions and gauge theoretic strings typically do not, junctions may provide a signature to distinguish between cosmic superstrings and gauge theoretic cosmic strings.
A. Hanany, A. Lewis, A. Stewart, A. Vilenkin, A.A. Fraisse, C. Ringeval, E.J. Copeland, E.J. Copeland, J. Canny, K. Hashimoto, L. Leblond, M.B. Hindmarsh, M.G. Jackson, R.A. Battye, R.A. Battye, R.J. Danos, Rebecca J Danos, Robert H Brandenberger, S. Amsel, T.W.B. Kibble, T.W.B. Kibble, U. Seljak, Y.B. Zeldovich   +22 more
core   +1 more source

A Comparative Study for String Metrics and the Feasibility of Joining them as Combined Text Similarity Measures

ARO-The Scientific Journal of Koya University, 2017
This paper aims to introduce an optimized Damerau–Levenshtein and dice-coefficients using enumeration operations (ODADNEN) for providing fast string similarity measure with maintaining the results accuracy; searching to find specific words within a large
Safa S. Abdul-Jabbar, Loay E. George
doaj   +1 more source

Optimal Character Distance Sampling for Exact String Matching Through Set Cover Reformulation

IEEE Access
Character Distance Sampling (CDS) is part of a broader class of string matching techniques that leverage sampling strategies. These methods provide an effective compromise between the prohibitive space requirements of offline approaches and the high ...
Simone Faro, Thierry Lecroq, Francesco Pio Marino   +2 more
doaj   +1 more source

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

, 2007
We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes.
A. Amir, E.W. Myers, G. Navarro, G. Navarro, G. Navarro, G.M. Landau, J. Kärkkäinen, J. Ziv, J. Ziv, K. Thompson, M. Dietzfelbinger, M. Farach, P. Sellers, R. Cole, T.A. Welch, V. Mäkinen   +15 more
core   +4 more sources