Andreas Spillner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Andreas Spillner has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Vincent Moulton
School of Computing Sciences, University of East Anglia, Norwich, UK
5 shared publications - Anna Petri
Department of Plant and Environmental Sciences (DPES) University of Gothenburg Box 461 40530 Göteborg Sweden
1 shared publication - Arne O. Mooers
Simon Fraser University
1 shared publication - Bengt Oxelman
Department of Plant and Environmental Sciences, University of Gothenburg, Sweden
1 shared publication - Binh Nguyen
School of Computing Sciences, University of East Anglia, Norwich, NR4 7TJ, UK
1 shared publication - Brent C. Emerson
Instituto de Productos Naturales y Agrobiología (IPNA-CSIC), San Cristóbal de La Laguna, Canary Islands, Spain
1 shared publication
Latest Publications
- 1 January 2014
- Published by Elsevier in Information Processing Letters
- Vol. 114 (1-2) , 13-18
Fishing for minimum evolution trees with Neighbor-Nets
- 1 January 2014
- Published by Elsevier in Information Processing Letters
- Vol. 114 (1-2) , 13-18
Fishing for minimum evolution trees with Neighbor-Nets
- Open Access
- 13 April 2012
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 7 (1) , 6
Computing evolutionary distinctiveness indices in large scale analysis
We present optimal linear time algorithms for computing the Shapley values and 'heightened evolutionary distinctiveness' (HED) scores for the set of taxa in a phylogenetic tree. We demonstrate the efficiency of these new algorithms by applying them to a set of 10,000 reasonable 5139-species mammal trees. This is the first time these indices have been computed on such a large taxon and we contrast our finding with an ad-hoc index for mammals, fair proportion (FP), used by the Zoological Society of London's EDGE programme. Our empirical results follow expectations. In particular, the Shapley values are very strongly correlated with the FP scores, but provide a higher weight to the few monotremes that comprise the sister to all other mammals. We also find that the HED score, which measures a species' unique contribution to future subsets as function of the probability that close relatives will go extinct, is very sensitive to the estimated probabilities. When they are low, HED scores are less than FP scores, and approach the simple measure of a species' age. Deviations (like the Solendon genus of the West Indies) occur when sister species are both at high risk of extinction and their clade roots deep in the tree. Conversely, when endangered species have higher probabilities of being lost, HED scores can be greater than FP scores and species like the African elephant Loxondonta africana, the two solendons and the thumbless bat Furipterus horrens can move up the rankings. We suggest that conservation attention be applied to such species that carry genetic responsibility for imperiled close relatives. We also briefly discuss extensions of Shapley values and HED scores that are possible with the algorithms presented here.
- 13 April 2012
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 7 (1) , 6
Open AccessComputing evolutionary distinctiveness indices in large scale analysis
We present optimal linear time algorithms for computing the Shapley values and 'heightened evolutionary distinctiveness' (HED) scores for the set of taxa in a phylogenetic tree. We demonstrate the efficiency of these new algorithms by applying them to a set of 10,000 reasonable 5139-species mammal trees. This is the first time these indices have been computed on such a large taxon and we contrast our finding with an ad-hoc index for mammals, fair proportion (FP), used by the Zoological Society of London's EDGE programme. Our empirical results follow expectations. In particular, the Shapley values are very strongly correlated with the FP scores, but provide a higher weight to the few monotremes that comprise the sister to all other mammals. We also find that the HED score, which measures a species' unique contribution to future subsets as function of the probability that close relatives will go extinct, is very sensitive to the estimated probabilities. When they are low, HED scores are less than FP scores, and approach the simple measure of a species' age. Deviations (like the Solendon genus of the West Indies) occur when sister species are both at high risk of extinction and their clade roots deep in the tree. Conversely, when endangered species have higher probabilities of being lost, HED scores can be greater than FP scores and species like the African elephant Loxondonta africana, the two solendons and the thumbless bat Furipterus horrens can move up the rankings. We suggest that conservation attention be applied to such species that carry genetic responsibility for imperiled close relatives. We also briefly discuss extensions of Shapley values and HED scores that are possible with the algorithms presented here.
- Open Access
- 20 March 2010
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 5 (1) , 19
Distinguishing between hot-spots and melting-pots of genetic diversity using haplotype connectivity
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.
- 20 March 2010
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 5 (1) , 19
Open AccessDistinguishing between hot-spots and melting-pots of genetic diversity using haplotype connectivity
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.
- 1 October 2009
- Published by Elsevier in Applied Mathematics Letters
- Vol. 22 (10) , 1496-1499
Phylogenetic diversity and the maximum coverage problem
- 1 October 2009
- Published by Elsevier in Applied Mathematics Letters
- Vol. 22 (10) , 1496-1499
Phylogenetic diversity and the maximum coverage problem
- Open Access
- 28 August 2009
- Published by Springer Nature in BMC Ecology and Evolution
- Vol. 9 (1) , 216
Inferring polyploid phylogenies from multiply-labeled gene trees
Background: Gene trees that arise in the context of reconstructing the evolutionary history of polyploid species are often multiply-labeled, that is, the same leaf label can occur several times in a single tree. This property considerably complicates the task of forming a consensus of a collection of such trees compared to usual phylogenetic trees.Results: We present a method for computing a consensus tree of multiply-labeled trees. As with the well-known greedy consensus tree approach for phylogenetic trees, our method first breaks the given collection of gene trees into a set of clusters. It then aims to insert these clusters one at a time into a tree, starting with the clusters that are supported by most of the gene trees. As the problem to decide whether a cluster can be inserted into a multiply-labeled tree is computationally hard, we have developed a heuristic method for solving this problem.Conclusion: We illustrate the applicability of our method using two collections of trees for plants of the genusSilene, that involve several allopolyploids at different levels.
- 28 August 2009
- Published by Springer Nature in BMC Ecology and Evolution
- Vol. 9 (1) , 216
Open AccessInferring polyploid phylogenies from multiply-labeled gene trees
Background: Gene trees that arise in the context of reconstructing the evolutionary history of polyploid species are often multiply-labeled, that is, the same leaf label can occur several times in a single tree. This property considerably complicates the task of forming a consensus of a collection of such trees compared to usual phylogenetic trees.Results: We present a method for computing a consensus tree of multiply-labeled trees. As with the well-known greedy consensus tree approach for phylogenetic trees, our method first breaks the given collection of gene trees into a set of clusters. It then aims to insert these clusters one at a time into a tree, starting with the clusters that are supported by most of the gene trees. As the problem to decide whether a cluster can be inserted into a multiply-labeled tree is computationally hard, we have developed a heuristic method for solving this problem.Conclusion: We illustrate the applicability of our method using two collections of trees for plants of the genusSilene, that involve several allopolyploids at different levels.