Results 71 to 80 of about 272,212 (190)
AN ALGORITHMIC APPROACH TO STRING PHENOMENOLOGY [PDF]
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
On the String Consensus Problem and the Manhattan Sequence Consensus Problem
In the Manhattan Sequence Consensus problem (MSC problem) we are given $k$ integer sequences, each of length $l$, and we are to find an integer sequence $x$ of length $l$ (called a consensus sequence), such that the maximum Manhattan distance of $x$ from
A. Amir +12 more
core +1 more source
Repetitions in strings: Algorithms and combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Crochemore, Maxime +2 more
openaire +4 more sources
Accelerated preprocessing in task of searching substrings in a string
Introduction. A rapid development of the systems such as Yandex, Google, etc., has predetermined the relevance of the task of searching substrings in a string, and approaches to its solution are actively investigated. This task is used to create database
A. V. Mazurenko, N. V. Boldyrikhin
doaj +1 more source
Noise cancellation using total variation for copy number variation detection
Background Due to recent advances in sequencing technologies, sequence-based analysis has been widely applied to detecting copy number variations (CNVs).
Fatima Zare +2 more
doaj +1 more source
Random deep neural networks are biased towards simple functions
We prove that the binary classifiers of bit strings generated by random wide deep neural networks with ReLU activation function are biased towards simple functions. The simplicity is captured by the following two properties.
De Palma, Giacomo +2 more
core
Intelligent Predictive String Search Algorithm
AbstractText processing has moved beyond merely word processing and desktop publishing softwares, which currently form a miniscule part of its application. With the advent of the internet and the huge amount of text processing associated with information mining, string search algorithms have gained importance.
Gurung, Dipendra +2 more
openaire +1 more source
An approximate string-matching algorithm
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, J.Y., Shawe-Taylor, J.
openaire +1 more source
Efficient algorithms for string pattern matching to protect search content
Efficient algorithms for online string pattern matching have been deemed crucial for cloud database retrieval. However, the potential leaking of search content has been recognized as a threat to users' privacy. Existing string pattern matching algorithms
Jianxu WANG, Rui LI, Yin LI
doaj +1 more source
Optimal parallel algorithms for string matching
Let WRAM [PRAM] be a parallel computer with p processors (RAM's) which share a common memory and are allowed simultaneous reads and writes [only simultaneous reads]. The only type of simultaneous writes allowed is a simultaneous AND: several processors may write O simultaneously into the same memory cell. Let t be the time bound of the computer.
openaire +4 more sources

