In vitro centromere and kinetochore assembly on defined chromatin templates

During cell division, chromosomes are segregated to nascent daughter cells by attaching to the microtubules of the mitotic spindle through the kinetochore. Kinetochores are assembled on a specialized chromatin domain called the centromere, which is characterized by the replacement of nucleosomal histone H3 with the histone H3 variant centromere protein A (CENP-A). CENP-A is essential for centromere and kinetochore formation in all eukaryotes but it is unknown how CENP-A chromatin directs centromere and kinetochore assembly. Here we generate synthetic CENP-A chromatin that recapitulates essential steps of centromere and kinetochore assembly in vitro. We show that reconstituted CENP-A chromatin when added to cell-free extracts is sufficient for the assembly of centromere and kinetochore proteins, microtubule binding and stabilization, and mitotic checkpoint function. Using chromatin assembled from histone H3/CENP-A chimaeras, we demonstrate that the conserved carboxy terminus of CENP-A is necessary and sufficient for centromere and kinetochore protein recruitment and function but that the CENP-A targeting domain--required for new CENP-A histone assembly--is not. These data show that two of the primary requirements for accurate chromosome segregation, the assembly of the kinetochore and the propagation of CENP-A chromatin, are specified by different elements in the CENP-A histone. Our unique cell-free system enables complete control and manipulation of the chromatin substrate and thus presents a powerful tool to study centromere and kinetochore assembly.     

A comparison of two approaches to fitting directed graphs to nonsymmetric proximity measures

Two algorithms for fitting directed graphs to nonsymmetric proximity data are compared. The first approach, termed MAPNET, is a direct extension of a mathematical programming procedure for fitting undirected graphs to symmetric proximity data presented by Klauer and Carroll (1989). For a user-specified number of links, the algorithm seeks to provide the connected network that gives the least-squares approximation of the proximity data with the specified number of links, allowing for linear transformations of the data. The mathematical programming approach is compared to the NETSCAL method for fitting directed graphs (Hutchinson 1989), using the Monte Carlo methods and data sets employed by Hutchinson.     

The representation of three-way proximity data by single and multiple tree structure models

Models for the representation of proximity data (similarities/dissimilarities) can be categorized into one of three groups of models: continuous spatial models, discrete nonspatial models, and hybrid models (which combine aspects of both spatial and discrete models). Multidimensional scaling models and associated methods, used for thespatial representation of such proximity data, have been devised to accommodate two, three, and higher-way arrays. At least one model/method for overlapping (but generally non-hierarchical) clustering called INDCLUS (Carroll and Arabie 1983) has been devised for the case of three-way arrays of proximity data. Tree-fitting methods, used for thediscrete network representation of such proximity data, have only thus far been devised to handle two-way arrays. This paper develops a new methodology called INDTREES (for INdividual Differences in TREE Structures) for fitting various(discrete) tree structures to three-way proximity data. This individual differences generalization is one in which different individuals, for example, are assumed to base their judgments on the same family of trees, but are allowed to have different node heights and/or branch lengths.We initially present an introductory overview focussing on existing two-way models. The INDTREES model and algorithm are then described in detail. Monte Carlo results for the INDTREES fitting of four different three-way data sets are presented. In the application, a single ultrametric tree is fitted to three-way proximity data derived from intention-to-buy-data for various brands of over-the-counter pain relievers for relieving three common types of maladies. Finally, we briefly describe how the INDTREES procedure can be extended to accommodate hybrid modelling, as well as to handle other types of applications.     

Correlation between a DNA restriction fragment length polymorphism and C4A6 protein

The fourth component of complement (C4) in man, is coded for by two separate but closely linked loci (C4A and C4B) within the major histocompatibility region (MHC), on the short arm of chromosome 6. Like class I and II loci of this region, the C4 genes are highly polymorphic with more than 30 alleles, including null alleles, assigned to the two loci. This extensive polymorphism, based mainly on electrophoretic mobility, provides a useful marker for studies of disease susceptibility. Several disorders, including systemic lupus erythematosus and type I diabetes, show associations with C4 phenotypes. We have used the technique of Southern with a C4 specific probe to examine the genomic DNA of individuals typed for C4 by protein electrophoresis. We have identified 10.7 and 3.8 kilobase (kb) BglII restriction fragments in each of 9 unrelated individuals with a C4A6 allele, and in none of 22 unrelated individuals in whom this allele was not expressed. This clear correlation of restriction fragment length polymorphism with C4 phenotype provides a precise basis for analysis of C4 polymorphism. It is likely to be of value in clinical investigations of autoimmune disease.     

Development,plasticity and evolution of butterfly eyespot patterns

The developmental and genetic bases for the formation, plasticity and diversity of eyespot patterns in butterflies are examined. Eyespot pattern mutants, regulatory gene expression, and transplants of the eyespot developmental organizer demonstrate that eyespot position, number, size and colour are determined progressively in a developmental pathway largely uncoupled from those regulating other wing-pattern elements and body structures. Species comparisons and selection experiments suggest that the evolution of eyespot patterns can occur rapidly through modulation of different stages of this pathway, and requires only single, or very few, changes in regulatory genes.     

Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm

This paper presents the development of a new methodology which simultaneously estimates in a least-squares fashion both an ultrametric tree and respective variable weightings for profile data that have been converted into (weighted) Euclidean distances. We first review the relevant classification literature on this topic. The new methodology is presented including the alternating least-squares algorithm used to estimate the parameters. The method is applied to a synthetic data set with known structure as a test of its operation. An application of this new methodology to ethnic group rating data is also discussed. Finally, extensions of the procedure to model additive, multiple, and three-way trees are mentioned.The first author is supported as Bevoegdverklaard Navorser of the Belgian Nationaal Fonds voor Wetenschappelijk Onderzoek.