We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...

There is great allure in the concept of using qualified health care providers to assist radiologists and radiation oncologists, increasing efficiency and possibly even improving patient care delivery. However, physician services are most commonly reimbursed under a system that is resource based, and the physician work and practice expense components of reimbursement for existing procedure codes...

The problem of finding a longest increasing subsequence (LIS) is a well known task in sequence processing. There are many variants of the basic task. We discuss a recently introduced variant of LIS, a minimal height longest increasing subsequence problem and propose a new algorithm for it, which improves its time complexity. Moreover, we define a family of similar problems and introduce algorit...

Let Ln be the length of the longest increasing subsequence of a random permutation of the numbers 1, . . . , n, for the uniform distribution on the set of permutations. We discuss the “hydrodynamical approach” to the analysis of the limit behavior, which probably started with Hammersley (1972), and was subsequently further developed by several authors. We also give two proofs of an exact (non-a...

Two-dimensional Lorentzian geometry has recently found application in some models of nonrelativistic systems, most profitably for the process of boarding an aeroplane. The duration of the boarding process is assumed to be a result of passengers standing in the isle and blocking each others’ way. According to this model, the expected boarding time is equal to the length of the longest timelike g...

New algorithm for finding longest increasing subsequence is discussed. This algorithm is based on the ideas of idempotent mathematic and uses Max-Plus idempotent semiring. Problem of finding longest increasing subsequence is reformulated in a matrix form and solved with linear algebra.

this paper addresses a reliable facility location problem with considering facility capacity constraints. in reliable facility location problem some facilities may become unavailable from time to time. if a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. hence, the fail of facilities leads to disruptions in facility location dec...

Background Kenya introduced a free maternity policy in 2013 to address the cost barrier associated with accessing maternal health services. We carried out a mixed methods process evaluation of the policy to examine the extent to which the policy had been implemented according to design, and positive experiences and challenges encountered during implementation.   Methods We conducted a mixed met...