PMCCPMCCPMCC

Search tips
Search criteria 

Advanced

 
Logo of amolbioBioMed CentralBiomed Central Web Sitesearchsubmit a manuscriptregisterthis articleAlgorithms for Molecular Biology : AMB
 
Algorithms Mol Biol. 2010; 5: 19.
Published online 2010 March 20. doi:  10.1186/1748-7188-5-19
PMCID: PMC2853546

Distinguishing between hot-spots and melting-pots of genetic diversity using haplotype connectivity

Abstract

We introduce a method to help identify how the genetic diversity of a species within a geographic region might have arisen. This problem appears, for example, in the context of identifying refugia in phylogeography, and in the conservation of biodiversity where it is a factor in nature reserve selection. Complementing current methods for measuring genetic diversity, we analyze pairwise distances between the haplotypes of a species found in a geographic region and derive a quantity, called haplotype connectivity, that aims to capture how divergent the haplotypes are relative to one another. We propose using haplotype connectivity to indicate whether, for geographic regions that harbor a highly diverse collection of haplotypes, diversity evolved inside a region over a long period of time (a "hot-spot") or is the result of a more recent mixture (a "melting-pot"). We describe how the haplotype connectivity for a collection of haplotypes can be computed efficiently and briefly discuss some related optimization problems that arise in this context. We illustrate the applicability of our method using two previously published data sets of a species of beetle from the genus Brachyderes and a species of tree from the genus Pinus.

Background

It is now increasingly recognized that past climatic events have played a significant role in shaping the distribution of genetic diversity within species across the landscape. The distribution of this genetic diversity can leave signatures indicating the locations of refugia or "hot-spots", i.e. regions in which species have persisted for long periods of time. These regions are important as they have contributed to much of the observed structuring of genetic variation across the landscape [1].

It has been observed (e.g. [2,3]) that hot-spots may be distinguished by high levels of genetic diversity relative to the geographic domain that has been colonized from these regions. In particular, this provides a simple and intuitive diagnostic for identifying probable species refugia. However, the merging together of gene pools previously isolated in different refugia can also result in regions of high genetic diversity, so-called "melting-pots" [4]. Distinguishing between hot-spots and melting-pots is therefore an important problem in the area of phylogeography, where one of the main objectives is to identify the processes that are responsible for the contemporary geographic distributions of species. It is also a key issue in selecting nature reserves, where the aim is to choose regions in order to best conserve biodiversity (see e.g. [5]). Here we describe a new approach to help distinguish between hot-spots and melting-pots for a species that is based on the mutational properties of DNA sequences. Such sequences provide a robust framework for the assessment of historical relationships among genetic variants within a population. As a simple illustration of our approach, suppose that we sample a set X of DNA haplotypes from a species inhabiting a certain region. Consider the two hypothetical phylogenies for X in Figure Figure1,1, in which the vertices corresponding to the sampled haplotypes are given by black dots. Although the genetic diversity of X is the same according to the total length of both phylogenies, we see that in phylogeny (a) the haplotypes are dispersed across the phylogeny (a hot-spot scenario), whereas in phylogeny (b) the haplotypes form two groups (a melting-pot scenario) (cf. also category I vs category II patterns in [6]).

Figure 1
Haplotype phylogenies. Haplotype phylogenies for a collection X of haplotypes. (a) A hot-spot scenario, with X = {a1, ..., a13}. (b) A melting-pot scenario with X = {b1, ..., b13}. All edges have length 1.

To differentiate between such behaviors, we introduce the concept of haplotype connectivity of a set X of haplotypes relative to a distance matrix D on X. This measure tries to quantify how well separated the haplotypes are relative to D. For distances D arising from path lengths in phylogenies where all edges have length 1 (i.e. the distance D(x, y) between two haplotypes x, y [set membership] X is simply the number of edges on the path from x to y) such as those presented in Figure Figure1,1, one can interpret the measure as follows. The haplotype connectivity of X relative to D is the smallest non-negative integer c so that, for any x, y [set membership] X that label vertices u, v in the tree, there is a sequence u = w1, w2, ..., wl = v of vertices in the tree such that (i) any two consecutive vertices in the sequence are adjacent and (ii) at least one of the vertices in every c consecutive vertices in the sequence is labeled by some element in X. For example, it can be checked that the phylogeny in (a) has haplotype connectivity 2, whereas the haplotype connectivity of the phylogeny in (b) is 5. In particular, the lower haplotype connectivity score corresponds to the hot-spot scenario.

To efficiently compute the haplotype connectivity of a collection of haplotypes X relative to a distance matrix D, we show how to make use of an algorithm for a related problem presented in [7]. In addition, for fixed k, we develop some algorithms for finding the minimum/maximum haplotype connectivity of any subset of X of size k. As we shall see, this allows us to more easily compare the haplotype connectivity of different size sets as it takes the sample-size bias into account.

Our new method complements the approach presented in [8] for detecting zones of secondary contact (i.e. melting-pots) based on nested clade analysis [9,10] (it should, however, be noted that there is some debate in the literature concerning the validity of nested clade analysis [11]). It is also related to the method for inferring population genetic processes based on the frequency distribution of pairwise distances between haplotypes presented in [12] (see also [13,14]). To the best of our knowledge, these are currently the main computational approaches used to distinguish hot-spots and melting-pots based on molecular sequence data.

The rest of the paper is organized as follows. In the next section we formally define haplotype connectivity, show how this quantity can be computed efficiently and discuss some optimization problems that naturally arise in the context of this paper. We then illustrate the applicability of our method using two published data sets encompassing different spatial scales, before concluding with a short discussion of possible future directions.

Methods

We now describe our new methods. We assume that we are given a set X of haplotypes, together with a dissimilarity measure D on X that quantifies the genetic distance D(x, y) between every pair x, y in X. There are several dissimilarity measures for DNA haplotypes, such as the Hamming distance or the phyletic distance, that is, the distance relative to a phylogeny on X (see e.g. [12,15-17]).

Haplotype connectivity

Given a subset Y of X (corresponding, for example, to the haplotypes that are found in some given region), we aim to quantify how difficult it is relative to D to link any pair x, y [set membership] Y by a sequence of intermediate haplotypes also belonging to Y.

To do this, we shall use the concept of a threshold graph (see e.g. [18,19]). For a non-negative number or threshold t, we define the graph Gt(Y) with vertex set Y and edge set consisting of those pairs of distinct haplotypes x, y [set membership] Y with D(x, y) ≤ t. In addition we assign to every edge e = {x, y} the weight ω (e) := D(x, y). The haplotype connectivity of Y (relative to D) is then defined to be the smallest number t such that the graph Gt(Y) is connected (as usual, the graph Gt(Y) is connected if there is some path in Gt(Y) between any pair of elements in Y). We denote this number by HC(Y, D) or just HC(Y) in case it is clear what D is from the context.

To illustrate these definitions, consider the subset Y = {b2, b4, ..., b12} of X = {b1, b2, ..., b13} and the phyletic distance D on X induced by the phylogeny in Figure 1(b), i.e. the distance obtained by taking the path length between pairs of haplotypes. In Figure 2(a) we depict the graph G2(Y). This is not connected, and so HC(Y) > 2. However, it is straight-forward to check that HC(Y) = 5 (the graph G5(Y) is depicted in Figure 2(b)).

Figure 2
Threshold graphs. The graphs (a) G2(X) and (b) G5(X) induced by the haplotype phylogeny in Figure 1(b) on the subset Y = {b2, b4, ..., b12}. For example, there is no edge joining the haplotypes b2 and b10 in G2(X) because the number of edges on the path ...

Now, if t ≥ max{D(x, y): x, y [set membership] Y } then the graph Gt(Y) is the complete graph on Y, i.e. the graph in which every pair of vertices is linked by an edge, which we denote by G*(Y). For every spanning tree T of G*(Y), that is, a subgraph of G*(Y) that is a tree and that contains all vertices of G*(Y), let ωmax(T) be the maximum of the edge weights over all edges of T. We claim that

equation image

Indeed, since every spanning tree T of G*(Y) is a connected subgraph of G*(Y), we must have HC(Y) ≤ ωmax(T). Conversely, putting t := HC(Y), by definition of HC(Y) the graph Gt(Y) is connected and every spanning tree T of Gt(Y) is also a spanning tree of G*(Y) with ωmax(T) ≤ t = HC(Y). In particular, this implies that there always exist x, y [set membership] Y with HC(Y) = D(x, y). A spanning tree T of G*(Y) with score ωmax(T) equal to HC(Y) is also known as a bottleneck minimum spanning tree or bottleneck MST, for short. In [7] an algorithm for computing such a tree is presented. This algorithm performs a binary search [[20], p. 37] on the edge weights in the graph. However, rather than explicitly sorting these weights first, an algorithm for finding the median [21] is used. In this way, since in each step of the binary search at least half of the remaining edges in the graph can be discarded, the overall run time is O(m) for a connected edge-weighted graph with m edges. Thus, as G*(Y) has O(|Y|2) edges, HC(Y) can be computed in O(|Y|2) time, which is clearly optimal. Alternatively, since every minimum spanning tree (MST), that is, a spanning tree of G*(Y) with minimum total edge weight, can easily be seen to be a bottleneck minimum spanning tree of G*(Y), one can also employ any algorithm for finding an MST of G*(Y) (see e.g. [[20], ch. 23]) to compute HC(Y).

Maximizing and minimizing haplotype connectivity

In our analyses it can be helpful to understand how large HC(Y) is relative to other subsets of the same size as Y. Therefore, for a subset Y [subset, dbl equals] X of k haplotypes, we now consider the problem of computing the minimum and maximum possible haplotype connectivity, denoted by HCmin(k) and HCmax(k), respectively, over all subsets of X containing precisely k haplotypes. Based on this, we define, for any subset Y [subset, dbl equals] X, the normalized haplotype connectivity of Y by

equation image

Note that this normalized score always lies between 0 and 1. We will use this score to rank regions according to their haplotype connectivity.

Computing HCmin(k) amounts to finding a k-element subset Z of X such that the score ωmax(T) of a bottleneck MST T of G*(Z) is minimized. This problem is known as the bottleneck k-MST problem and can be solved in optimal O(|X|2) time by extending the algorithm for computing a bottleneck MST mentioned in the previous section [22]. The key idea is to introduce, in addition to the given weights on the edges, a suitable weighting of the vertices of the graph.

To compute HCmax(k), we first note that this quantity equals the smallest threshold t such that for every subset Z of X with k elements the graph Gt(Z) is connected. In other words, every vertex separator of Gt(X) (i.e. every subset S of X with Gt(X - S) disconnected) must have more than |X| - k elements.

Several algorithms for computing a vertex separator of minimum size are known, e.g. based on a reformulation as a network flow problem [23]. The currently fastest algorithm for this problem employs so-called expander graphs and runs in O(sn2 + An external file that holds a picture, illustration, etc.
Object name is 1748-7188-5-19-i3.gif) time for a graph with n vertices and m edges, where s is the minimum size of a vertex separator [24]. Hence, by performing a binary search over the increasingly sorted list of values D(x, y), x, y [set membership] X, HCmax(k) can be computed in O(An external file that holds a picture, illustration, etc.
Object name is 1748-7188-5-19-i4.gif log n) time.

Measuring and optimizing genetic diversity

As mentioned in the introduction, we are particularly interested in regions with a high level of genetic diversity. Therefore, as part of our analyses, it is necessary to measure the genetic diversity of any subset Y [subset, dbl equals] X of DNA haplotypes. There are several measures commonly used for this - for example, the number and frequency of haplotypes (see e.g. [15]) or the number of segregating sites found in the haplotypes (see e.g. [25]). However, in our studies we found that it made little difference to our results which method was used (data not shown).

As with the haplotype connectivity measure, for the purposes of comparing the diversity of samples having different sizes, it can be useful to compute how large the genetic diversity of a subset Y is relative to other subsets of the same size. Whether or not this can be done efficiently obviously depends on how the measure of genetic diversity is defined. For the purposes of illustration we now describe how this may be done for two common measures of genetic diversity, which we shall also use in our examples below.

In case a phylogeny is available, we can make all of our computations (including those for haplotype connectivity) relative to the genetic distance D given by taking the phyletic distance. In this situation, the genetic diversity of Y relative to D is commonly defined as the total length of the restriction of the phylogeny to Y (i.e. the length of the shortest subtree spanned by the elements in Y) which we denote by PD(Y). This measure has been used in the analysis of intraspecific patterns (see e.g. [26,27]) and also in interspecific studies (see e.g. [28]), in which it is commonly known as the phylogenetic diversity (PD) measure.

We denote the minimum and maximum of PD(Y) over all subsets Y [subset, dbl equals] X of size k = |Y| by PDmin(k) and PDmax(k), respectively. Interestingly, both of these quantities can be computed efficiently: For PDmax(k) there is a simple greedy algorithm [29,30] that can be implemented to run in O(|X|) time [31]. For PDmin(k) a polynomial time algorithm based on dynamic programming is described in [32] in the context of the so-called i-tree problem. Implementations of efficient algorithms for computing these quantities are available online [33]. Therefore, one can also compute in polynomial time the normalized score PD*(Y), which is defined, for any subset Y [subset, dbl equals] X, analogously to HC*(Y) above, by

equation image

In case solely a distance matrix D is available, a common measure of the genetic diversity of a set Y relative to D is (up to a constant scaling-factor) the average squared pairwise distance between elements in Y [34], i.e. An external file that holds a picture, illustration, etc.
Object name is 1748-7188-5-19-i6.gif, where An external file that holds a picture, illustration, etc.
Object name is 1748-7188-5-19-i7.gif denotes the set of all 2-element subsets of Y. The normalized score AD*(Y) is defined in a completely analogous way to the scores HC*(Y) and PD*(Y) above. However, in contrast to PD(Y), given D and k, it is NP-hard to compute either the minimum or maximum diversity score, denoted by ADmin(k) and ADmax(k), respectively, over all subsets of X with k elements. Indeed, the maximization problem, which is also known as the MAXISUM facility dispersion problem, is shown to be NP-hard in [35], and the minimization problem can be shown to be NP-hard using similar arguments. However, we note that there are algorithms that can solve instances of the maximization problem for |X| ≤ 60 usually within seconds on a modern desktop PC (see e.g. [36]).

Results and discussion

To illustrate the applicability of our approach we apply it to two previously published data sets that were analyzed in [37] and [17], respectively.

Beetle Data

The first data set was used as part of a phylogeographic study of the beetle species Brachyderes rugatus rugatus on La Palma (Canary Islands) [37]. In this study 138 individual beetles were sampled. The 18 sampling locations are shown in Figure Figure3.3. Using sequence data from the mitochondrial COII gene (for details see [37]), the 138 samples were subsequently grouped into 69 haplotypes, and a haplotype phylogeny based on the parsimony criterion was constructed using the TCS program [38]. This phylogeny is presented in Figure Figure44.

Figure 3
Sampling locations and regions for beetle data. A map of La Palma with sampling locations indicated by black dots [37]. Sampling locations where haplotypes from a particular phylogroup (cf. Figure 4) were found are depicted by the dashed curves. Note ...
Figure 4
Haplotype phylogeny for beetle data. The haplotype network presented in [37] for the haplotypes collected in La Palma. Note that all edges have length 1. The colored dots (black, red and green) represent the sampled haplotypes and the white dots hypothetical ...

According to this phylogeny, the haplotypes were divided into 3 phylogroups, as indicated on the phylogeny and in Figure Figure3.3. Based on these groupings it was concluded for Brachyderes rugatus rugatus that (i) there is a region of secondary contact, or melting-pot, in the South of the island at the overlap of regions 1 and 2, and (ii) that there is an ancestral region or hot-spot in the region containing the three sampling locations in the top right of region 2. Note that in [37] support for conclusion (i) was provided by performing the test given in [8] for detecting zones of secondary contact, which essentially involves calculation of the average distance between the geographic centers of clades at increasing nesting levels in a phylogeny on the haplotypes of interest.

To investigate whether our new method was supportive of conclusions (i) and (ii) or not, we first grouped the sampling locations into 6 regions R1, ..., R6 as shown in Figure Figure3.3. We used these regions rather than the individual sampling locations, since the number of samples taken at each location was very small (between 2 and 8). When forming the groups, geographically close locations were grouped together. We also considered other groupings based on geographic proximity (data not shown) and the outcome was similar, though less pronounced when the number of groupings was reduced (smallest number of groupings used was 3). We then measured the diversity (using the measure PD) and haplotype connectivity for the haplotypes found in each region Ri relative to the phyletic distances given by the phylogeny in Figure Figure4,4, as described in the Methods section.

The results for the 6 regions are summarized in Table Table1.1. In this table, we present the size of the subset Y of haplotypes found in the region (column 2), the values PD(Y), PDmin(|Y|), PDmax(|Y|) (columns 3-5), and the normalized diversity score PD*(Y) (column 6) as defined in the Methods section. Similarly, we present the values HC(Y), HCmin(|Y|), HCmax(|Y|) and HC*(Y) (columns 7-10).

Table 1
Scores for beetle data.

As can be seen in Table Table1,1, the two regions with the highest PD*score are R6 and R3, which also have a much higher HC* score than any of the other four regions. This is supportive of conclusion (i), i.e. that R6 is probably a melting-pot. Indeed, in Figure Figure44 the haplotypes found in region R6 are highlighted in green, and it can be seen that they clump together into two groups. This also indicates why we obtained a high HC* score for this region. Similarly, the high PD* and HC* scores for region R3 suggests that this region is a melting-pot as well, a conclusion that is consistent with the findings in [37] where it is suggested that in R3 range expansions toward the South and the Northwest partially overlapped.

Concerning conclusion (ii), we see that amongst the remaining regions R2 clearly has the highest PD* score and a much lower HC* score than R6 and R3. This pattern of scores, i.e. relatively high diversity and low haplotype connectivity, is more supportive of a hot-spot scenario rather than a melting-pot scenario, in agreement with conclusion (ii). Examining Figure Figure4,4, we see that the haplotypes in R2 (highlighted in red) are relatively spread out over the haplotype phylogeny, hence the low haplotype connectivity score.

Pine Data

The second data set that we consider formed part of a study of the phylogeographic history of the species Pinus pinaster around the Mediterranean [17]. Samples were taken from 10 locations as indicated in Figure Figure5.5. Sequence data consisting of nine chloroplast simple sequence repeat markers gave rise to 34 different haplotypes (for details see [17]). For these 34 haplotypes a distance matrix was computed using the pairwise haplotypic difference (that is, for any two haplotypes, the sum of the difference between the allele size over the nine loci).

Figure 5
Sampling locations for pine data. Sampling locations for the data set in [17].

To understand the phylogeographic structure of this data, in [17] the frequency distribution of the pairwise distances between haplotypes, sometimes also called the genetic diversity spectrum (GDS) [12], was computed. We have recomputed this and depict the result in Figure Figure6.6. In particular, based on considerations - such as the shape of the GDS for the Landes and Pantelleria locations - it was hypothesized that Landes and Pantelleria are hot-spots, although it was also stated that the hypothesis that they are melting-pots could not be excluded [[17], p.462]. Indeed, in a more recent extended phylogeographic study of Pinus pinaster [39] it was concluded that Landes was more likely to be a melting-pot.

Figure 6
Genetic diversity spectrum. The genetic diversity spectrum (GDS) for (a) the Landes location and (b) the Pantelleria location in Figure 5. For every possible distance, the number of pairs of haplotypes that are that distance apart is depicted.

Using the same distance matrix, we computed diversity and haplotype connectivity scores for each of the 10 sampling locations as explained in the Methods section (using the measure AD for diversity). These are presented in Table Table2.2. Note that, in contrast to [17], our scores do not take into account how often a haplotype was found in a particular location but rather which haplotypes were found.

Table 2
Scores for pine data.

As can be seen in Table Table2,2, the two locations with highest AD* diversity scores are Landes and Pantelleria. In view of the HC* scores for these locations, this supports the melting-pot scenario, especially for the Landes location. Note that the bimodality of the GDS for the Landes location is also indicative of two clusters of haplotypes having low internal distances and high between cluster distances, which could also be regarded as a signature supporting a melting-pot scenario. However, the shape of the GDS for the Pantelleria location is somewhat less distinctive and so, in this case at least, the haplotype connectivity approach provides some useful additional information.

Conclusions

We have presented a quantitative method to help shed light on the phylogeographic history of a species, in particular, for distinguishing between hot-spots and melting-pots of haplotypic diversity. The application of our method to the two data sets illustrates that our method should provide a useful addition to previously presented tools based on nested clade analysis and the GDS.

The algorithm for computing the haplotype connectivity of a collection of haplotypes can handle collections of several hundred haplotypes without difficulty. The computation of minimum and maximum haplotype connectivity scores over all subsets of a certain size, though still possible in polynomial time, is more demanding, especially computing the maximum as this involves the computation of minimum vertex separators in a graph. Although the (at least implicit) computation of such separators can probably not be avoided, for data sets where the haplotype connectivity must be computed for many subsets of different size, it could be interesting to develop a more efficient algorithm that preprocesses the distance matrix for the haplotypes so that HCmax(k) can be quickly reported for any given k.

Our method depends on the haplotype distance and on the measure of diversity used for regions. However, based on experiments that we performed on the two data sets above (data not shown), we suspect that the impact of these two choices on the results will usually be quite small, at least for standard measures of distance and diversity. Also, since very low diversity scores will tend to yield low haplotype connectivity scores, we mainly recommend the use of our method only for regions yielding higher levels of haplotypic diversity (which is the case for both hot-spots and melting-pots). For example, for the Pine data above, consider the three Portuguese sampling locations Alcacier, Moncao and Leiria. In [39] it was suggested that there exists a glacial refugia of Pinus pinaster in Portugal. At least for Leiria our method supports this to some extent: In Table Table22 we see that the normalized haplotype connectivity score is as small as possible while the normalized diversity score ranks third from top. But since, at the same time, the normalized diversity score is close to 0, it is somewhat less clear cut that this is indeed a hot-spot. Another potential difficulty arises from sampling issues. First note that the selection of a particular set of markers in a study can introduce a bias, and, second, the number of sampled haplotypes is often not the same for all regions. While the focus of this paper is on efficient algorithms for computing haplotype connectivity, to help interpret the significance of the scores obtained in a study, it would be interesting to investigate statistical properties of this quantity in future work. The computation of HCmin(k) and HCmax(k) can be viewed as first step towards a better understanding of the distribution of HC(Y) over all subsets Y [subset, dbl equals] X of size k for a given distance matrix D. Moreover, to place more emphasis on the geographical aspects of the problem, one could also consider the distribution of HC(Y) over only those subsets Y which satisfy some additional constraint such as, for example, insisting that any two haplotypes in Y are found within a certain maximum geographic distance related to the region sizes used in the study. In this paper, to address the sample-size bias, we have normalized our various scores with respect to the minimum and maximum scores that can be theoretically attained for a fixed number of haplotypes. If the measure of diversity used is such that computing the minimum and maximum is computationally too expensive, then averaging with respect to the number of haplotypes found in a region could be another possibility. However, some care would have to be taken since, as pointed out in [40], this might result in a normalized diversity score that could increase with the removal of a haplotype from a subset.

Another direction of potential interest is to extend our method to simultaneously take into account inter- and intra-species diversity. Many conservation approaches work by selecting species for conservation (see e.g. [41]). These species may be selected explicitly by allocating limited resources to them or implicitly by protecting the habitat containing them. In either approach species or regions are usually selected so as to protect maximal biodiversity. One example of such an approach that has recently attracted a lot of attention is the use of phylogenetic diversity [28,42].

The difficulty with such approaches is that they do not commonly take into account genetic diversity. For example, consider a situation where we might choose to conserve a species that makes a high contribution to phylogenetic diversity (since, for example, it is very different from any species that is likely to survive), but that has low genetic diversity. This low genetic diversity will limit the evolutionary potential of this species and its survival probability. It may therefore be better to conserve a different species that makes a lower contribution to phylogenetic diversity (since, for example, it is more closely related to another species with high survival probability) but has higher genetic diversity. It could be interesting to develop a framework that allows a combination of phylogenetic diversity and genetic diversity in reserve selection. One approach that might be worth exploring is using genetic diversity to allocate survival probabilities to species that could then be incorporated into Noah's Arc Problem frameworks for phylogenetic diversity [43]. This would allow the utilization of some of the algorithmic results that have been recently developed for solving this problem (cf. the survey in [42]).

With the large data sets that new high-throughput sequencing technologies are starting to deliver, our method will hopefully provide a fast and flexible way to analyze landscape scale genetic variation within species. In particular, it provides an efficient way to identify regions of probable long-term species persistence, a useful tool to identify regions of biodiversity conservation importance.

Competing interests

The authors declare that they have no competing interests.

Authors' contributions

BN implemented the algorithms for computing haplotype connectivity scores and carried out the analysis of the data sets. All authors participated in the design of the study, contributed to the writing of the manuscript, and read and approved the final version of the manuscript.

Acknowledgements

VM, BN and AS were supported in part by the Engineering and Physical Sciences Research Council [Grant number EP/D068800/1]. We thank Peter Lockhart for his helpful comments on an earlier version this paper and also the anonymous referees for their helpful comments.

References

  • Emerson BC, Hewitt GM. Phylogeography. Curr Biol. 2005;15:R367–R371. doi: 10.1016/j.cub.2005.05.016. [PubMed] [Cross Ref]
  • Hewitt GM. Some genetic consequences of ice ages, and their role in divergence and speciation. Biol J Linn Soc. 1996;58:247–276.
  • Hewitt GM. The genetic legacy of the Quarternary ice ages. Nature. 2000;405:907–913. doi: 10.1038/35016000. [PubMed] [Cross Ref]
  • Petit R, Aguinagalde I, Beaulieu J, Bittkau C, Brewer S, Cheddadi R, Ennos R, Fineschi S, Grivet D, Lascoux M, Mohanty A, Müller-Stark G, Demesure-Musch B, Palmée A, Martíin J, Rendell S, Vendramin G. Glacial refugia: hotspots but not melting pots of genetic diversity. Science. 2003;300:1563–1565. doi: 10.1126/science.1083264. [PubMed] [Cross Ref]
  • Desmet PG, Cowling RM, Ellis AG, Pressey RL. Integrating biosystematic data into conservation planning: perspectives from Southern Africa's succulent Karoo. Syst Biol. 2002;51:317–330. doi: 10.1080/10635150252899798. [PubMed] [Cross Ref]
  • Avise JC, Arnold J, Ball RM, Bermingham E, Lamb T, Neigel JE, Reeb CA, Saunders NC. Intraspecific phylogeography: the mitochondrial DNA bridge between population genetics and systematics. Ann Rev Ecol Syst. 1987;18:489–522.
  • Camerini P. The min-max spanning tree problem and some extensions. Inform Process Lett. 1978;7:10–14. doi: 10.1016/0020-0190(78)90030-3. [Cross Ref]
  • Templeton AR. Using phylogeographic analyses of gene trees to test species status and processes. Mol Ecol. 2001;10:779–791. doi: 10.1046/j.1365-294x.2001.01199.x. [PubMed] [Cross Ref]
  • Posada D, Crandall KA, Templeton AR. Nested clade analysis statistics. Mol Ecol Notes. 2006;6:590–593. doi: 10.1111/j.1471-8286.2006.01368.x. [Cross Ref]
  • Templeton AR. Nested clade analyses of phylogeographic data: testing hypothesis about gene flow and population history. Mol Ecol. 1998;7:381–397. doi: 10.1046/j.1365-294x.1998.00308.x. [PubMed] [Cross Ref]
  • Lacey Knowles L. Why does a method that fails continue to be used? Evolution. 2008;62:2713–2717. doi: 10.1111/j.1558-5646.2008.00481.x. [PubMed] [Cross Ref]
  • Rozenfeld AF, Arnaud-Haond S, Hernández-García E, Eguíluz VM, Matías MA, Serrão E, Duarte CM. Spectrum of genetic diversity and networks of clonal organisms. J R Soc Interface. 2007;4:1093–1102. doi: 10.1098/rsif.2007.0230. [PMC free article] [PubMed] [Cross Ref]
  • Excoffier L. Patterns of DNA sequence diversity and genetic structure after a range expansion: lessons from the infinite-island model. Mol Ecol. 2004;13:853–864. doi: 10.1046/j.1365-294X.2003.02004.x. [PubMed] [Cross Ref]
  • Schneider S, Excoffier L. Estimation of past demographic parameters from the distribution of pairwise differences when the mutation rates vary among sites: application to human mitochondrial DNA. Genetics. 1999;152:1079–1089. [PubMed]
  • Nei M, Tajima F. DNA polymorphism detectable by restriction endonucleases. Genetics. 1981;97:145–163. [PubMed]
  • Tamura K, Nei M. Estimation of the number of nucleotide substitutions in the control region of the mitochondrial DNA in humans and chimpanzees. Mol Biol Evol. 1993;10:512–526. [PubMed]
  • Vendramin GG, Anzidei M, Madaghiele A, Bucci G. Distribution of genetic diversity in Pinus pinaster Ait. as revealed by chloroplast microsatellites. Theor Appl Genet. 1998;97:456–463. doi: 10.1007/s001220050917. [Cross Ref]
  • Huson D, Nettles S, Warnow T. Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction. J Comput Biol. 1999;6:369–386. doi: 10.1089/106652799318337. [PubMed] [Cross Ref]
  • Berry A, Sigayret A, Sinoquet C. Maximal sub-triangulation in pre-processing phylogenetic data. Soft Computing - A Fusion of Foundations, Methodologies and Applications. 2006;10:461–468.
  • Cormen H, Leiserson CE, Rivest RL, Stein C. Introduction to Algorithms. The MIT Press; 2001.
  • Schönhage A, Paterson M, Pippenger N. Finding the median. J Comput Syst Sci. 1976;13:184–199.
  • Punnen A, Chapovska O. The bottleneck k-MST. Inform Process Lett. 2005;95:512–517. doi: 10.1016/j.ipl.2005.05.025. [Cross Ref]
  • Even S, Tarjan R. Network flow and testing graph connectivity. SIAM J Comput. 1975;4:507–518. doi: 10.1137/0204043. [Cross Ref]
  • Gabow H. Using expander graphs to find vertex connectivity. J ACM. 2006;53:800–844. doi: 10.1145/1183907.1183912. [Cross Ref]
  • Tajima F. The amount of DNA polymorphism maintained in a finite population when neutral mutation rates varies among sites. Genetics. 1996;143:1761–1770. [PubMed]
  • Rauch EM, Bar-Yam Y. Theory predicts the uneven distribution of genetic diversity within species. Nature. 2004;431:449–452. doi: 10.1038/nature02745. [PubMed] [Cross Ref]
  • Rauch EM, Bar-Yam Y. Estimating the total genetic diversity of a spatial field population from a sample and implications of its dependence on habitat area. Proc Natl Acad Sci Unit States Am. 2005;102:9826–9829. doi: 10.1073/pnas.0408471102. [PubMed] [Cross Ref]
  • Faith D. Conservation evaluation and phylogenetic diversity. Biol Conservat. 1992;61:1–10. doi: 10.1016/0006-3207(92)91201-3. [Cross Ref]
  • Pardi F, Goldman N. Species choice for comparative genomics: being greedy works. PLoS Genetics. 2005;1(6) doi: 10.1371/journal.pgen.0010071. [PubMed] [Cross Ref]
  • Steel MA. Phylogenetic diversity and the greedy algorithm. Syst Biol. 2005;54(4):527–529. doi: 10.1080/10635150590947023. [PubMed] [Cross Ref]
  • Spillner A, Nguyen BT, Moulton V. Computing Phylogenetic Diversity for Split Systems. IEEE ACM Trans Comput Biol Bioinformatics. 2008;5(2):235–244. doi: 10.1109/TCBB.2007.70260. [PubMed] [Cross Ref]
  • Blum A, Chalasani P, Coppersmith D, Pulleyblank WR, Raghavan P, Sudan M. The minimum latency problem. Proc. ACM Symposium on Theory of Computing (STOC) 1994. pp. 163–171.
  • Minh B, Klaere S, von Haeseler A. Taxon selection under split diversity. Syst Biol. 2009;58:586–594. doi: 10.1093/sysbio/syp058. [PubMed] [Cross Ref]
  • Echt CS, Verno LLD, Anzidei M, Vendramin GG. Chloroplast microsatellites reveal population genetic diversity in red pine, Pinus resinosa Ait. Mol Ecol. 1998;7:307–317. doi: 10.1046/j.1365-294X.1998.00350.x. [Cross Ref]
  • Hansen P, Moon I. Dispersing facilities on a network. TIMS/ORSA Joint National Meeting, Washington, D.C. 1988.
  • Pisinger D. Upper bounds and exact algorithms for p-dispersion problems. Comput Oper Res. 2006;33:1380–1398. doi: 10.1016/j.cor.2004.09.033. [Cross Ref]
  • Emerson B, Forgie S, Goodacre S, Oromi P. Testing phylogeographic predictions on an active volcanic island: Brachyderes rugatus (Coleoptera: Curculionidae) on La Palma (Canary Islands) Mol Ecol. 2006;15:449–458. doi: 10.1111/j.1365-294X.2005.02786.x. [PubMed] [Cross Ref]
  • Clement M, Posada D, Crandall KA. TCS: A computer program to estimate gene genealogies. Mol Ecol. 2000;9:1557–1659. doi: 10.1046/j.1365-294x.2000.01020.x. [PubMed] [Cross Ref]
  • Bucci G, González-Martínez S, le Provost G, Plomion C, Ribeiro M, Sebastiani F, Alía R, Vendramin G. Range-wide phylogeography and gene zones in Pinus pinaster Ait. revealed by chloroplast microsatellite markers. Mol Ecol. 2007;16:2137–2153. doi: 10.1111/j.1365-294X.2007.03275.x. [PubMed] [Cross Ref]
  • Schweiger O, Klotz S, Durka W, Kühn I. A comparative test of phylogenetic diversity indices. Oecologia. 2008;157:485–495. doi: 10.1007/s00442-008-1082-2. [PubMed] [Cross Ref]
  • Regan H, Hierl L, Franklin J, Deutschman D, Schmalbach H, Winchell C, Johnson B. Species prioritization for monitoring and management in regional multiple species conservation plans. Diversity and Distributions. 2007;14:462–471. doi: 10.1111/j.1472-4642.2007.00447.x. [Cross Ref]
  • Hartmann K, Steel M. In: Reconstructing evolution: new mathematical and computational approaches. Gascuel O, Steel M, editor. Oxford University Press; 2007. Phylogenetic diversity: from combinatorics to ecology.
  • Weitzman M. The Noah's Ark Problem. Econometrica. 1998;66:1279–1298. doi: 10.2307/2999617. [Cross Ref]

Articles from Algorithms for Molecular Biology : AMB are provided here courtesy of BioMed Central