Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Other Mathematics
Graph-Theoretic Partitioning Of Rnas And Classification Of Pseudoknots-Ii, Louis Petingi
Graph-Theoretic Partitioning Of Rnas And Classification Of Pseudoknots-Ii, Louis Petingi
Publications and Research
Dual graphs have been applied to model RNA secondary structures with pseudoknots, or intertwined base pairs. In previous works, a linear-time algorithm was introduced to partition dual graphs into maximally connected components called blocks and determine whether each block contains a pseudoknot or not. As pseudoknots can not be contained into two different blocks, this characterization allow us to efficiently isolate smaller RNA fragments and classify them as pseudoknotted or pseudoknot-free regions, while keeping these sub-structures intact. Moreover we have extended the partitioning algorithm by classifying a pseudoknot as either recursive or non-recursive in order to continue with our research …
A Novel Approach For Library Materials Acquisition Using Discrete Particle Swarm Optimization, Daniel A. Sabol
A Novel Approach For Library Materials Acquisition Using Discrete Particle Swarm Optimization, Daniel A. Sabol
Publications and Research
The academic library materials acquisition problem is a challenge for librarian, since library cannot get enough funding from universities and the price of materials inflates greatly. In this paper, we analyze an integer mathematical model by considering the selection of acquired materials to maximize the average preference value as well as the budget execution rate under practical restrictions. The objective is to improve the Discrete Particle Swarm Optimization (DPSO) algorithm by adding a Simulate Annealing algorithm to reduce premature convergence. Furthermore, the algorithm is implemented in multiple threaded environment. The experimental results show the efficiency of this approach.