We prove that sorting by reciprocal translocations can be done in O(n p log(n)) for an n-gene genome. Our algorithm is an adaptation of the Tannier et. al algorithm for sorting by reversals. This improves over the O(n) algorithm for sorting by reciprocal translocations given by Bergeron et al.

block ciphers have wide applications for hardware and software implementations. in this paper, a new block cipher algorithm with provable security is proposed. the whole structure of the algorithm is novel and has a good encryption and decryption performance. additionally, it has good security with few number of rounds. the structure of the proposed algorithm consists of 4-rounds feistel-like w...

The governing equations for electromagneto-thermomechanical systems are well established and thoroughly derived in the literature, but have been limited to small deformations. This assumption provides an “ease” in the formulation: electromagnetic fields are governed in a Eulerian frame, whereby the thermomechanics is solved in a Lagrangean frame. It is possible to map the Eulerian frame to the ...

We consider reheating for a charged inflaton which is minimally coupled to electromagnetism. The evolution of such an induces time-dependent mass the photon. show how massive photon propagator can be expressed as spatial Fourier mode sum involving three different sorts functions, just like constant case. develop accurate analytic approximations these and use them approximate effective force exe...