Results 21 to 30 of about 5,721,874 (232)
Algorithms for anti-powers in strings [PDF]
Information Processing Letters, 2018 A string $S[1,n]$ is a power (or tandem repeat) of order $k$ and period $n/k$ if it can decomposed into $k$ consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorithms for their efficient computation have wide application and are heavily studied. Recently, Fici et al. (Proc. ICALP 2016) defined an
Golnaz Badkobeh +2 more
openaire +2 more sources
Faster algorithm of string comparison [PDF]
Pattern Analysis & Applications, 2003 In many applications, it is necessary to determine the string similarity. Edit distance[WF74] approach is a classic method to determine Field Similarity. A well known dynamic programming algorithm [GUS97] is used to calculate edit distance with the time complexity O(nm).
Qi Xiao Yang +4 more
openaire +3 more sources
A Survey on Shortest Unique Substring Queries
Algorithms, 2020 The shortest unique substring (SUS) problem is an active line of research in the field of string algorithms and has several applications in bioinformatics and information retrieval. The initial version of the problem was proposed by Pei et al. [ICDE’13].
Paniz Abedin +2 more
doaj +1 more source
Handling data-skewness in character based string similarity join using Hadoop [PDF]
Applied Computing and Informatics, 2022 The scalability of similarity joins is threatened by the unexpected data characteristic of data skewness. This is a pervasive problem in scientific data.
Kanak Meena +3 more
doaj +1 more source
Computing Maximal Lyndon Substrings of a String
Algorithms, 2020 There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal ...
Frantisek Franek, Michael Liut
doaj +1 more source
Minimum Common String Partition: Exact Algorithms [PDF]
, 2021 In the minimum common string partition problem (MCSP), one gets two strings and is asked to find the minimum number of cuts in the first string such that the second string can be obtained by rearranging the resulting pieces. It is a difficult algorithmic
Reznikov, Grigory +5 more
core +1 more source
Small Longest Tandem Scattered Subsequences
Scientific Annals of Computer Science, 2021 We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string.
Luıs M. S. Russo +1 more
doaj +1 more source
Efficient and effectiveness retrieval of information using some of the approximate string matching algorithms [PDF]
مجلة التربية والعلم, 2008 The research aims at buliding integral computer database for sales ,by using six algorithms of approximate string matching with practicable example;soundex,information metaphone,longest common subsequence ,dice cofficient,levenshtein distance and fuzzy ...
Anhar Mohammed, Suhiar Essa
doaj +1 more source
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
Exact and kernelization algorithms for Closet String
Selecciones Matemáticas, 2020 In this paper we address CLOSEST STRING problem that arises in web searching, coding theory and computational molecular biology. To solve it is to find a string that minimizes the maximum Hamming distance from a given set of strings. CLOSEST STRING is an
Omar Latorre Vilca
doaj +1 more source