Results 61 to 70 of about 70,442,116 (202)
Periodicity of Degenerate Strings
, 2023 Estéban Gabory, Eric Rivals, Michelle Sweering, Hilde Verbeek, Pengfei Wang: Periodicity of Degenerate Strings, pp. 42–56.Czech Technical University in Prague, Czech RepublicProceedings of PSC 2023, Jan Holub and Jan Žd’árek (Eds.), ISBN 978-80-01-07206 ...
Sweering, Michelle +4 more
core +2 more sources
Symmetric Keys for Lightweight Encryption Algorithms Using a Pre–Trained VGG16 Model
TelecomThe main challenge within lightweight cryptographic symmetric key systems is striking a delicate balance between security and efficiency. Consequently, the key issue revolves around crafting symmetric key schemes that are both lightweight and robust ...
Ala’a Talib Khudhair +2 more
doaj +1 more source
ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS [PDF]
International Journal of Foundations of Computer Science, 2005 Computing approximate patterns in strings or sequences has important applications in DNA sequence analysis, data compression, musical text analysis, and so on. In this paper, we introduce approximate k-covers and study them under various commonly used distance measures.
Lili Zhang, Francine Blanchet-Sadri
openaire +2 more sources
Random Generation Topology Coding Technique in Asymmetric Topology Encryption
MathematicsThe security of traditional public key cryptography algorithms depends on the difficulty of the underlying mathematical problems. Asymmetric topological encryption is a graph-dependent encryption algorithm produced to resist attacks by quantum computers ...
Jing Su, Bing Yao
doaj +1 more source
Algebraic Dynamic Programming on Trees
Algorithms, 2017 Where string grammars describe how to generate and parse strings, tree grammars describe how to generate and parse trees. We show how to extend generalized algebraic dynamic programming to tree grammars.
Sarah J. Berkemer +2 more
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
Beyond mutations: Accounting for quantitative changes in the analysis of protein evolution
Computational and Structural Biotechnology JournalMolecular phylogenetic research has relied on the analysis of the coding sequences by genes or of the amino acid sequences by the encoded proteins.
Xiaoyong Wu +2 more
doaj +1 more source
An Improved String-Searching Algorithm and Its Application in Component Security Testing
Tsinghua Science and Technology, 2016 Mass monitor logs are produced during the process of component security testing. In order to mine the explicit and implicit security exception information of the tested component, the log should be searched for keyword strings.
Jinfu Chen +6 more
doaj +1 more source
Congress of Strings, June 29, 1978 [PDF]
, 1978 Concert program for Congress of Strings, June 29 ...
core +1 more source
Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings
, 2019 We present two modifications of Duval's algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character.
Ghuman, Sukhpal Singh +5 more
core +1 more source