Construction of microsatellite linkage maps for Corymbia

The genus Corymbia is closely related to the genus Eucalyptus, and like Eucalyptus contains tree species that are important for sub-tropical forestry. Corymbia's close relationship with Eucalyptus suggests genetic studies in Corymbia should benefit from transfer of genetic information from its more intensively studied relatives. Here we report a genetic map for Corymbia spp. based on microsatellite markers identified de novo in Corymbia sp or transferred from Eucalyptus. A framework consensus map was generated from an outbred F 2 population (n = 90) created by crossing two unrelated Corymbia torelliana x C. citriodora subsp. variegata F1 trees. The map had a total length of 367 cM (Kosambi) and was composed of 46 microsatellite markers distributed across 13 linkage groups (LOD 3). A high proportion of Eucalyptus microsatellites (90%) transferred to Corymbia. Comparative analysis between the Corymbia map and a published Eucalyptus map identified eight homeologous linkage groups in Corymbia with 13 markers mapping on one or both maps. Further comparative analysis was limited by low power to detect linkage due to low genome coverage in Corymbia, however, there was no convincing evidence for chromosomal structural differences because instances of non-synteny were associated with large distances on the Eucalyptus map. Segregation distortion was primarily restricted to a single linkage group and due to a deficit of hybrid genotypes, suggesting that hybrid inviability was one factor shaping the genetic composition of the F2 population in this inter-subgeneric hybrid. The conservation of microsatellite loci and synteny between Corymbia and Eucalyptus suggests there will be substantial value in exchanging information between the two groups.

How accurate are the marker orders in crop linkage maps generated from large marker datasets?

Marker ordering during linkage map construction is a critical component of QTL mapping research. In recent years, high-throughput genotyping methods have become widely used, and these methods may generate hundreds of markers for a single mapping population. This poses problems for linkage analysis software because the number of possible marker orders increases exponentially as the number of markers increases. In this paper, we tested the accuracy of linkage analyses on simulated recombinant inbred line data using the commonly used Map Manager QTX (Manly et al. 2001: Mammalian Genome 12, 930-932) software and RECORD (Van Os et al. 2005: Theoretical and Applied Genetics 112, 30-40). Accuracy was measured by calculating two scores: % correct marker positions, and a novel, weighted rank-based score derived from the sum of absolute values of true minus observed marker ranks divided by the total number of markers. The accuracy of maps generated using Map Manager QTX was considerably lower than those generated using RECORD. Differences in linkage maps were often observed when marker ordering was performed several times using the identical dataset. In order to test the effect of reducing marker numbers on the stability of marker order, we pruned marker datasets focusing on regions consisting of tightly linked clusters of markers, which included redundant markers. Marker pruning improved the accuracy and stability of linkage maps because a single unambiguous marker order was produced that was consistent across replications of analysis. Marker pruning was also applied to a real barley mapping population and QTL analysis was performed using different map versions produced by the different programs. While some QTLs were identified with both map versions, there were large differences in QTL mapping results. Differences included maximum LOD and R-2 values at QTL peaks and map positions, thus highlighting the importance of marker order for QTL mapping

A consensus genetic map of sorghum that integrates multiple component maps and high-throughput Diversity Array Technology (DArT) markers

Background: Sorghum genome mapping based on DNA markers began in the early 1990s and numerous genetic linkage maps of sorghum have been published in the last decade, based initially on RFLP markers with more recent maps including AFLPs and SSRs and very recently, Diversity Array Technology (DArT) markers. It is essential to integrate the rapidly growing body of genetic linkage data produced through DArT with the multiple genetic linkage maps for sorghum generated through other marker technologies. Here, we report on the colinearity of six independent sorghum component maps and on the integration of these component maps into a single reference resource that contains commonly utilized SSRs, AFLPs, and high-throughput DArT markers. Results: The six component maps were constructed using the MultiPoint software. The lengths of the resulting maps varied between 910 and 1528 cM. The order of the 498 markers that segregated in more than one population was highly consistent between the six individual mapping data sets. The framework consensus map was constructed using a "Neighbours" approach and contained 251 integrated bridge markers on the 10 sorghum chromosomes spanning 1355.4 cM with an average density of one marker every 5.4 cM, and were used for the projection of the remaining markers. In total, the sorghum consensus map consisted of a total of 1997 markers mapped to 2029 unique loci ( 1190 DArT loci and 839 other loci) spanning 1603.5 cM and with an average marker density of 1 marker/0.79 cM. In addition, 35 multicopy markers were identified. On average, each chromosome on the consensus map contained 203 markers of which 58.6% were DArT markers. Non-random patterns of DNA marker distribution were observed, with some clear marker-dense regions and some marker-rare regions. Conclusion: The final consensus map has allowed us to map a larger number of markers than possible in any individual map, to obtain a more complete coverage of the sorghum genome and to fill a number of gaps on individual maps. In addition to overall general consistency of marker order across individual component maps, good agreement in overall distances between common marker pairs across the component maps used in this study was determined, using a difference ratio calculation. The obtained consensus map can be used as a reference resource for genetic studies in different genetic backgrounds, in addition to providing a framework for transferring genetic information between different marker technologies and for integrating DArT markers with other genomic resources. DArT markers represent an affordable, high throughput marker system with great utility in molecular breeding programs, especially in crops such as sorghum where SNP arrays are not publicly available.

Pre-maps : An Educational Programme for Reading Tactile Maps

It is demanding for children with visual impairment to become aware of the world beyond their immediate experience. They need to learn to control spatial experiences as a whole and understand the relationships between objects, surfaces and themselves. Tactile maps can be an excellent source of information for depicting space and environment. By means of tactile maps children can develop their spatial understanding more efficiently than through direct travel experiences supplemented with verbal explanations. Tactile maps can help children when they are learning to understand environmental, spatial, and directional concepts. The ability to read tactile maps is not self-evident; it is a skill, which must be learned. The main research question was: can children who are visually impaired learn to read tactile maps at the preschool age if they receive structural teaching? The purpose of this study was to develop an educational program for preschool children with visual impairment, the aim of which was to teach them to read tactile maps in order to strengthen their orientation skills and to encourage them to explore the world beyond their immediate experience. The study is a multiple case study describing the development of the map program consisting of eight learning tasks. The program was developed with one preschooler who was blind, and subsequently the program was implemented with three other children. Two of the children were blind from birth, one child had lost her vision at the age of two, and one child had low vision. The program was implemented in a normal preschool. Another objective of the pre-map program was to teach the preschooler with visual impairment to understand the concept of a map. The teaching tools were simple, map-like representations called pre-maps. Before a child with visual impairment can read a comprehensive tactile map, it is important to learn to understand map symbols, and how a three-dimensional model changes to a two-dimensional tactile map. All teaching sessions were videotaped; the results are based on the analysis of the videotapes. Two of the children completed the program successfully, and learned to read a tactile map. The two other children felt happy during the sessions, but it was problematic for them to engage fully in the instruction. One of the two eventually completed the program, while the other developed predominantly emerging skills. The results of the children's performances and the positive feedback from the teachers, assistants and the parents proved that this pre-map program is appropriate teaching material for preschool children who are visually impaired. The program does not demand high-level expertise; also parents, preschool teachers, and school assistants can carry out the program.

Cover page of a binder for maps of Crimea and Ukraine

Digital image

Composition operators, Aleksandrov measures and value distribution of analytic maps in the unit disc

A composition operator is a linear operator that precomposes any given function with another function, which is held fixed and called the symbol of the composition operator. This dissertation studies such operators and questions related to their theory in the case when the functions to be composed are analytic in the unit disc of the complex plane. Thus the subject of the dissertation lies at the intersection of analytic function theory and operator theory. The work contains three research articles. The first article is concerned with the value distribution of analytic functions. In the literature there are two different conditions which characterize when a composition operator is compact on the Hardy spaces of the unit disc. One condition is in terms of the classical Nevanlinna counting function, defined inside the disc, and the other condition involves a family of certain measures called the Aleksandrov (or Clark) measures and supported on the boundary of the disc. The article explains the connection between these two approaches from a function-theoretic point of view. It is shown that the Aleksandrov measures can be interpreted as kinds of boundary limits of the Nevanlinna counting function as one approaches the boundary from within the disc. The other two articles investigate the compactness properties of the difference of two composition operators, which is beneficial for understanding the structure of the set of all composition operators. The second article considers this question on the Hardy and related spaces of the disc, and employs Aleksandrov measures as its main tool. The results obtained generalize those existing for the case of a single composition operator. However, there are some peculiarities which do not occur in the theory of a single operator. The third article studies the compactness of the difference operator on the Bloch and Lipschitz spaces, improving and extending results given in the previous literature. Moreover, in this connection one obtains a general result which characterizes the compactness and weak compactness of the difference of two weighted composition operators on certain weighted Hardy-type spaces.

Planar pursuit-evasion with variable speeds, part 1, extremal trajectory maps

Pursuit evasion in a plane is formulated with both players allowed to vary their speeds between fixed limits. A suitable choice of real-space coordinates confers open-loop optimality on the game. The solution in the small is described in terms of the individual players'' extremal trajectory maps (ETM). Each map is independent of role, adversary, and capture radius. An ETM depicts the actual real-space trajectories. A template method of generating constant control arcs is described. Examples of ETM for an aircraft flying at a constant altitude with fixed and varying speeds are presented.

Genetic studies of the PRP17 gene of Saccharomyces cerevisiae: a domain essential for function maps to a nonconserved region of the protein

The PRP17 gene product is required for the second step of pre-mRNA splicing reactions. The C-terminal half of this protein bears four repeat units with homology to the beta transducin repeat. Missense mutations in three temperature-sensitive prp17 mutants map to a region in the N-terminal half of the protein. We have generated, in vitro, 11 missense alleles at the beta transducin repeat units and find that only one affects function in vivo. A phenotypically silent missense allele at the fourth repeat unit enhances the slow-growing phenotype conferred by an allele at the third repeat, suggesting an interaction between these domains. Although many missense mutations in highly conserved amino acids lack phenotypic effects, deletion analysis suggests an essential role for these units. Only mutations in the N-terminal nonconserved domain of PRP17 are synthetically lethal in combination with mutations in PRP16 and PRP18, two other gene products required for the second splicing reaction. A mutually allele-specific interaction between Prp17 and snr7, with mutations in U5 snRNA, was observed. We therefore suggest that the functional region of Prp17p that interacts with Prp18p, Prp16p, and U5 snRNA is the N terminal region of the protein.

Semi-supervised learning of WLAN radio maps

In this thesis a manifold learning method is applied to the problem of WLAN positioning and automatic radio map creation. Due to the nature of WLAN signal strength measurements, a signal map created from raw measurements results in non-linear distance relations between measurement points. These signal strength vectors reside in a high-dimensioned coordinate system. With the help of the so called Isomap-algorithm the dimensionality of this map can be reduced, and thus more easily processed. By embedding position-labeled strategic key points, we can automatically adjust the mapping to match the surveyed environment. The environment is thus learned in a semi-supervised way; gathering training points and embedding them in a two-dimensional manifold gives us a rough mapping of the measured environment. After a calibration phase, where the labeled key points in the training data are used to associate coordinates in the manifold representation with geographical locations, we can perform positioning using the adjusted map. This can be achieved through a traditional supervised learning process, which in our case is a simple nearest neighbors matching of a sampled signal strength vector. We deployed this system in two locations in the Kumpula campus in Helsinki, Finland. Results indicate that positioning based on the learned radio map can achieve good accuracy, especially in hallways or other areas in the environment where the WLAN signal is constrained by obstacles such as walls.

Future chemistry teachers use of knowledge dimensions and high-order cognitive skills in pre-laboratory concept maps

This poster describes a pilot case study, which aim is to study how future chemistry teachers use knowledge dimensions and high-order cognitive skills (HOCS) in their pre-laboratory concept maps to support chemistry laboratory work. The research data consisted of 168 pre-laboratory concept maps that 29 students constructed as a part of their chemistry laboratory studies. Concept maps were analyzed by using a theory based content analysis through Anderson & Krathwohls' learning taxonomy (2001). This study implicates that novice concept mapper students use all knowledge dimensions and applying, analyzing and evaluating HOCS to support the pre-laboratory work.

Enhancement of workability in AZ31 alloy-processing maps: Part I,castmaterial

Processing maps developed on the basis of the Dynamic Materials Model provide valuable information that might help the metal working industry in solving problems related to workability and microstructural control in commercial alloys. In this research, the processing maps for an as-cast AZ31 magnesium alloy are presented. The results are validated via microstructural observations, clearly delineating safe and unsafe regimes for further process design of this alloy.

High temperature deformation processing maps for boron modified Ti-6Al-4V alloys

The alloy, Ti-6Al-4V is an alpha + beta Ti alloy that has large prior beta grain size (similar to 2 mm) in the as cast state. Minor addition of B (about 0.1 wt.%) to it refines the grain size significantly as well as produces in-situ TiB needles. The role played by these microstructural modifications on high temperature deformation processing maps of B-modified Ti64 alloys is examined in this paper.Power dissipation efficiency and instability maps have been generated within the temperature range of 750-1000 degrees C and strain rate range of 10(-3)-10(+1) s(-1). Various deformation mechanisms, which operate in different temperature-strain rate regimes, were identified with the aid of the maps and complementary microstructural analysis of the deformed specimens. Results indicate four distinct deformation domains within the range of experimental conditions examined, with the combination of 900-1000 degrees C and 10(-3)-10(-2) s(-1) being the optimum for hot working. In that zone, dynamic globularization of alpha laths is the principle deformation mechanism. The marked reduction in the prior beta grain size, achieved with the addition of B, does not appear to alter this domain markedly. The other domains, with negative values of instability parameter, show undesirable microstructural features such as extensive kinking/bending of alpha laths and breaking of beta laths for Ti64-0.0B as well as generation of voids and cracks in the matrix and TiB needles in the B-modified alloys. (C) 2010 Elsevier B.V. All rights reserved.

Constructing Reeb Graphs using Cylinder Maps

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Arcs in the Reeb graph are computed in the second step using a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The algorithm is also able to handle non-manifold domains.