We present an algorithm for calculating the quartet distance between two evolutionary trees of bounded degree on a common set of n species. The previous best algorithm has running time O(d2n2) when considering trees, where no node is of more than degree d. The algorithm developed herein has running time O(d9n log n)) which makes it the first algorithm for computing the quartet distance between ...

proper forest management needs quantitative and precise estimates of forest stands characteristics. remotely sensed imageries, due to accurate and broad spatial information, has become a cost-effective tool in forest management. classification of forest attributes and generation of thematic maps are among the common applications of remote sensing. the objective of this study was to optimize the...

The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-insensitive routing, such as wormhole, is used, was not previously understood. In this paper, we show that meshes of trees allow an elegant and optimal one-toall broadcast algorithm supposing that routers implement distanc...

The normalised compression distance measures the mutual compressibility of two signals. We show that this distance can be used for classification on real images. Furthermore, the same compressor can also operate on derived features with no further modification. We consider derived features consisting of trees indicating the containment and relative area of connected sets within the image. It ha...

The movement of frugivores between remnant forests and successional areas is vital for tropical forest tree species to colonize successional habitats. The response of these species to the spatial structure of pasture tree cover is largely unknown. We studied avian frugivores that were found in primary forest edges and large pastures in eastern Amazonia, Brazil. We determined how the small-scale...

three k-tree distance and fixed-sized plot designs were used for estimating tree density in sparse oak forests. these forests cover the main part of the zagros mountain area in western iran. they are non-timber-oriented forest but important for protection purposes. the main objective was to investigate the statistical performance of k-tree distance and fixed-sized plot designs in the estimation...

This article introduces constNJ (constrained neighbor-joining), an algorithm for phylogenetic reconstruction of sets of trees with constrained pairwise rooted subtree-prune-regraft (rSPR) distance. We are motivated by the problem of constructing sets of trees that must fit into a recombination, hybridization, or similar network. Rather than first finding a set of trees that are optimal accordin...