Y-chromosome haplotype distribution in Han Chinese populations and modern human origin in East Asians

We investigated the distribution of Y-chromosome haplotype using 19 Y-SNPs in Han Chinese populations from 22 provinces of China. Our data indicate distinctive patterns of Y chromosome between southern and northern Han Chinese populations. The southern po

Y-chromosome evidence for no independent origin of modern human in China

East Asia is one of the few regions in the world where a large number of human fossils have been unearthed. The continuity of hominid fossils in East Asia, particularly in China has been presented as strong evidence supporting an independent origin of mod

African origin of modern humans in East Asia: A tale of 12,000 Y chromosomes

To test the hypotheses of modern human origin in East Asia, we sampled 12,127 male individuals from 163 populations and typed for three Y chromosome biallelic markers (YAP, M89, and M130). All the individuals carried a mutation at one of the three sites.

Y chromosome evidence of earliest modern human settlement in East Asia and multiple origins of Tibetan and Japanese populations

Background: The phylogeography of the Y chromosome in Asia previously suggested that modern humans of African origin initially settled in mainland southern East Asia, and about 25,000 30,000 years ago, migrated northward, spreading throughout East Asia. H

Positive selection drives population differentiation in the skeletal genes in modern humans

During the course of evolution, the human skeletal system has evolved rapidly leading to an incredible array of phenotypic diversity, including variations in height and bone mineral density. However, the genetic basis of this phenotypic diversity and the relatively rapid tempo of evolution have remained largely undocumented. Here, we discover that skeletal genes exhibit a significantly greater level of population differentiation among humans compared with other genes in the genome. The pattern is exceptionally evident at amino acid-altering sites within these genes. Divergence is greater between Africans and both Europeans and East Asians. In contrast, relatively weak differentiation is observed between Europeans and East Asians. SNPs with higher levels of differentiation have correspondingly higher derived allele frequencies in Europeans and East Asians. Thus, it appears that positive selection has operated on skeletal genes in the non-African populations and this may have been initiated with the human colonization of Eurasia. In conclusion, we provide genetic evidence supporting the rapid evolution of the human skeletal system and the associated diversity of phenotypes.

On equations for regular languages, finite automata, and sequential networks

We consider systems of equations of the form where A is the underlying alphabet, the Xi are variables, the Pi,a are boolean functions in the variables Xi, and each δi is either the empty word or the empty set. The symbols υ and denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automation, called boolean automation, which is a generalization of a nondeterministic automation. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.

practical type checking of functions defined on context-free languages

A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF.languages is not decidable,a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked.Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented.

pattern matching compilation of functions defined in context-free languages

LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed.

facilitating formal specification acquisition by using recursive functions on context-free languages

Although formal specification techniques are very useful in software development, the acquisition of formal specifications is a difficult task. This paper presents the formal specification language LFC, which is designed to facilitate the acquisition and validation of formal specifications. LFC uses context-free languages for syntactic aspect and relies on a new kind of recursive functions, i.e. recursive functions on context-free languages, for semantic aspect of specifications. Construction and validation of LFC specifications are machine-aided. The basic ideas behind LFC, the main aspects of LFC, and the use of LFC and illustrative examples are described.

on string languages generated by spiking neural p systems

We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated by that system. Although the "direct" generative capacity of spiking neural P systems is rather restricted (some very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems.