CryptoGA: a cryptosystem based on genetic algorithm for cloud data security
Cloud Computing is referred to as a set of hardware and software that are being combined
to deliver various services of computing. The cloud keeps the services for delivery of …
to deliver various services of computing. The cloud keeps the services for delivery of …
Pattern-matching and text-compression algorithms
M Crochemore, T Lecroq - ACM Computing Surveys (CSUR), 1996 - dl.acm.org
Pattern matching is the problem of locating a specific pattern inside raw data. The pattern is
usually a collection of strings described in some formal language. Applications require two …
usually a collection of strings described in some formal language. Applications require two …
Screening and identification of potential biomarkers for pancreatic cancer: An integrated bioinformatics analysis
S Jafari, M Ravan, I Karimi-Sani, H Aria… - … -Research and Practice, 2023 - Elsevier
Pancreatic cancer is one of the highly invasive and the seventh most common cause of
death among cancers worldwide. To identify essential genes and the involved mechanisms …
death among cancers worldwide. To identify essential genes and the involved mechanisms …
LsHASHq: A string matching algorithm exploiting longer q-gram shifting
AM Al-Ssulami, AM Azmi, H Mathkour… - Information Processing & …, 2022 - Elsevier
String matching is a classical computer science problem where we search for all the
occurrences of a text string of size m, typically called pattern, in a string of size n, where both …
occurrences of a text string of size m, typically called pattern, in a string of size n, where both …
Fast algorithms for single and multiple pattern Cartesian tree matching
Cartesian tree matching is the problem of finding every substring of a given text which has
the same Cartesian tree as that of a given pattern. In this paper we propose fast algorithms …
the same Cartesian tree as that of a given pattern. In this paper we propose fast algorithms …
A weak approach to suffix automata simulation for exact and approximate string matching
S Faro, S Scafiti - Theoretical Computer Science, 2022 - Elsevier
String matching is one of the most extensively studied problems in computer science, mainly
due to its direct applications to such diverse areas as text, image and signal processing …
due to its direct applications to such diverse areas as text, image and signal processing …
Fast packed string matching for short patterns
S Faro, MO Külekci - 2013 Proceedings of the Fifteenth Workshop on …, 2013 - SIAM
Searching for all occurrences of a pattern in a text is a fundamental problem in computer
science with applications in many other fields, like natural language processing, information …
science with applications in many other fields, like natural language processing, information …
[HTML][HTML] Fast string matching for DNA sequences
In this paper we propose the Maximal Average Shift (MAS) algorithm that finds a pattern
scan order that maximizes the average shift length. We also present two extensions of MAS …
scan order that maximizes the average shift length. We also present two extensions of MAS …
Linear and efficient string matching algorithms based on weak factor recognition
We present a simple and very efficient algorithm for string matching based on the
combination of weak factor recognition and hashing. Despite its quadratic worst-case …
combination of weak factor recognition and hashing. Despite its quadratic worst-case …
Entropy-based approach in selection exact string-matching algorithms
The string-matching paradigm is applied in every computer science and science branch in
general. The existence of a plethora of string-matching algorithms makes it hard to choose …
general. The existence of a plethora of string-matching algorithms makes it hard to choose …