Search NASA⌕ Search

SEARCH · Search NASA

Results for “Adaptivity”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

Data-driven projection pursuit adaptation of polynomial chaos expansions for dependent high-dimensional parameters

Uncertainty quantification (UQ) and inference involving a large number of parameters are valuable tools for problems associated with heterogeneous and non-stationary behaviors. The difficulty with these problems is exacerbated when these parameters are statistically dependent requiring statistical characterization over joint measures. Probabilistic modeling methodologies stand as effective tools in the realms of UQ and inference. Among these, polynomial chaos expansions (PCE), when adapted to low-dimensional quantities of interest (QoI), provide effective yet accurate approximations for these QoI in terms of an adapted orthogonal basis. These adaptation techniques have been cast as projection pursuits in Gaussian Hilbert space in what has been referred to as a projection pursuit adaptation (PPA) by Xiaoshu Zeng and Roger Ghanem (2023). The PPA method efficiently identifies an optimal low-dimensional space for representing the QoI and simultaneously evaluates an optimal PCE within that space. The quality of this approximation clearly depends on the size of the training dataset, which is typically a function of the adapted reduced dimension. Here, the complexity of the problem is thus mediated by the complexity of the low-dimensional quantity of interest and not the complexity of the high-dimensional parameter space.

Data-driven↗

Moment-based adaptive time integration for thermal radiation transport

Here, in this paper we develop a framework for moment-based adaptive time integration of deterministic multifrequency thermal radiation transpot (TRT). We generalize our recent semi-implicit-explicit (IMEX) integration framework for gray TRT to multifrequency TRT, and also introduce a semi-implicit variation that facilitates higher-order integration of TRT, where each stage is implicit in all components except opacities. To appeal to the broad literature on adaptivity with Runge–Kutta methods, we derive new embedded methods for four asymptotic preserving IMEX Runge–Kutta schemes we have found to be robust in our previous work on TRT and radiation hydrodynamics. We then use a moment-based high-order-low-order representation of the transport equations. Due to the high dimensionality, memory is always a concern in simulating TRT. We form error estimates and adaptivity in time purely based on temperature and radiation energy, for a trivial overhead in computational cost and memory usage compared with the base second order integrators. We then test the adaptivity in time on the tophat and Larsen problem, demonstrating the ability of the adaptive algorithm to naturally vary the timestep across 4–5 orders of magnitude, ranging from the dynamical timescales of the streaming regime to the thick diffusion limit.

97 MATHEMATICS AND COMPUTING↗

Classical Preoptimization Approach for ADAPT-VQE: Maximizing the Potential of High-Performance Computing Resources to Improve Quantum Simulation of Chemical Applications

The ADAPT-VQE algorithm is a promising method for generating a compact ansatz based on derivatives of the underlying cost function, and it yields accurate predictions of electronic energies for molecules. In this work, we report the implementation and performance of ADAPT-VQE with our recently developed sparse wave function circuit solver (SWCS) in terms of accuracy and efficiency for molecular systems with up to 52 spin orbitals. The SWCS can be tuned to balance computational cost and accuracy, which extends the application of ADAPT-VQE for molecular electronic structure calculations to larger basis sets and a larger number of qubits. Using this tunable feature of the SWCS, we propose an alternative optimization procedure for ADAPT-VQE to reduce the computational cost of the optimization. Furthermore, by preoptimizing a quantum simulation with a parametrized ansatz generated with ADAPT-VQE/SWCS, we aim to utilize the power of classical high-performance computing in order to minimize the work required on noisy intermediate-scale quantum hardware, which offers a promising path toward demonstrating quantum advantage for chemical applications.

ADAPT-VQE↗

Boundary-Aware Adversarial Learning Domain Adaption and Active Learning for Cross-Sensor Building Extraction

The use of convolutional neural networks (CNNs) for building extraction from remote sensing images has been widely studied and many public datasets have been made available for accelerating development of these CNN models. Yet adapting pretrained models at scale in real-world scenarios remains a challenging task. The main barrier is that certain new labels are still needed to compensate for domain shifting between the labeled data and new images that potentially cover new geographic locations or that are from a different sensor. In this article, we propose to add informatively labeled samples from a new image pool under the paradigm of active learning. To select the most useful samples based on model uncertainty, we first tackle the problem of uncalibrated uncertainty estimation due to distribution shifting by adapting feature extractors with boundary-based adversarial learning. Calibrated uncertainty is used as the query criterion in the active learning process, where the most uncertain samples are selected for annotation and included for model retraining. The proposed workflow was tested with three data pairs in which each workflow represents a scenario often encountered in real-world applications, including adapting pretrained models to new images collected with different sensors or to new geographic areas where appearances and types of buildings are very different. Compared to several baselines, including random sampling, temperature scaling (a well-known uncertainty calibration technique), different query strategies, and active domain adaptation methods, the proposed workflow shows that strategically querying a smaller set of samples for labeling achieves comparable or better building extraction performance. The proposed method reduces the number of labeled samples required to achieve sufficient model accuracy, thus significantly reducing hundreds of person-hours for labeled data creation. In addition, we include a few considerations when deploying this workflow in a GPU cluster that can be easily adapted to achieve operational building extraction model retraining.

97 MATHEMATICS AND COMPUTING↗

Improving Deep Neural Networks’ Training for Image Classification With Nonlinear Conjugate Gradient-Style Adaptive Momentum

Momentum is crucial in stochastic gradient-based optimization algorithms for accelerating or improving training deep neural networks (DNNs). In deep learning practice, the momentum is usually weighted by a well-calibrated constant. However, tuning the hyperparameter for momentum can be a significant computational burden. In this article, we propose a novel adaptive momentum for improving DNNs training; this adaptive momentum, with no momentum-related hyperparame- ter required, is motivated by the nonlinear conjugate gradient (NCG) method. Stochastic gradient descent (SGD) with this new adaptive momentum eliminates the need for the momentum hyperparameter calibration, allows using a significantly larger learning rate, accelerates DNN training, and improves the final accuracy and robustness of the trained DNNs. For example, SGD with this adaptive momentum reduces classification errors for training ResNet110 for CIFAR10 and CIFAR100 from 5.25% to 4.64% and 23.75% to 20.03%, respectively. Furthermore, SGD, with the new adaptive momentum, also benefits adversarial training and, hence, improves the adversarial robustness of the trained DNNs.

97 MATHEMATICS AND COMPUTING↗

Improved Localization Precision and Angular Resolution of a Cylindrical, Time-Encoded Imaging System From Adaptive Detector Movements

To the first order, the localization precision and angular resolution of a cylindrical, time-encoded imaging (c-TEI) system is governed by the geometry of the system. Improving either measure requires increasing the mask radius or decreasing the detector diameter, both of which are undesirable. Here, we propose an alternative option of repositioning the detector within the mask to increase the detector-to-mask distance in the direction of a source, thereby improving the localization precision and angular resolution in that direction. Since the detector-to-mask distance only increases for a small portion of the field of view (FOV), we propose implementing adaptive imaging where one leverages data collected during the measurement to optimize the system configuration. This article utilizes both simulations and experiments to set upper bounds on the potential gain from adaptive detector movements for one and two sources in the FOV. When only one source is present, adaptive detector movements can improve the localization precision and angular resolution by 20% for a source at 90 cm and by 32% for a far-field source. When two sources are present, adaptive detector movements can improve localization precision and angular resolution by up to 50% for sources that are ~10° apart (90 cm from the system). We experimentally verify these results through maximum likelihood estimation of the source position(s) and image reconstruction of point sources that are close together. As a demonstration of an adaptive imaging algorithm, we image a complex arrangement of special nuclear material at the Zero Power Physics Reactor facility at Idaho National Laboratory.

46 - INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AN↗

A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions

We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation strategy begins with a coarse isotropic interpolant, which is gradually refined using the estimated anisotropic rates. The procedure takes several iterations where ever-more accurate interpolants are used to generate ever-improving anisotropy rates. We present several numerical examples of our algorithm where the adaptive procedure successfully recovers the theoretical “best” convergence rate, including an application to a periodic PES approximation. An open-source implementation of our algorithm resides in the Tasmanian UQ library developed at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗

Comparative genomics reveals the high diversity and adaptation strategies of Polaromonas from polar environments

Abstract Background Bacteria from the genus Polaromonas are dominant phylotypes found in a variety of low-temperature environments in polar regions. The diversity and biogeographic distribution of Polaromonas have been largely expanded on the basis of 16 S rRNA gene amplicon sequencing. However, the evolution and cold adaptation mechanisms of Polaromonas from polar regions are poorly understood at the genomic level. Results A total of 202 genomes of the genus Polaromonas were analyzed, and 121 different species were delineated on the basis of average nucleotide identity (ANI) and phylogenomic placements. Remarkably, 8 genomes recovered from polar environments clustered into a separate clade (‘polar group’ hereafter). The genome size, coding density and coding sequences (CDSs) of the polar group were significantly different from those of other nonpolar Polaromonas . Furthermore, the enrichment of genes involved in carbohydrate and peptide metabolism was evident in the polar group. In addition, genes encoding proteins related to betaine synthesis and transport were increased in the genomes from the polar group. Phylogenomic analysis revealed that two different evolutionary scenarios may explain the adaptation of Polaromonas to cold environments in polar regions. Conclusions The global distribution of the genus Polaromonas highlights its strong adaptability in both polar and nonpolar environments. Species delineation significantly expands our understanding of the diversity of the Polaromonas genus on a global scale. In this study, a polar-specific clade was found, which may represent a specific ecotype well adapted to polar environments. Collectively, genomic insight into the metabolic diversity, evolution and adaptation of the genus Polaromonas at the genome level provides a genetic basis for understanding the potential response mechanisms of Polaromonas to global warming in polar regions.

54 ENVIRONMENTAL SCIENCES↗

Deep Sequencing of MHC-Adapted Viral Lines Reveals Complex Recombinational Exchanges With Endogenous Retroviruses Leading to High-Frequency Variants

Experimental evolution (serial passage) of Friend virus complex (FVC) in mice demonstrates phenotypic adaptation to specific host major histocompatibility complex (MHC) genotypes. These evolved viral lines show increased fitness and virulence in their host-genotype-of-passage, but display fitness and virulence tradeoffs when infecting unfamiliar host MHC genotypes. Here, we deep sequence these viral lines in an attempt to discover the genetic basis of FVC adaptation. The principal prediction for genotype-specific adaptation is that unique mutations would rise to high frequency in viral lines adapted to each host MHC genotype. This prediction was not supported by our sequencing data as most observed high-frequency variants were present in each of our independently evolved viral lines. However, using a multi-variate approach to measure divergence between viral populations, we show that populations of replicate evolved viral lines from the same MHC congenic mouse strain were more similar to one another than to lines derived from different MHC congenic mouse strains, suggesting that MHC genotype does predictably act on viral evolution in our model. Sequence analysis also revealed rampant recombination with endogenous murine leukemia virus sequences (EnMuLVs) that are encoded within the BALB/c mouse genome. The highest frequency variants in all six lines contained a 12 bp insertion from a recombinant EnMuLV source, suggesting such recombinants were either being favored by selection or were contained in a recombinational hotspot. Interestingly, they did not reach fixation, as if they are low fitness. The amount of background mutations linked to FVC/EnMuLV variable sites indicated that FVC/EnMuLV recombinants had not reached mutation selection equilibrium and thus, that EnMuLV sequences are likely continuously introgressing into the replicating viral population. These discoveries raise the question: is the expression of EnMuLV sequences in mouse splenocytes that permit recombination with exogenous FVC a pathogen or host adaptation?

59 BASIC BIOLOGICAL SCIENCES↗

Industry Assessment and Initial Adaptive Protection System Design

This report presents the success merits, logic design details, and test plans for adaptive protection schemes for microgrids, secondary distribution networks, and radial distribution feeders. Success merits are presented in terms of challenges and issues which should be mitigated. The challenges and issues were identified during site-specific simulations and analysis presented in a prior report. The adaptive protection logic designs are presented in a vendor-neutral manner to make them readily adaptable to site--specific protection relays and controllers which support custom logic design. Vendor-specific implementations of the logic for the adaptive protection laboratory tests are also presented. The final section of the report presents details of the testing methodology, plans, and documentation for each of the three adaptive protection schemes.

14 SOLAR ENERGY↗

Temporal multi-omic analysis uncovers sex-biased molecular programs underlying skeletal muscle adaptation to endurance training

Background. Exercise training is known to benefit health and reduce disease risk. While adaptations in skeletal muscles are fundamental to many of the health benefits of exercise training, the common and sex-specific molecular regulators that mediate these adaptations remain to be fully elucidated. Methods. To this end, we leveraged skeletal muscle multi-omics data generated by the Molecular Transducers of Physical Activity Consortium (MoTrPAC), where 6 month-old male and female rats endurance trained for 1, 2, 4, or 8 weeks. Our objective was to identify shared and sex-specific multi-omic molecular responses to endurance training in skeletal muscle, and relate them to phenotypic adaptations. Results. We identified largely sexually-conserved transcriptomic and proteomic enrichments in the gastrocnemius, which correlated with skeletal muscle responses from a published exercise study in humans. We uncovered sex-consistent post-translational modifications, including decreased oxidation of MYH2 and deacetylation of the ß-oxidation enzyme HADHA. Pathway enrichment analyses revealed sex-specific remodeling across the acetylome, redox proteome, and phosphoproteome; females decreased mitochondrial protein oxidation and increased mitochondrial cristae proteins, indicative of enhanced redox buffering and mitochondrial efficiency. Despite observed decreases in the oxidation of key mitochondrial proteins, females displayed increases in the oxidation of proteins involved in glucose catabolism relative to males after 8 weeks of training, suggestive of sex-biased subcellular reactive oxygen species generation. Conclusions. This work shows a large portion of the adaptive response to endurance training in skeletal muscle is shared between females and males, while there are distinct and nuanced sex-specific adaptations that are evident, particularly at the level of post-translational regulation.

Many, Gina M.↗

Projection pursuit adaptation on polynomial chaos expansions

Here, the present work addresses the issue of accurate stochastic approximations in high-dimensional parametric space using tools from uncertainty quantification (UQ). The basis adaptation method and its accelerated algorithm in polynomial chaos expansions (PCE) were recently proposed to construct low-dimensional approximations adapted to specific quantities of interest (QoI). The present paper addresses one difficulty with these adaptations, namely their reliance on quadrature point sampling, which limits the reusability of potentially expensive samples. Projection pursuit (PP) is a statistical tool to find the “interesting” projections in high-dimensional data and thus bypass the curse-of-dimensionality. In the present work, we combine the fundamental ideas of basis adaptation and projection pursuit regression (PPR) to propose a novel method to simultaneously learn the optimal low-dimensional spaces and PCE representation from given data. While this projection pursuit adaptation (PPA) can be entirely data-driven, the constructed approximation exhibits mean-square convergence to the solution of an underlying governing equation and thus captures the supports and probability distributions associated with the physics constraints. The proposed approach is demonstrated on a borehole problem and a structural dynamics problem, demonstrating the versatility of the method and its ability to discover low-dimensional manifolds with high accuracy with limited data. In addition, the method can learn surrogate models for different quantities of interest while reusing the same data set.

97 MATHEMATICS AND COMPUTING↗

ATEQ: Adaptive toroidal equilibrium code

A radially adaptive numerical scheme is developed to solve the Grad–Shafranov equation for axisymmetric magnetohydrodynamic equilibrium. Here, a decomposition with independent solutions is employed in the radial direction, and Fourier decomposition is used in the poloidal direction. The independent solutions are then obtained using an adaptive shooting scheme together with the multi-region matching technique in the radial direction. Accordingly, the adaptive toroidal equilibrium (ATEQ) code is constructed for axisymmetric equilibrium studies. The adaptive numerical scheme in the radial direction improves considerably the accuracy of the equilibrium solution. The decomposition with independent solutions effectively reduces the matrix size in solving the magnetohydrodynamic equilibrium problem. The reduction of the matrix size is about an order of magnitude as compared with the conventional radially grid-based numerical schemes. Also, in this ATEQ numerical scheme, no matter how accuracy in the radial direction is imposed, the size of matrices basically does not change. The small matrix size scheme gives ATEQ more flexibility to address the requirement of the number of Fourier components in the poloidal direction in tough equilibrium problems. These two unique features, the adaptive shooting and small matrix size, make ATEQ useful to improve tokamak equilibrium solutions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Sequential Kalman tuning of the t -preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems

Ensemble Kalman Inversion (EKI) has been proposed as an efficient method for the approximate solution of Bayesian inverse problems with expensive forward models. However, when applied to the Bayesian inverse problem EKI is only exact in the regime of Gaussian target measures and linear forward models. Here, in this work we propose embedding EKI and Flow Annealed Kalman Inversion, its normalizing flow (NF) preconditioned variant, within a Bayesian annealing scheme as part of an adaptive implementation of the t-preconditioned Crank-Nicolson (tpCN) sampler. The tpCN sampler differs from standard pCN in that its proposal is reversible with respect to the multivariate t-distribution. The more flexible tail behaviour allows for better adaptation to sampling from non-Gaussian targets. Within our Sequential Kalman Tuning (SKT) adaptation scheme, EKI is used to initialize and precondition the tpCN sampler for each annealed target. The subsequent tpCN iterations ensure particles are correctly distributed according to each annealed target, avoiding the accumulation of errors that would otherwise impact EKI. We demonstrate the performance of SKT for tpCN on three challenging numerical benchmarks, showing significant improvements in the rate of convergence compared to adaptation within standard SMC with importance weighted resampling at each temperature level, and compared to similar adaptive implementations of standard pCN. The SKT scheme applied to tpCN offers an efficient, practical solution for solving the Bayesian inverse problem when gradients of the forward model are not available. Code implementing the SKT schemes for tpCN is available at https://github.com/RichardGrumitt/KalmanMC.

97 MATHEMATICS AND COMPUTING↗

Nonlinear burn control in ITER using adaptive allocation of actuators with uncertain dynamics

Abstract ITER will be the first tokamak to sustain a fusion-producing, or burning, plasma. If the plasma temperature were to inadvertently rise in this burning regime, the positive correlation between temperature and the fusion reaction rate would establish a destabilizing positive feedback loop. Careful regulation of the plasma’s temperature and density, or burn control, is required to prevent these potentially reactor-damaging thermal excursions, neutralize disturbances and improve performance. In this work, a Lyapunov-based burn controller is designed using a full zero-dimensional nonlinear model. An adaptive estimator manages destabilizing uncertainties in the plasma confinement properties and the particle recycling conditions (caused by plasma–wall interactions). The controller regulates the plasma density with requests for deuterium and tritium particle injections. In ITER-like plasmas, the fusion-born alpha particles will primarily heat the plasma electrons, resulting in different electron and ion temperatures in the core. By considering separate response models for the electron and ion energies, the proposed controller can independently regulate the electron and ion temperatures by requesting that different amounts of auxiliary power be delivered to the electrons and ions. These two commands for a specific control effort (electron and ion heating) are sent to an actuator allocation module that optimally maps them to the heating actuators available to ITER: an electron cyclotron heating system (20 MW), an ion cyclotron heating system (20 MW), and two neutral beam injectors (16.5 MW each). Two different actuator allocators are presented in this work. The first actuator allocator finds the optimal mapping by solving a convex quadratic program that includes actuator saturation and rate limits. It is nonadaptive and assumes that the mapping between the commanded control efforts and the allocated actuators (i.e. the effector model) contains no uncertainties. The second actuator allocation module has an adaptive estimator to handle uncertainties in the effector model. This uncertainty includes actuator efficiencies, the fractions of neutral beam heating that are deposited into the plasma electrons and ions, and the tritium concentration of the fueling pellets. Furthermore, the adaptive allocator considers actuator dynamics (actuation lag) that contain uncertainty. This adaptive allocation algorithm is more computationally efficient than the aforementioned nonadaptive allocator because it is computed using dynamic update laws so that finding the solution to a static optimization problem is not required at every time step. A simulation study assesses the performance of the proposed adaptive burn controller augmented with each of the actuator allocation modules.

Physics↗

Genomic Signatures of a Major Adaptive Event in the Pathogenic Fungus Melampsora larici-populina

The recent availability of genome-wide sequencing techniques has allowed systematic screening for molecular signatures of adaptation, including in nonmodel organisms. Host–pathogen interactions constitute good models due to the strong selective pressures that they entail. We focused on an adaptive event which affected the poplar rust fungus Melampsora larici-populina when it overcame a resistance gene borne by its host, cultivated poplar. Based on 76 virulent and avirulent isolates framing narrowly the estimated date of the adaptive event, we examined the molecular signatures of selection. Using an array of genome scan methods based on different features of nucleotide diversity, we detected a single locus exhibiting a consistent pattern suggestive of a selective sweep in virulent individuals (excess of differentiation between virulent and avirulent samples, linkage disequilibrium, genotype–phenotype statistical association, and long-range haplotypes). Our study pinpoints a single gene and further a single amino acid replacement which may have allowed the adaptive event. Although our samples are nearly contemporary to the selective sweep, it does not seem to have affected genome diversity further than the immediate vicinity of the causal locus, which can be explained by a soft selective sweep (where selection acts on standing variation) and by the impact of recombination in mitigating the impact of selection. Therefore, it seems that properties of the life cycle of M. larici-populina, which entails both high genetic diversity and outbreeding, has facilitated its adaptation.

59 BASIC BIOLOGICAL SCIENCES↗

The Adaptive Potential of the Middle Domain of Yeast Hsp90

Abstract The distribution of fitness effects (DFEs) of new mutations across different environments quantifies the potential for adaptation in a given environment and its cost in others. So far, results regarding the cost of adaptation across environments have been mixed, and most studies have sampled random mutations across different genes. Here, we quantify systematically how costs of adaptation vary along a large stretch of protein sequence by studying the distribution of fitness effects of the same ≈2,300 amino-acid changing mutations obtained from deep mutational scanning of 119 amino acids in the middle domain of the heat shock protein Hsp90 in five environments. This region is known to be important for client binding, stabilization of the Hsp90 dimer, stabilization of the N-terminal-Middle and Middle-C-terminal interdomains, and regulation of ATPase–chaperone activity. Interestingly, we find that fitness correlates well across diverse stressful environments, with the exception of one environment, diamide. Consistent with this result, we find little cost of adaptation; on average only one in seven beneficial mutations is deleterious in another environment. We identify a hotspot of beneficial mutations in a region of the protein that is located within an allosteric center. The identified protein regions that are enriched in beneficial, deleterious, and costly mutations coincide with residues that are involved in the stabilization of Hsp90 interdomains and stabilization of client-binding interfaces, or residues that are involved in ATPase–chaperone activity of Hsp90. Thus, our study yields information regarding the role and adaptive potential of a protein sequence that complements and extends known structural information.

Cote-Hammarlof, Pamela A.↗

Museomics Dissects the Genetic Basis for Adaptive Seasonal Coloration in the Least Weasel

Abstract Dissecting the link between genetic variation and adaptive phenotypes provides outstanding opportunities to understand fundamental evolutionary processes. Here, we use a museomics approach to investigate the genetic basis and evolution of winter coat coloration morphs in least weasels (Mustela nivalis), a repeated adaptation for camouflage in mammals with seasonal pelage color moults across regions with varying winter snow. Whole-genome sequence data were obtained from biological collections and mapped onto a newly assembled reference genome for the species. Sampling represented two replicate transition zones between nivalis and vulgaris coloration morphs in Europe, which typically develop white or brown winter coats, respectively. Population analyses showed that the morph distribution across transition zones is not a by-product of historical structure. Association scans linked a 200-kb genomic region to coloration morph, which was validated by genotyping museum specimens from intermorph experimental crosses. Genotyping the wild populations narrowed down the association to pigmentation gene MC1R and pinpointed a candidate amino acid change cosegregating with coloration morph. This polymorphism replaces an ancestral leucine residue by lysine at the start of the first extracellular loop of the protein in the vulgaris morph. A selective sweep signature overlapped the association region in vulgaris, suggesting that past adaptation favored winter-brown morphs and can anchor future adaptive responses to decreasing winter snow. Using biological collections as valuable resources to study natural adaptations, our study showed a new evolutionary route generating winter color variation in mammals and that seasonal camouflage can be modulated by changes at single key genes.

Miranda, Inês↗