Results 31 to 40 of about 147,630 (190)

Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests [PDF]

open access: yes, 2014
We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams (BDD). The key idea
Bouajjani A.   +10 more
core   +5 more sources

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

Collapsing Superstring Conjecture [PDF]

open access: yes, 2019
In the Shortest Common Superstring (SCS) problem, one is given a collection of strings, and needs to find a shortest string containing each of them as a substring. SCS admits 2 11/23-approximation in polynomial time (Mucha, SODA\u2713).
Golovnev, Alexander   +4 more
core   +2 more sources

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

The photon propagator in compact QED_{2+1}: the effect of wrapping Dirac strings

open access: yes, 2003
We discuss the influence of closed Dirac strings on the photon propagator in the Landau gauge emerging from a study of the compact U(1) gauge model in 2+1 dimensions. This gauge also minimizes the total length of the Dirac strings.
A. Schiller   +30 more
core   +1 more source

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

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

Home - About - Disclaimer - Privacy