• No results found

The distance matrix and duplicated genotypes

Distance to the nearest stable Metzler matrix

Distance to the nearest stable Metzler matrix

... a matrix which is not Metzler, it may be worth the effort to determine whether it is ‘close’ to being Metzler in some ...sense. Distance problems arise fre- quently in the control ...the distance to ...

6

Spatial structure of two-locus genotypes under isolation by distance.

Spatial structure of two-locus genotypes under isolation by distance.

... As dispersal is increased from low to moderate, the correlations for short distances generally increase, as do the X-intercepts (SOKAL et al. structural features and hig[r] ...

11

Some bounds on the distance sum connectivity matrix

Some bounds on the distance sum connectivity matrix

... Keywords: Distance-sum-connectivity matrix; Bounds 1 Introduction Let G be a simple, finite, connected graphs with the vertex set V(G) and the edge set ...

11

Non-Negative Matrix Factorization with Sinkhorn Distance

Non-Negative Matrix Factorization with Sinkhorn Distance

... Non-negative Matrix Factorization (NMF) has re- ceived considerable attentions in various areas for its psychological and physiological interpretation of naturally occurring data whose representation may be ...

7

Max–min distance nonnegative matrix factorization

Max–min distance nonnegative matrix factorization

... data matrix, it is usually assumed that the class labels of the data samples are not available, making it an unsupervised prob- lem ( Mohammadiha, Smaragdis, & Leijon, 2013 ; Tsarev, Petrovskiy, & ...

10

On the distance matrix of an infinite class of fullerene graphs

On the distance matrix of an infinite class of fullerene graphs

... the distance d ( x, y ) between x and y is defined as the length of the minimum path connecting ...The matrix [ d ij ] consisting of all distances between vertices of a graph G is known ...

12

On the Spectra of Reduced Distance Matrix of Thorn Graphs

On the Spectra of Reduced Distance Matrix of Thorn Graphs

... This matrix has been much studied by mathematical chemists, for details see [2, ...reduced distance matrix [4] or terminal distance matrix [5, 6] of trees was ...reduced distance ...

7

Distance matrix and Laplacian of a tree with attached graphs

Distance matrix and Laplacian of a tree with attached graphs

... The distance between two vertices in a graph is traditionally defined as the length of a shortest path between the two ...resistance distance, introduced by Klein and Randi´c [ 17 ] arises naturally from ...

14

Implementation of IRIS Image Segmentation using Distance Matrix

Implementation of IRIS Image Segmentation using Distance Matrix

... Abstract: The human reorganization process plays a major part in giving a safer way of information sharing. The security plays a vital role in accessing applications with lot of confidentiality. The image processing can ...

6

Eigenvalues of the resistance distance matrix of complete multipartite graphs

Eigenvalues of the resistance distance matrix of complete multipartite graphs

... resistance distance between i,j ∈ V , denoted by r ij , is defined as the net effective resistance between nodes i and j in the corresponding electrical network constructed from G by replacing each edge of G with a ...

11

On the spectra of reduced distance matrix of the generalized Bethe trees

On the spectra of reduced distance matrix of the generalized Bethe trees

... The distance between the vertices and of , is equal to the length (= number of edges) of each shortest path starting at and ending at (or vice versa) [2], and will be denoted by ( , ...The distance ...

8

A new distance for intuitionistic fuzzy sets based on similarity matrix

A new distance for intuitionistic fuzzy sets based on similarity matrix

... existing distance can be divided into two dimensional distance and three dimen- sional ...hamming distance or Euclidean distance to measure similarity, however, the difference caused by dif- ...

11

Structure method for solving the nearest Euclidean distance matrix problem

Structure method for solving the nearest Euclidean distance matrix problem

... semidefinite matrix constraints ...solution matrix is known, it is shown in Sec- tion  how to formulate the problem as a smooth unconstrained minimization problem, for which rapid convergence can be ...

7

Gait Evaluation Using Procrustes and Euclidean Distance Matrix Analysis

Gait Evaluation Using Procrustes and Euclidean Distance Matrix Analysis

... Normal gait is not determined by time and distance travelled. It is determined by the degree of variation in the gait features. While the time and distance can be assessed relatively easily using visual ...

9

The duplicated genes database: identification and functional annotation of co-localised duplicated genes across genomes

The duplicated genes database: identification and functional annotation of co-localised duplicated genes across genomes

... and the maximum distance defining duplicated genes as co- localised. The literature features various different approaches developed for detecting duplicated genes. Most of these approaches revolve ...

10

Genetic diversity and distance among Iranian and European alfalfa (Medicago sativa L ) genotypes

Genetic diversity and distance among Iranian and European alfalfa (Medicago sativa L ) genotypes

... genetic distance and divergence among genotypes and to classify them based on morphological and physiological ...of genotypes due mainly to differential responses of the genotypes to rainfed ...

16

Genetic distance and Diversity among some Cowpea (Vigna unguiculata L. Walp) genotypes

Genetic distance and Diversity among some Cowpea (Vigna unguiculata L. Walp) genotypes

... Euclidean distance between the genotypes was ...of genotypes distinctly evolved by the principal component ...had genotypes with high pod productivity but late flowering and ...The ...

6

Dense Matrix Computations on NUMA Architectures with Distance-Aware Work Stealing

Dense Matrix Computations on NUMA Architectures with Distance-Aware Work Stealing

... If in the previous example there was a node 5 with distance 22, it could still have a latency higher enough than node 3 that would hamper performance and eliminate any benefit of work stealing. We observed when ...

24

Hamming distance between the strings generated by adjacency matrix of a graph and their sum

Hamming distance between the strings generated by adjacency matrix of a graph and their sum

... Hamming graphs are known as an interesting graph family in connec- tion with the error-correcting codes and association schemes. For more details see [1, 2, 4 - 7, 9 - 11, 13, 14]. Motivated by the work on Hamming ...

12

CiteSeerX — The structured distance to normality of an irreducible real tridiagonal matrix, Electron

CiteSeerX — The structured distance to normality of an irreducible real tridiagonal matrix, Electron

... the distance in the Frobenius norm of a tridiagonal matrix to the set of symmetric tridiagonal matrices or the set of shifted skew-symmetric tridiagonal matrices is provided in Section ...the ...

14

Show all 10000 documents...

Related subjects