相关论文: Bounding right-arm rotation distances
Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality, and restriction of the distance to finite chains may or may not coincide with the…
The calculation of Euclidean distance between points is generalized to one-dimensional objects such as strings or polymers. Necessary and sufficient conditions for the minimal transformation between two polymer configurations are derived.…
A realistic human kinematic model that satisfies anatomical constraints is essential for human-robot interaction, biomechanics and robot-assisted rehabilitation. Modeling realistic joint constraints, however, is challenging as human arm…
We define, analyze, and give efficient algorithms for two kinds of distance measures for rooted and unrooted phylogenies. For rooted trees, our measures are based on the topologies the input trees induce on triplets; that is, on…
We study properties of an array of numbers, called "the triangle," in which each row is formed by rotating all the numbers in the previous row to the left by $m$ positions in cyclical fashion, then appending a number to the end of the row.…
In this paper, we address the question of comparison between populations of trees. We study an statistical test based on the distance between empirical mean trees, as an analog of the two sample z statistic for comparing two means. Despite…
We consider three different schemes for signal routing on a tree. The vertices of the tree represent transceivers that can transmit and receive signals, and are equipped with i.i.d. weights representing the strength of the transceivers. The…
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the tree edit operations of deletion, insertion, and relabeling…
We describe a kernel of size 9k-8 for the NP-hard problem of computing the Tree Bisection and Reconnect (TBR) distance k between two unrooted binary phylogenetic trees. We achieve this by extending the existing portfolio of reduction rules…
Using the Lagrange inversion formula, $t$-ary trees are enumerated with respect to edge type (left, middle, right for ternary trees).
A finite \emph{one-sided tree} of height $h$ is defined as a rooted planar tree obtained by grafting branches on one side, say the right, of a spine, i.e. a linear path of length $h$ starting at the root, such that the resulting tree has no…
Distance-based approaches in phylogenetics such as Neighbor-Joining are a fast and popular approach for building trees. These methods take pairs of sequences from them construct a value that, in expectation, is additive under a stochastic…
It is shown that certain diffeomorphism or homeomorphism groups with no restriction on support of an open manifold with finite number of ends are bounded. It follows that these groups are uniformly perfect. In order to characterize the…
We introduce tree dimension and its leveled variant in order to measure the complexity of leaf sets in binary trees. We then provide a tight upper bound on the size of such sets using leveled tree dimension. This, in turn, implies both the…
A binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given.…
A gaze-fixating robot perceives distance to the fixated object and relative positions of surrounding objects immediately, accurately, and robustly. We show how fixation, which is the act of looking at one object while moving, exploits…
The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…
The classic Maxwell formula calculates the length of a planar locally minimal binary tree in terms of coordinates of its boundary vertices and directions of incoming edges. However, if an extreme tree with a given topology and a boundary…
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.