↓ Skip to main content

Interpretation and approximation tools for big, dense Markov chain transition matrices in population genetics

Overview of attention for article published in Algorithms for Molecular Biology, December 2015
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age (51st percentile)
  • Good Attention Score compared to outputs of the same age and source (66th percentile)

Mentioned by

twitter
6 X users

Citations

dimensions_citation
9 Dimensions

Readers on

mendeley
25 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Interpretation and approximation tools for big, dense Markov chain transition matrices in population genetics
Published in
Algorithms for Molecular Biology, December 2015
DOI 10.1186/s13015-015-0061-5
Pubmed ID
Authors

Katja Reichel, Valentin Bahier, Cédric Midoux, Nicolas Parisey, Jean-Pierre Masson, Solenn Stoeckel

Abstract

Markov chains are a common framework for individual-based state and time discrete models in evolution. Though they played an important role in the development of basic population genetic theory, the analysis of more complex evolutionary scenarios typically involves approximation with other types of models. As the number of states increases, the big, dense transition matrices involved become increasingly unwieldy. However, advances in computational technology continue to reduce the challenges of "big data", thus giving new potential to state-rich Markov chains in theoretical population genetics. Using a population genetic model based on genotype frequencies as an example, we propose a set of methods to assist in the computation and interpretation of big, dense Markov chain transition matrices. With the help of network analysis, we demonstrate how they can be transformed into clear and easily interpretable graphs, providing a new perspective even on the classic case of a randomly mating, finite population with mutation. Moreover, we describe an algorithm to save computer memory by substituting the original matrix with a sparse approximate while preserving its mathematically important properties, including a closely corresponding dominant (normalized) eigenvector. A global sensitivity analysis of the approximation results in our example shows that size reduction of more than 90 % is possible without significantly affecting the basic model results. Sample implementations of our methods are collected in the Python module mamoth. Our methods help to make stochastic population genetic models involving big, dense transition matrices computationally feasible. Our visualization techniques provide new ways to explore such models and concisely present the results. Thus, our methods will contribute to establish state-rich Markov chains as a valuable supplement to the diversity of population genetic models currently employed, providing interesting new details about evolution e.g. under non-standard reproductive systems such as partial clonality.

X Demographics

X Demographics

The data shown below were collected from the profiles of 6 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 25 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Botswana 1 4%
Unknown 24 96%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 6 24%
Researcher 5 20%
Student > Master 4 16%
Student > Bachelor 2 8%
Lecturer 2 8%
Other 0 0%
Unknown 6 24%
Readers by discipline Count As %
Agricultural and Biological Sciences 7 28%
Computer Science 4 16%
Biochemistry, Genetics and Molecular Biology 2 8%
Mathematics 1 4%
Environmental Science 1 4%
Other 4 16%
Unknown 6 24%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 06 January 2016.
All research outputs
#13,377,574
of 22,836,570 outputs
Outputs from Algorithms for Molecular Biology
#98
of 264 outputs
Outputs of similar age
#187,780
of 393,178 outputs
Outputs of similar age from Algorithms for Molecular Biology
#2
of 6 outputs
Altmetric has tracked 22,836,570 research outputs across all sources so far. This one is in the 41st percentile – i.e., 41% of other outputs scored the same or lower than it.
So far Altmetric has tracked 264 research outputs from this source. They receive a mean Attention Score of 3.2. This one has gotten more attention than average, scoring higher than 62% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 393,178 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 51% of its contemporaries.
We're also able to compare this research output to 6 others from the same source and published within six weeks on either side of this one. This one has scored higher than 4 of them.