Results 81 to 90 of about 272,212 (190)
Quark masses and mixing in string-inspired models
We study a class of supersymmetric Froggatt-Nielsen (FN) models with multiple U(1) symmetries and Standard Model (SM) singlets inspired by heterotic string compactifications on Calabi-Yau threefolds.
Andrei Constantin +4 more
doaj +1 more source
Background. The generally accepted approach to management in organizational systems today differs in that participants in problematic situations (PrS) are excluded from the processes of their solution.
N.Yu. Zaitseva, T.V. Moiseeva
doaj +1 more source
Nonabelian anyon condensation in 2+1d topological orders: A string-net model realization
We develop a comprehensive framework for realizing anyon condensation of topological orders within the string-net model by constructing a Hamiltonian that bridges the parent string-net model before and the child string-net model after anyon condensation.
Yu Zhao, Yidun Wan
doaj +1 more source
Classification of protein sequences by means of irredundant patterns
Background The classification of protein sequences using string algorithms provides valuable insights for protein function prediction. Several methods, based on a variety of different patterns, have been previously proposed.
Verzotto Davide, Comin Matteo
doaj +1 more source
With the unconventional energy sector (e.g., shale gas) increasingly focused on precision drilling and cost-effective extraction, slim-hole horizontal well technology is gaining prominence.
Xikun Gao +6 more
doaj +1 more source
Grammar Compression With Support to Fast Substring Extraction
We present a simple grammar-based compression strategy derived from the factorization used in the DC3 suffix-sorting algorithm that supports fast substring extraction. The input string is partitioned into non-overlapping substrings of fixed length $X$ ,
Danyelle S. O. Angelo +3 more
doaj +1 more source
Parallel string matching algorithms
This thesis presents different string searching algorithms. The string searching or string matching problem is one of the most basic problems on strings. It resurfaced with the development of bioinformatics and the need for DNA sequence analysis. It also presents a foundation for solving other, more complex string problems. First, we describe classical
openaire +1 more source
Exact string matching algorithms
Substring searching is one of the most prominent problems in computer science. We described and compared with each other by now well-known approaches to the solution. Algorithms were classified according to their properties, such as number of patterns and the direction in which the comparisons are performed.
openaire +1 more source
The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms. [PDF]
Dang DC, Lehre PK.
europepmc +1 more source
Medical pattern classification using a novel binary similarity approach based on an associative classifier. [PDF]
Velazquez-Gonzalez O +2 more
europepmc +1 more source

