Results 21 to 30 of about 18,990 (308)
Algorithmic complexity of protein identification: combinatorics of weighted strings [PDF]
, 2004 Cieliebak M, Erlebach T, Lipták Z, Stoye J, Welzl E. Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Applied Mathematics.
Lipták, Zsuzsanna +9 more
core +2 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 +2 more
core +2 more sources
Toward Efficient Similarity Search under Edit Distance on Hybrid Architectures
Information, 2022 Edit distance is the most widely used method to quantify similarity between two strings. We investigate the problem of similarity search under edit distance.
Madiha Khalid +2 more
doaj +1 more source
Kendall tau sequence distance: Extending Kendall tau from ranks to sequences [PDF]
EAI Endorsed Transactions on Industrial Networks and Intelligent Systems, 2020 An edit distance is a measure of the minimum cost sequence of edit operations to transform one structureinto another. Edit distance can be used as a measure of similarity as part of a pattern recognition system, withlower values of edit distance implying
Vincent Cicirello
doaj +1 more source
The Number of Repetitions in 2D-Strings [PDF]
, 2020 The notions of periodicity and repetitions in strings, and hence these of runs and squares, naturally extend to two-dimensional strings. We consider two types of repetitions in 2D-strings: 2D-runs and quartics (quartics are a 2D-version of squares in ...
Radoszewski, Jakub +4 more
core +1 more source
An efficient rank based approach for closest string and closest substring. [PDF]
PLoS ONE, 2012 This paper aims to present a new genetic approach that uses rank distance for solving two known NP-hard problems, and to compare rank distance with other distance measures for strings.
Liviu P Dinu, Radu Ionescu
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
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings [PDF]
, 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
Algorithms for Bitmasking Strings [PDF]
, 2006 In this paper we present algorithms for efficiently bitmasking strings. In particular, we assume a pattern (the bitmask) consisting of zeroes and ones as well as a text over an alphabet Sigma and the goal is to extract information efficiently when we ...
Iliopoulos, C +7 more
core +1 more source
String inference from longest-common-prefix array [PDF]
, 2023 The suffix array, perhaps the most important data structure in modern string processing, is often augmented with the longest common prefix (LCP) array which stores the lengths of the longest common prefixes for lexicographically adjacent suffixes of a ...
Kärkkäinen, Juha +2 more
core +1 more source