Using basic properties of p-adic numbers, we consider a simple new approach to describe main aspects of DNA sequence and genetic code. Central role in our investigation plays an ultrametric p-adic information space which basic elements are nucleotides, codons and genes. We show that a 5-adic model is appropriate for DNA sequence. This 5-adic model, combined with 2-adic distance, is also suitabl...

Dempster-Shafer theory of evidence (D-S theory) is widely used in uncertain information process. The basic probability assignment(BPA) is a key element in D-S theory. How to measure the distance between two BPAs is an open issue. In this paper, a new method to measure the distance of two BPAs is proposed. The proposed method is a generalized of existing evidence distance. Numerical examples are...

We introduce the notion of uniform number of a graph. The  uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...

By combining weighted distances and distances based on neighbourhood sequences, a new family of distance functions with potentially low rotational dependency is obtained. The basic theory for these distance functions, including functional form of the distance between two points, is presented for the face-centered cubic grid and the body-centered cubic grid. By minimizing an error function, the ...

We propose semantic distance measures based on the criterion of approximate discernibility and on evidence combination. In the presence of incomplete knowledge, the distance measures the degree of belief in the discernibility of two individuals by combining estimates of basic probability masses related to a set of discriminating features. We also suggest ways to extend this distance for compari...

A basic problem in classifying, or searching for similar objects in, a large set of geometric objects is computing similarity between two objects. This has led to extensive work on computing geometric similarity between two objects. This talk discusses some old and some new geometric-similarity algorithms, with an emphasis on transportation distance (also called earth mover’s distance) and Frec...

Translocation is one of the basic operations for genome rearrangement. Translocation distance is the minimum number of translocations required to transform one genome into the other. In this paper, we show that computing the translocation distance for unsigned genomes is NP-hard. Moreover, we show that approximating the translocation distance for unsigned genomes within ratio 1.00017 is NP-hard...

The distance transform has been proposed for use in computer vision for a number of applications such as matching and skeletonisation. This paper proposes two things: (1) a multi-scale distance transform to overcome the need to choose edge thresholds and scale and (2) the addition of various saliency factors such as edge strength, length and curvature to the basic distance transform to improve ...

Recent numerical simulations have suggested the possibility of forming double intermediate mass black holes (IMBHs) via the collisional runaway scenario in young dense star clusters. The two IMBHs formed would exchange into a common binary shortly after their birth, and quickly inspiral and merge. Since space-borne gravitational wave (GW) observatories such as LISA will be able to see the late ...

The reaction of [(AuBr)2(μ-PR2P(CH2)nPR2)] (where R ) CH3 for n ) 1; R ) Ph for n ) 1, 3, 4) with N-alkylxanthine and thioxanthine derivatives, containing two ionizable protons in close positions, yields, under basic conditions, neutral heterobridged dinuclear gold(I) ring complexes [Au(μ-L)2(μ-PR2P(CH2)nPR2)], which have been investigated by means of 1Hand 31P-NMR and FAB spectroscopies. Cryst...