Results 11 to 20 of about 5,721,874 (232)
Exact String Matching Algorithms: Survey, Issues, and Future Research Directions [PDF]
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 +6 more sources
Combinatorial Algorithms for String Sanitization [PDF]
ACM Transactions on Knowledge Discovery from Data, 2019 String data are often disseminated to support applications such as location-based service provision or DNA sequence analysis. This dissemination, however, may expose sensitive patterns that model confidential knowledge (e.g., trips to mental health ...
G. Bernardini +8 more
semanticscholar +12 more sources
Indeterminate string inference algorithms [PDF]
Journal of Discrete Algorithms, 2012 Regularities in indeterminate strings have recently been a matter of interest because of their use in the fields of molecular biology, musical text analysis, cryptanalysis and so on.
Sumaiya Nazeen +2 more
semanticscholar +4 more sources
string2string: A Modern Python Library for String-to-String Algorithms [PDF]
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations), 2023 We introduce string2string, an open-source library that offers a comprehensive suite of efficient algorithms for a broad range of string-to-string problems.
Mirac Suzgun +2 more
semanticscholar +3 more sources
Evolving neural networks with genetic algorithms to study the string landscape [PDF]
Journal of High Energy Physics, 2017 We study possible applications of artificial neural networks to examine the string landscape. Since the field of application is rather versatile, we propose to dynamically evolve these networks via genetic algorithms.
Fabian Ruehle
doaj +2 more sources
String correction using the Damerau-Levenshtein distance
BMC Bioinformatics, 2019 Background In the string correction problem, we are to transform one string into another using a set of prescribed edit operations. In string correction using the Damerau-Levenshtein (DL) distance, the permissible edit operations are: substitution ...
Chunchun Zhao, Sartaj Sahni
doaj +2 more sources
String Matching Algorithms [PDF]
, 2018 To analyze the content of the documents, the various pattern matching algorithms are used to find all the occurrences of a limited set of patterns within an input text or input document.
Mukku Bhagya Sri +2 more
semanticscholar +2 more sources
Fast algorithms for approximate circular string matching [PDF]
Algorithms for Molecular Biology, 2014 Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n.
Carl Barton, C. Iliopoulos, S. Pissis
semanticscholar +2 more sources
Near-Optimal Quantum Algorithms for String Problems [PDF]
Algorithmica, 2021 We study quantum algorithms for several fundamental string problems, including Longest Common Substring , Lexicographically Minimal String Rotation , and Longest Square Substring .
Shyan S. Akmal, Ce Jin
semanticscholar +1 more source
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