A translocation, insertion and deletion distance formula for sorting genomes

Author(s):  
Fanchang Hao ◽  
Junfeng Luan ◽  
Daming Zhu ◽  
Haodi Feng
2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Yu Zhang ◽  
Yin Li ◽  
Yifan Wang

Searchable symmetric encryption that supports dynamic multikeyword ranked search (SSE-DMKRS) has been intensively studied during recent years. Such a scheme allows data users to dynamically update documents and retrieve the most wanted documents efficiently. Previous schemes suffer from high computational costs since the time and space complexities of these schemes are linear with the size of the dictionary generated from the dataset. In this paper, by utilizing a shallow neural network model called “Word2vec” together with a balanced binary tree structure, we propose a highly efficient SSE-DMKRS scheme. The “Word2vec” tool can effectively convert the documents and queries into a group of vectors whose dimensions are much smaller than the size of the dictionary. As a result, we can significantly reduce the related space and time cost. Moreover, with the use of the tree-based index, our scheme can achieve a sublinear search time and support dynamic operations like insertion and deletion. Both theoretical and experimental analyses demonstrate that the efficiency of our scheme surpasses any other schemes of the same kind, so that it has a wide application prospect in the real world.


Author(s):  
M. Khandaqji ◽  
Sh. Al-Sharif

LetXbe a Banach space and letLΦ(I,X)denote the space of OrliczX-valued integrable functions on the unit intervalIequipped with the Luxemburg norm. In this paper, we present a distance formula dist(f1,f2,LΦ(I,G))Φ, whereGis a closed subspace ofX, andf1,f2∈LΦ(I,X). Moreover, some related results concerning best simultaneous approximation inLΦ(I,X)are presented.


2018 ◽  
Vol 27 (09) ◽  
pp. 1842002
Author(s):  
Kai Zhang ◽  
Zhiqing Yang

In this paper, the [Formula: see text]-move is defined. We show that for any knot [Formula: see text], there exists an infinite family of knots [Formula: see text] such that the Gordian distance [Formula: see text] and pass-move-Gordian distance [Formula: see text] for any [Formula: see text]. We also show that there is another infinite family of knots [Formula: see text] (where [Formula: see text]) such that the [Formula: see text]-move-Gordian distance [Formula: see text] and [Formula: see text]-Gordian distance [Formula: see text] for any [Formula: see text] and all [Formula: see text].


2018 ◽  
Vol 216 ◽  
pp. 02027 ◽  
Author(s):  
Khabibulla Turanov ◽  
Andrey Gordienko

The purpose of this paper is to calculate kinematic parameters of a railway car moving with a tailwind for designing a classification hump. The calculation of kinematic parameters is based on the d'Alembert principle, and the physical speed and distance formula for uniformly accelerated or uniformly decelerated motions of a body. By determining a difference between two components - gravitational force of a car and the resistance force of all kinds (frictional resistance, air and wind resistance, resistance from switches and curves, snow and frost resistance), which take place at different sections of a hump profile, the authors calculated the car acceleration at various types of car resistance, as well as time and speed of its movement. Acceleration, time and speed were plotted as a function of the length of a hump profile section. The research results suggest that permissible impact velocities of cars can be achieved by changing profiles of projected hump sections or by using additional hump retarders.


2012 ◽  
Vol 100 ◽  
pp. 48-62
Author(s):  
E.P. de Vink ◽  
H. Zantema ◽  
D. Bošnački

Sign in / Sign up

Export Citation Format

Share Document