We have built a tool for fast construction of very large phylogenetic trees. The tool uses heuristics for speeding up the neighbour-joining algorithm-while still constructing the same tree as the original neighbour-joining algorithm-making it possible to construct trees for 8000 species in <10 min on a single desktop PC. In comparison, the same task takes more than 30 min using the QuickTree ne...

Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...

in a graph g = (v,e), a subset s  v is said to be an open packing set if no two vertices of s have a common neighbour in g. the maximum cardinality of an open packing set is called the open packing number and is denoted by rho^o. this paper further studies on this parameter by obtaining some new bounds.

In a recent article, Thompson 1] described the use of neighbour lists in simulations, giving a detailed account of the implementation and the resulting economies. This note deals with a simple variant on the method, and discusses the choice of neighbour list technique, if any, to be used in various circumstances. The idea was originally introduced in the classic paper of Verlet 2] on the simula...

Over the past decades much progress has been made in understanding the evolutionary factors that can promote social behaviour. Nevertheless, the bewildering range of methods that have been employed leave many confused. Here we review some of the major approaches that can be used to model social evolution, including the neighbour-modulated fitness, inclusive fitness and multilevel selection meth...

This paper proposes a nearest neighbor classifier design method based on vector quantization (VQ). By investigating the error distribution pattern of the training set, the VQ technique is applied to generate prototypes incrementally until the desired classification result is reached. Experimental results demonstrate the effectiveness of the method. 2004 Elsevier B.V. All rights reserved.

Data of the 1997-1998 epidemic of classical swine fever (CSF) in The Netherlands were analysed in survival analysis to identify risk factors that were associated with the rate of neighbourhood infections. The study population consisted of herds within 1000 m of exclusively one previously infected herd. Dates of virus introduction into herds were drawn randomly from estimated probability distrib...

Let γ : E(G) −→ N∗ be an edge colouring of a graph G and σγ : V (G) −→ N∗ the vertex colouring given by σγ(v) = ∑ e3v γ(e) for every v ∈ V (G). A neighbour-sumdistinguishing edge-colouring of G is an edge colouring γ such that for every edge uv in G, σγ(u) 6= σγ(v). The study of neighbour-sum-distinguishing edge-colouring of graphs was initiated by Karoński, Łuczak and Thomason [8]. They conjec...

The neighbour-joining method reconstructs phylogenies by iteratively joining pairs of nodes until a single node remains. The criterion for which pair of nodes to merge is based on both the distance between the pair and the average distance to the rest of the nodes. In this paper, we present a new search strategy for the optimisation criteria used for selecting the next pair to merge and we show...