Results 31 to 40 of about 148,669 (285)

Modeling emergence of Wolbachia toxin-antidote protein functions with an evolutionary algorithm

open access: yesFrontiers 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

Optimized Signature Selection for Efficient String Similarity Search

open access: yesIEEE Access, 2020
In this paper, we study the problem of string similarity search to retrieve in a database all strings similar to a query string within a given threshold. To measure the similarity between strings, we use edit distance.
Taegyoung Lee, Tae-Sun Chung, Jongik Kim
doaj   +1 more source

Direct Visualisation of Skyrmion Lattice Defect Alignment at Grain Boundaries

open access: yesNanoscale Research Letters, 2022
We present a method to directly visualise a statistical analysis of skyrmion defect alignment at grain boundaries in the skyrmion host $$\hbox {Cu}_2$$ Cu 2 OSeO3.
Thomas Schönenberger   +6 more
doaj   +1 more source

Randomized Fast Design of Short DNA Words

open access: yes, 2005
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivations including DNA computing and DNA self-assembly.
Kao, Ming-Yang   +2 more
core   +2 more sources

Efficient Average-Case Population Recovery in the Presence of Insertions and Deletions [PDF]

open access: yes, 2019
A number of recent works have considered the trace reconstruction problem, in which an unknown source string x in {0,1}^n is transmitted through a probabilistic channel which may randomly delete coordinates or insert random bits, resulting in a trace of ...
Ban, Frank   +3 more
core   +2 more sources

Fast $q$-gram Mining on SLP Compressed Strings

open access: yes, 2011
We present simple and efficient algorithms for calculating $q$-gram frequencies on strings represented in compressed form, namely, as a straight line program (SLP). Given an SLP of size $n$ that represents string $T$, we present an $O(qn)$ time and space
Bannai, Hideo   +3 more
core   +1 more source

Integrality, duality and finiteness in combinatoric topological strings

open access: yesJournal 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

Searching for Signatures of Cosmic Superstrings in the CMB

open access: yes, 2009
Because cosmic superstrings generically form junctions and gauge theoretic strings typically do not, junctions may provide a signature to distinguish between cosmic superstrings and gauge theoretic cosmic strings.
A. Hanany   +22 more
core   +1 more source

Efficient top-k string similarity query algorithms

open access: yesTongxin 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

open access: yesAlgorithms, 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

Home - About - Disclaimer - Privacy