Results 1 to 10 of about 273,980 (145)
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 +3 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
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
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
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
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
Parallel String Sample Sort [PDF]
, 2013 We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we propose string ...
J. Kärkkäinen +9 more
core +3 more sources
TopicStriKer: A topic kernels-powered approach for text classification
Results in Engineering, 2023 Topic models are unsupervised machine learning techniques that output clusters of “topics” represented as co-occurring words with their associated probability distributions.
Nikhil V. Chandran +2 more
doaj +1 more source