Results 31 to 40 of about 17,415 (264)
Modeling emergence of Wolbachia toxin-antidote protein functions with an evolutionary algorithm
Frontiers in Microbiology, 2023 Evolutionary algorithms (EAs) simulate Darwinian evolution and adeptly mimic natural evolution. Most EA applications in biology encode high levels of abstraction in top-down population ecology models.
John Beckmann +2 more
doaj +1 more source
Efficient top-k string similarity query algorithms
Tongxin xuebao, 2014 Computing top-k similar strings based on edit distance,i.e.,given a query string σ and string set S,finding k similar strings to σ based on edit distance from S.Firstly,two adaptive filter strategies based on length-skip index are proposed,such that to ...
Zi-yang CHEN +3 more
doaj +2 more sources
PMS6MC: A Multicore Algorithm for Motif Discovery
Algorithms, 2013 We develop an efficient multicore algorithm, PMS6MC, for the (l; d)-motif discovery problem in which we are to find all strings of length l that appear in every string of a given set of strings with at most d mismatches. PMS6MC is based on PMS6, which is
Shibdas Bandyopadhyay +2 more
doaj +1 more source
Integrality, duality and finiteness in combinatoric topological strings
Journal of High Energy Physics, 2022 A remarkable result at the intersection of number theory and group theory states that the order of a finite group G (denoted |G|) is divisible by the dimension d R of any irreducible complex representation of G.
Robert de Mello Koch +3 more
doaj +1 more source
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
Algorithms on Grammar-Compressed Strings [PDF]
, 2011 Grammar based compression, where one replaces a long string by a small contextfree grammar that generates the string, is a simple and powerful paradigm that captures many of the popular compression schemes, including the Lempel-Ziv family, Run-Length Encoding, Byte-Pair Encoding, Sequitur and Re-Pair.
openaire +1 more source
ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS [PDF]
International Journal of Foundations of Computer Science, 2012 The Parikh vector p(s) of a string s over a finite ordered alphabet Σ = {a1, …, aσ} is defined as the vector of multiplicities of the characters, p(s) = (p1, …, pσ), where pi = |{j | sj = ai}|. Parikh vector q occurs in s if s has a substring t with p(t) = q. The problem of searching for a query q in a text s of length n can be solved simply and worst-
Peter Burcsi +3 more
openaire +4 more sources
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Lithium Niobate Electro-Optic Photonic Processor for Variational Quantum Eigensolver. [PDF]
Adv Sci (Weinh)An integrated lithium‐niobate‐on‐insulator ququart processor implements an electro‐optically controlled photonic variational quantum eigensolver using single photons encoded in four path modes. Bell‐basis‐emulating ququart projective measurements reduce measurement settings while achieving chemical‐accuracy‐level molecular‐energy estimation.
Lee J +11 more
europepmc +2 more sources
Advanced Engineering Materials, EarlyView.Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch +3 more
wiley +1 more source