PHYLOGENETIC-RELATIONSHIPS OF MACAQUES AS INFERRED FROM RESTRICTION-ENDONUCLEASE ANALYSIS OF MITOCHONDRIAL-DNA

Mitochondrial DNAs (mtDNAs) purified from 25 samples of 6 species of macaques, Macaca mulatta, M. fascicularis, M. arctoides, M. nemestrina, M. assamensis and M. thibetana, were analyzed to study the phyletic relationships among the species. A total of 36-46 sites was observed in each sample. By combining the cleavage patterns for each of the endonucleases, the 25 samples were classified into 11 restriction types. When data on M. fuscata and M. cyclopis collected by other authors were added to our own, the resultant molecular phylogenetic trees indicated that the 8 species may be divided into 4 groups: (1) M. mulatta, M. fuscata, M. cyclopis and M. fascicularis; (2) M. arctoides, (3) M. nemestrina; (4) M. assamensis and M. thibetana. Our results suggest that within both the fascicularis and sinica groups genetic distances are small between members and that the status of the species within the groups may require further investigation.

PHYLOGENY OF THE SLOW LORISES (GENUS NYCTICEBUS) - AN APPROACH USING MITOCHONDRIAL-DNA RESTRICTION ENZYME ANALYSIS

Mitochondrial DNA polymorphisms in 15 specimens of three species of slow lorises-Nycticebus coucang, N. intermedius, and N. pygmaeus-were analyzed in order to study the evolutionary relationships among the species. Eight restriction types were observed in the samples. Phylogenetic trees constructed on the basis of genetic distances showed that the slow lorises sort into two clusters: four types of N. coucang and three types of N. intermedius plus one type of N. pygmaeus. Our results suggest that there are two valid species in the genus Nycticebus-N. coucang and N. pygmaeus-and that N. intermedius should be included within N. pygmaeus. Divergence between the two species may have begun 2.7 Ma (million years ago). Evolution of gross morphology, chromosomes, and mitochondrial DNA in the slow lorises appears to be concordant.

Phylogenetic relationships of five pika species (genus Ochotona) based on mitochondrial DNA restriction maps

Restriction site mapping of mitochondrial DNA (mtDNA) with 16 restriction endonucleases was used to examine the phylogenetic relationships of Ochotona cansus, O. huangensis, O. thibetana, O. curzoniae and O. erythrotis. A 1-kb length variation between O. erythrotis of subgenus Pika and other four species of subgenus Ochotona was observed, which may be a useful genetic marker for identifying the two subgenera. The phylogenetic tree constructed using PAUP based on 61 phylogenetically informative sites suggests that O. erythrotis diverged first, followed by O. cansus, while O. curzoniae and O. huangensis are sister taxa related to O. thibetana, The results indicate that both O. cansus and O. huangensis should be treated as independent species. If the base substitution rate of pikas mtDNA was 2% per million years, then the divergence time of the two subgenera, Pika and Ochotana, is about 8.8 Ma ago of late Miocence, middle Bao-dian of Chinese mammalian age, and the divergence of the four species in subgenus Ochotona would have occurred about 2.5 - 4.2 Ma ago, Yushean of Chinese mammalian age. This calculation appears to be substantiated by the fossil record.

Phylogeny of Muntiacus (Cervidae) based on mitochondrial DNA restriction maps

Mitochondrial DNA restriction maps for 12 restriction enzymes of four species of muntjacs-Indian muntjac (M. muntjak), Gongshan muntjac (M. gongshanensis), black muntjac (M. crinifrons), and Chinese muntjac (M. reevesi)-were compared to estimate the phylogenetic relationships among them. Phylogenetic trees were constructed by both distance and parsimony methods. The two resulting trees share a similar topology, which indicates that the black muntjac and the Gongshan muntjac are closely related, followed by the Chinese muntjac; the Indian muntjac is the sister taxon to all the other muntjacs.

RESTRICTION-ENDONUCLEASE ANALYSIS OF MITOCHONDRIAL-DNA OF MUNTJACS AND RELATED DEER

Twelve restriction endonucleases were employed to analyze the mitochondrial DNA of four species of muntjacs and two related species of deer: red muntjac (M. muntjak), Gongshan muntjac (M. gongshanensis), black muntjac (M. crinifrons), Chinese muntjac (M. reevesi), tufted deer (Elaphodus cephalophus), and forest musk deer (Moschus berezovskii). A total of 170 restriction fragments were detected among the samples. Fragments data were used to calculate the genetic distance (i.e. percent sequence divergency) among species, which in turn were used to construct a phylogenetic tree and to estimate divergency times. Our analysis indicates that the black muntjac and the Gongshan muntjac are most closely related, and that they are closely realted to the red muntjac and the Chinese muntjac. Additionally, the tufted deer is genetically closer to muntjacs than the musk deer is.

Assessment of visibility restriction mechanisms for RFID data Discovery Services

RFID is a technology that enables the automated capture of observations of uniquely identified physical objects as they move through supply chains. Discovery Services provide links to repositories that have traceability information about specific physical objects. Each supply chain party publishes records to a Discovery Service to create such links and also specifies access control policies to restrict who has visibility of link information, since it is commercially sensitive and could reveal inventory levels, flow patterns, trading relationships, etc. The requirement of being able to share information on a need-to-know basis, e.g. within the specific chain of custody of an individual object, poses a particular challenge for authorization and access control, because in many supply chain situations the information owner might not have sufficient knowledge about all the companies who should be authorized to view the information, because the path taken by an individual physical object only emerges over time, rather than being fully pre-determined at the time of manufacture. This led us to consider novel approaches to delegate trust and to control access to information. This paper presents an assessment of visibility restriction mechanisms for Discovery Services capable of handling emergent object paths. We compare three approaches: enumerated access control (EAC), chain-of-communication tokens (CCT), and chain-of-trust assertions (CTA). A cost model was developed to estimate the additional cost of restricting visibility in a baseline traceability system and the estimates were used to compare the approaches and to discuss the trade-offs. © 2012 IEEE.

Beyond niche thinking: Market selection in science-based ventures

Matching a new technology to an appropriate market is a major challenge for new technology-based firms (NTBF). Such firms are often advised to target niche-markets where the firms and their technologies can establish themselves relatively free of incumbent competition. However, technologies are diverse in nature and do not benefit from identical strategies. In contrast to many Information and Communication Technology (ICT) innovations which build on an established knowledge base for fairly specific applications, technologies based on emerging science are often generic and so have a number of markets and applications open to them, each carrying considerable technological and market uncertainty. Each of these potential markets is part of a complex and evolving ecosystem from which the venture may have to access significant complementary assets in order to create and sustain commercial value. Based on dataset and case study research on UK advanced material university spin-outs (USO), we find that, contrary to conventional wisdom, the more commercially successful ventures were targeting mainstream markets by working closely with large, established competitors during early development. While niche markets promise protection from incumbent firms, science-based innovations, such as new materials, often require the presence, and participation, of established companies in order to create value. © 2012 IEEE.

Identification of Cj1051c as a Major determinant for the restriction barrier of Campylobacter jejuni StrainNCTC11168

Campylobacter jejuni is a leading cause of human diarrheal illness in the world, and research on it has benefitted greatly by the completion of several genome sequences and the development of molecular biology tools. However, many hurdles remain for a full understanding of this unique bacterial pathogen. One of the most commonly used strains for genetic work with C. jejuni is NCTC11168. While this strain is readily transformable with DNA for genomic recombination, transformation with plasmids is problematic. In this study, we have identified a determinant of this to be cj1051c, predicted to encode a restriction-modification type IIG enzyme. Knockout mutagenesis of this gene resulted in a strain with a 1,000-fold-enhanced transformation efficiency with a plasmid purified from a C. jejuni host. Additionally, this mutation conferred the ability to be transformed by plasmids isolated from an Escherichia coli host. Sequence analysis suggested a high level of variability of the specificity domain between strains and that this gene may be subject to phase variation. We provide evidence that cj1051c is active in NCTC11168 and behaves as expected for a type IIG enzyme. The identification of this determinant provides a greater understanding of the molecular biology of C. jejuni as well as a tool for plasmid work with strain NCTC11168. © 2012, American Society for Microbiology.

Solving MIN UR problem by triangle evolution algorithm with archiving and niche techniques

In this paper, as an extension of minimum unsatisfied linear relations problem (MIN ULR), the minimum unsatisfied relations (MIN UR) problem is investigated. A triangle evolution algorithm with archiving and niche techniques is proposed for MIN UR problem. Different with algorithms in literature, it solves MIN problem directly, rather than transforming it into many sub-problems. The proposed algorithm is also applicable for the special case of MIN UR, in which it involves some mandatory relations. Numerical results show that the algorithm is effective for MIN UR problem and it outperforms Sadegh's algorithm in sense of the resulted minimum inconsistency number, even though the test problems are linear.