Results 61 to 70 of about 147,630 (190)

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, Christian Höner zu Siederdissen, Peter F. Stadler   +2 more
doaj   +1 more source

Space-efficient detection of unusual words

, 2015
Detecting all the strings that occur in a text more frequently or less frequently than expected according to an IID or a Markov model is a basic problem in string mining, yet current algorithms are based on data structures that are either space ...
A Apostolico, A Apostolico, CAR Hoare, D Belazzougui, D Belazzougui, J Herold, J Lin, M Crochemore, S Chairungsee   +8 more
core   +1 more source

Beyond mutations: Accounting for quantitative changes in the analysis of protein evolution

Computational and Structural Biotechnology Journal
Molecular phylogenetic research has relied on the analysis of the coding sequences by genes or of the amino acid sequences by the encoded proteins.
Xiaoyong Wu, Shesh N. Rai, Georg F. Weber   +2 more
doaj   +1 more source

Analysis of the multiplicity matching parameter in suffix trees [PDF]

Discrete Mathematics & Theoretical Computer Science, 2005
In a suffix tree, the multiplicity matching parameter (MMP) $M_n$ is the number of leaves in the subtree rooted at the branching point of the $(n+1)$st insertion.
Mark Daniel Ward, Wojciech Szpankowski
doaj   +1 more source

Some Pairs Problems

, 2016
A common form of MapReduce application involves discovering relationships between certain pairs of inputs. Similarity joins serve as a good example of this type of problem, which we call a "some-pairs" problem. In the framework of Afrati et al.
Ullman, Jeffrey D., Ullman, Jonathan
core   +1 more source

Evolution of group-theoretic cryptology attacks using hyper-heuristics

Journal of Mathematical Cryptology, 2021
In previous work, we developed a single evolutionary algorithm (EA) to solve random instances of the Anshel–Anshel–Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings.
Craven Matthew J., Woodward John R.
doaj   +1 more source

Fault diagnosis of photovoltaic strings by using machine learning‐based stacking classifier

IET Renewable Power Generation
Photovoltaic (PV) modules are prone to short circuits, open circuits, cracks, which can bring serious harmful effects. It is difficult to establish the corresponding PV fault models to diagnose the status of PV strings.
Bo Liu, Kai Sun, Xiaoyu Wang, Jian Zhao, Xiaochao Hou   +4 more
doaj   +1 more source

Development of an open-source software for isomer enumeration

Journal of Cheminformatics, 2023
This article documents enu, a freely-downloadable, open-source and stand-alone program written in C++ for the enumeration of the constitutional isomers and stereoisomers of a molecular formula.
Salomé R. Rieder, Marina P. Oliveira, Sereina Riniker, Philippe H. Hünenberger   +3 more
doaj   +1 more source

A Fuzzy Approach to Erroneous Inputs in Context-Free Language Recognition [PDF]

, 1995
Using fuzzy context-free grammars one can easily describe a finite number of ways to derive incorrect strings together with their degree of correctness. However, in general there is an infinite number of ways to perform a certain task wrongly.
Asveld, P.R.J.
core   +5 more sources

Algorithmics on SLP-compressed strings: A survey

Groups - Complexity - Cryptology, 2012
Results on algorithmic problems on strings that are given in a compressed form via straightline programs are surveyed. A straight-line program is a context-free grammar that generates exactly one string. In this way, exponential compression rates can be achieved.
openaire   +1 more source