Results 1 to 10 of about 272,192 (170)
Sublinear Algorithms for Approximating String Compressibility [PDF]
Algorithmica, 2007 We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and Lempel-Ziv (
Raskhodnikova, Sofya +3 more
core +10 more sources
Highly Scalable Algorithms for Robust String Barcoding [PDF]
International Journal of Bioinformatics Research and Applications, 2005 String barcoding is a recently introduced technique for genomic-based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms for robust string barcoding.
DasGupta, Bhaskar +3 more
core +5 more sources
An Improved Algorithm for Approximate String Matching [PDF]
SIAM Journal on Computing, 1989 Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented.
Galil, Zvi, Park, Kunsoo
core +4 more sources
Review on String-Matching Algorithm [PDF]
SHS Web of Conferences, 2022 String-matching algorithm is one of the most researched algorithms in computer science which has become an important factor in many technologies. This field aims at utilizing the least time and resources to find desired sequence of character in complex ...
Zhang Zhaoyang
doaj +1 more source
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
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
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).
Yang, Q. X. +4 more
openaire +3 more sources
Exact String Matching Algorithms: Survey, Issues, and Future Research Directions
IEEE Access, 2019 String matching has been an extensively studied research domain in the past two decades due to its various applications in the fields of text, image, signal, and speech processing.
Saqib Iqbal Hakak +5 more
doaj +1 more source