967 resultados para evolutionary algorithms


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Little is known about the microevolutionary processes shaping within river population genetic structure of aquatic organisms characterized by high levels of homing and spawning site fidelity. Using a microsatellite panel, we observed complex and highly significant levels of intrariver population genetic substructure and Isolation-by-Distance, in the Atlantic salmon stock of a large river system. Two evolutionary models have been considered explaining mechanisms promoting genetic substructuring in Atlantic salmon, the member-vagrant and metapopulation models. We show that both models can be simultaneously used to explain patterns and levels of population structuring within the Foyle system. We show that anthropogenic factors have had a large influence on contemporary population structure observed. In an analytical development, we found that the frequently used estimator of genetic differentiation, F-ST, routinely underestimated genetic differentiation by a factor three to four compared to the equivalent statistic Jost's D-est (Jost 2008). These statistics also showed a near-perfect correlation. Despite ongoing discussions regarding the usefulness of "adjusted" F-ST statistics, we argue that these could be useful to identify and quantify qualitative differences between populations, which are important from management and conservation perspectives as an indicator of existence of biologically significant variation among tributary populations or a warning of critical environmental damage.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The treatment of the Random-Phase Approximation Hamiltonians, encountered in different frameworks, like time-dependent density functional theory or Bethe-Salpeter equation, is complicated by their non-Hermicity. Compared to their Hermitian Hamiltonian counterparts, computational methods for the treatment of non-Hermitian Hamiltonians are often less efficient and less stable, sometimes leading to the breakdown of the method. Recently [Gruning et al. Nano Lett. 8 (2009) 28201, we have identified that such Hamiltonians are usually pseudo-Hermitian. Exploiting this property, we have implemented an algorithm of the Lanczos type for Random-Phase Approximation Hamiltonians that benefits from the same stability and computational load as its Hermitian counterpart, and applied it to the study of the optical response of carbon nanotubes. We present here the related theoretical grounds and technical details, and study the performance of the algorithm for the calculation of the optical absorption of a molecule within the Bethe-Salpeter equation framework. (C) 2011 Elsevier B.V. All rights reserved.