Results 81 to 90 of about 70,442,116 (202)
New Algorithms for δγ-Order Preserving Matching
Ingeniería, 2018 Context: Order-preserving matching regards the relative order of strings. However, its application areas require more flexibility in the matching paradigm. We advance in this direction in this paper that extends our previous work [27]. Method: We define
Juan Mendivelso +3 more
doaj +1 more source
Experiments with a fast string searching algorithm
Information Processing Letters, 1983 <p>Consider the problem of finding the first occurrence of a particular pattern in a (long) string of characters. Boyer and Moore found a fast algorithm for doing this. Here we consider how this algorithm behaves when executed on a multiprocessor.</p><p>It is shown that a simple implementation performs very well.
Peter Møller-Nielsen +1 more
openaire +3 more sources
Linear time algorithms for finding and representing all the tandem repeats in a string [PDF]
, 2004 Gusfield D, Stoye J. Linear time algorithms for finding and representing all the tandem repeats in a string. Journal of computer and system sciences. 2004;69(4):525-546.A tandem repeat (or square) is a string [alpha][alpha], where [alpha] is a non-empty ...
Stoye, Jens ; https://orcid.org/ +1 more
core +1 more source
Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties [PDF]
, 2016 Strings with don't care symbols, also called partial words, and more general indeterminate strings are a natural representation of strings containing uncertain symbols.
Radoszewski, Jakub +1 more
core +1 more source
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings
, 2016 In this paper we investigate jumbled (Abelian) versions of three classical strings problems. In all these problems we assume the input string S[1..n]is given in its run-length format S′[1..r].No Full ...
Amir, Amihood +5 more
core +1 more source
Efficient motif finding algorithms for large-alphabet inputs
BMC Bioinformatics, 2010 Background We consider the problem of identifying motifs, recurring or conserved patterns, in the biological sequence data sets. To solve this task, we present a new deterministic algorithm for finding patterns that are embedded as exact or inexact ...
Pavlovic Vladimir, Kuksa Pavel P
doaj +1 more source
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction
Discrete Optimization, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Faisal N. Abu-Khzam +4 more
openaire +3 more sources
string2string: A Modern Python Library for String-to-String Algorithms
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations)We introduce string2string, an open-source library that offers a comprehensive suite of efficient algorithms for a broad range of string-to-string problems. It includes traditional algorithmic solutions as well as recent advanced neural approaches to tackle various problems in string alignment, distance measurement, lexical and semantic search, and ...
Mirac Suzgun +2 more
openaire +3 more sources
Construction of distributed suffix trees
Технічна інженеріяThe paper addresses the problem of parallel suffix tree construction over large text arrays without the use of cluster infrastructure. The evolution of relevant algorithms is analysed – from the single-threaded methods of Weiner, McCreight, and Ukkonen ...
D.V. Zvazhii, O.M. Malii
doaj +1 more source
Congress of Strings, August 5, 1976 [PDF]
, 1976 Concert program for Congress of Strings, August 5 ...
core