Results 81 to 90 of about 5,721,874 (232)
Quantum search for a given substring in the text using a hashing technique
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 The problem of searching for a given substring in the text was considered. It is known that classical algorithms solve this problem in a linear time depending on the length of the text and the specified template. Quantum algorithms speed up the search by
N.M. Salikhova
doaj +1 more source
AN ALGORITHMIC APPROACH TO STRING PHENOMENOLOGY [PDF]
Modern Physics Letters A, 2010 We review the recent programme undertaken to construct, systematically and algorithmically, large classes of heterotic vacua, as well as the search for the MSSM therein. Specifically, we outline the monad construction of vector bundles over complete intersection Calabi–Yau threefolds, their classification, stability, equivariant cohomology and ...
openaire +3 more sources
Exploring the sound-space of synthesis algorithms using interactive genetic algorithms [PDF]
, 1999 Exploring the sounds available from a synthesis algorithm is a complicated process, requiring the user either to spend much time gaining heuristic experience with the algorithm or requiring them to have a deep knowledge of the underlying synthesis ...
Johnson, Colin G.
core
Efficient implementation of lazy suffix trees [PDF]
, 2003 Giegerich R, Kurtz S, Stoye J. Efficient implementation of lazy suffix trees. SOFTWARE-PRACTICE & EXPERIENCE. 2003;33(11):1035-1049.We present an efficient implementation of a write-only top-down construction for suffix trees.
Stoye, Jens ; https://orcid.org/ +2 more
core +2 more sources
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
Bowing models for string players [PDF]
, 2009 A bowing is a sequence of bow motions that enable a piece of music to be played on a string instrument with an appropriate interpretation and sound. Traditional notation shows only the bow direction for a few notes.
O'Donnell, J.T., Hall, C.V.
core
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
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 Matching Algorithms [PDF]
, 2016 U ovom radu obradili smo najosnovnije metode za podudaranje znakovnih nizova i kompresiju teksta. Za svaki od ovih tipova analizirali smo nekoliko najbitnijih algoritama.
Maršić, Marin
core
Scalable Distributed String Sorting [PDF]
String sorting is an important part of tasks such as building index data structures. Unfortunately, current string sorting algorithms do not scale to massively parallel distributed-memory machines since they either have latency (at least) proportional to
Kurpicz, Florian +3 more
core +1 more source