Genetic data are increasingly used in landscape ecology for the indirect assessment of functional connectivity, that is, the permeability of landscape to movements of organisms. Among available tools, matrix correlation analyses (e.g. Mantel tests or mixed models) are commonly used to test for the relationship between pairwise genetic distances and movement costs incurred by dispersing individuals. When organisms are spatially clustered, a population-based sampling scheme (PSS) is usually performed, so that a large number of genotypes can be used to compute pairwise genetic distances on the basis of allelic frequencies. Because of financial constraints, this kind of sampling scheme implies a drastic reduction in the number of sampled aggregates, thereby reducing sampling coverage at the landscape level. We used matrix correlation analyses on simulated and empirical genetic data sets to investigate the efficiency of an individual-based sampling scheme (ISS) in detecting isolation-by-distance and isolation-by-barrier patterns. Provided that pseudo-replication issues are taken into account (e.g. through restricted permutations in Mantel tests), we showed that the use of interindividual measures of genotypic dissimilarity may efficiently replace interpopulation measures of genetic differentiation: the sampling of only three or four individuals per aggregate may be sufficient to efficiently detect specific genetic patterns in most situations. The ISS proved to be a promising methodological alternative to the more conventional PSS, offering much flexibility in the spatial design of sampling schemes and ensuring an optimal representativeness of landscape heterogeneity in data, with few aggregates left unsampled. Each strategy offering specific advantages, a combined use of both sampling schemes is discussed.

This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of pairwise adjacent vertices in a graph. We propose and compare two different instantiations of a generic ACO algorithm for this problem. Basically, the generic ACO algorithm successively generates maximal cliques through the repeated addition of vertices into partial cliques, and uses "pheromone trails" as a greedy heuristic to choose, at each step, the next vertex to enter the clique. The two instantiations differ in the way pheromone trails are laid and exploited, i.e., on edges or on vertices of the graph.We illustrate the behavior of the two ACO instantiations on a representative benchmark instance and we study the impact of pheromone on the solution process. We consider two measures -the re-sampling and the dispersion ratio-for providing an insight into the performance at run time. We also study the benefit of integrating a local search procedure within the proposed ACO algorithm, and we show that this improves the solution process. Finally, we compare ACO performance with that of three other representative heuristic approaches, showing that the former obtains competitive results.