Human genetic variationHuman genetic variation is the genetic differences in and among populations. There may be multiple variants of any given gene in the human population (alleles), a situation called polymorphism. No two humans are genetically identical. Even monozygotic twins (who develop from one zygote) have infrequent genetic differences due to mutations occurring during development and gene copy-number variation. Differences between individuals, even closely related individuals, are the key to techniques such as genetic fingerprinting.
ExaptationExaptation and the related term co-option describe a shift in the function of a trait during evolution. For example, a trait can evolve because it served one particular function, but subsequently it may come to serve another. Exaptations are common in both anatomy and behaviour. Bird feathers are a classic example. Initially they may have evolved for temperature regulation, but later were adapted for flight. When feathers were first used to aid in flight, that was an exaptive use.
Phosphoenolpyruvate carboxykinasePhosphoenolpyruvate carboxykinase (, PEPCK) is an enzyme in the lyase family used in the metabolic pathway of gluconeogenesis. It converts oxaloacetate into phosphoenolpyruvate and carbon dioxide. It is found in two forms, cytosolic and mitochondrial. In humans there are two isoforms of PEPCK; a cytosolic form (SwissProt P35558) and a mitochondrial isoform (SwissProt Q16822) which have 63.4% sequence identity. The cytosolic form is important in gluconeogenesis.
Möbius functionThe Möbius function μ(n) is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated Moebius) in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted μ(x). For any positive integer n, define μ(n) as the sum of the primitive nth roots of unity.
Divisor functionIn mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number of divisors of an integer (including 1 and the number itself). It appears in a number of remarkable identities, including relationships on the Riemann zeta function and the Eisenstein series of modular forms. Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities; these are treated separately in the article Ramanujan's sum.
