Results 41 to 50 of about 272,212 (190)
Open String Diagrams I: Topological Type [PDF]
, 1992 An arbitrary Feynman graph for string field theory interactions is analysed and the homeomorphism type of the corresponding world sheet surface is completely determined even in the non-orientable cases.
Nag, Subhashis, Sankaran, Parameswaran
core +2 more sources
Compressed Subsequence Matching and Packed Tree Coloring [PDF]
, 2014 We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $\sigma$, our algorithm uses $O(n+\frac{n\sigma}{w})$
A. Tiskin +25 more
core +3 more sources
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
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
Indeterminate string inference algorithms
Journal of Discrete Algorithms, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nazeen, Sumaiya +2 more
openaire +2 more sources
Readjoiner: a fast and memory efficient string graph-based sequence assembler
BMC Bioinformatics, 2012 Background Ongoing improvements in throughput of the next-generation sequencing technologies challenge the current generation of de novo sequence assemblers. Most recent sequence assemblers are based on the construction of a de Bruijn graph.
Gonnella Giorgio, Kurtz Stefan
doaj +1 more source
Quantum search for a given substring in the text using a hashing technique
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 The problem of searching for a given substring in the text was considered. It is known that classical algorithms solve this problem in a linear time depending on the length of the text and the specified template. Quantum algorithms speed up the search by
N.M. Salikhova
doaj +1 more source
Deconvolution in Measurements of Muon Neutrino Energy Spectra with IceCube [PDF]
EPJ Web of Conferences, 2019 As the energy of an incident neutrino cannot be accessed experimentally, muon neutrino energy spectra have to be inferred from energy-dependent observables, using deconvolution algorithms.
Ruhe Tim
doaj +1 more source
Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms
Intensif: Jurnal Ilmiah Penelitian Teknologi dan Penerapan Sistem Informasi, 2022 Several studies regarding excellent exact string matching algorithms can be used to identify similarity, including the Rabin-Karp, Winnowing, and Horspool Boyer-Moore algorithms.
Abdul Fadlil +2 more
doaj +1 more source
Algorithms for anti-powers in strings [PDF]
Information Processing Letters, 2018 A string $S[1,n]$ is a power (or tandem repeat) of order $k$ and period $n/k$ if it can decomposed into $k$ consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorithms for their efficient computation have wide application and are heavily studied. Recently, Fici et al. (Proc. ICALP 2016) defined an
Badkobeh, Golnaz +2 more
openaire +3 more sources