Results 51 to 60 of about 272,212 (190)
BIOS, 2020 String matching is an algorithm for matching a text to another text or also known as a text search. There are several algorithms that can be used for string matching, including the Boyer-Moore algorithm and the Brute Force algorithm.
Candra Irawan, Mudafiq Riyan Pratama
doaj +1 more source
String attractors and combinatorics on words [PDF]
, 2019 The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors.
Mantaci S. +4 more
core
Random Access to Grammar Compressed Strings
, 2011 Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures many popular compression schemes.
Bille, Philip +5 more
core +1 more source
Reconstruction algorithms for DNA-storage systems
Scientific ReportsMotivated by DNA storage systems, this work presents the DNA reconstruction problem, in which a length-n string, is passing through the DNA-storage channel, which introduces deletion, insertion and substitution errors.
Omer Sabary +3 more
doaj +1 more source
Algorithm engineering : string processing [PDF]
, 2016 The string matching problem has attracted a lot of interest throughout the history of computer science, and is crucial to the computing industry. The theoretical community in Computer Science has a developed a rich literature in the design and analysis of string matching algorithms.
openaire +1 more source
Iraqi Journal for Computers and InformaticsAlgorithms for string matching are considered one of the most extensively researched topics in the field of computer science due to their substantial role in various applications, such as information retrieval, editing, security, firewalls, and ...
Hayder kamil AL-Jazayiri +1 more
doaj +1 more source
Encoded expansion: an efficient algorithm to discover identical string motifs.
PLoS ONE, 2014 A major task in computational biology is the discovery of short recurring string patterns known as motifs. Most of the schemes to discover motifs are either stochastic or combinatorial in nature. Stochastic approaches do not guarantee finding the correct
Aqil M Azmi, Abdulrakeeb Al-Ssulami
doaj +1 more source
Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator
Mathematics, 2022 We study algorithms for solving three problems on strings. These are sorting of n strings of length k, “the Most Frequent String Search Problem”, and “searching intersection of two sequences of strings”.
Kamil Khadiev +2 more
doaj +1 more source
, 2019 We introduce fast-decodable indexing schemes for edit distance which can be used to speed up edit distance computations to near-linear time if one of the strings is indexed by an indexing string $I$.
Approximating +6 more
core +1 more source
Approximation Algorithms for String Folding Problems [PDF]
, 2000 We present polynomial-time approximation algorithms for string folding problems over any finite alphabet. Our idea is the following: describe a class of feasible solutions by means of an ambiguous context-free grammar (i.e. there is a bijection between the set of parse trees and a subset of possible embeddings of the string); give a score to every ...
Pavesi, G, MAURI, GIANCARLO
openaire +1 more source