The Monocarboxylate Transporter 8 and L-Type Amino Acid Transporters 1 and 2 Are Expressed in Mouse Skeletons and in Osteoblastic MC3T3-E1 Cells

Background: Several plasma membrane transporters have been shown to mediate the cellular influx and/or efflux of iodothyronines, including the sodium-independent organic anion co-transporting polypeptide 1 (OATP1), the sodium taurocholate co-transporting polypeptide (NTCP), the L-type amino acid transporter 1 (LAT1) and 2 (LAT2), and the monocarboxylate transporter 8 (MCT8). The aim of this study was to investigate if the mRNAs of these transporters were expressed and regulated by thyroid hormone (TH) in mouse calvaria-derived osteoblastic MC3T3-E1 cells and in the fetal and postnatal bones of mice. Methods: The mRNA expression of the iodothyronine transporters was investigated with real-time polymerase chain reaction analysis in euthyroid and hypothyroid fetuses and litters of mice and in MC3T3-E1 cells treated with increasing doses of triiodothyronine (T(3); 10(-10) to 10(-6) M) or with 10(-8) M T(3) for 1-9 days. Results: MCT8, LAT1, and LAT2 mRNAs were detected in fetal and postnatal femurs and in MC3T3-E1 cells, while OATP1 and NTCP mRNAs were not. LAT1 and LAT2 mRNAs were not affected by TH status in vivo or in vitro or by the stage of bone development or osteoblast maturation (analyzed by the expression of osteocalcin and alkaline phosphatase, which are key markers of osteoblastic differentiation). In contrast, the femoral mRNA expression of MCT8 decreased significantly during post-natal development, whereas MCT8 mRNA expression increased as MC3T3-E1 cells differentiated. We also showed that MCT8 mRNA was up-regulated in the femur of hypothyroid animals, and that it was down-regulated by treatment with T(3) in MC3T3-E1 cells. Conclusions: This is the first study to demonstrate the mRNA expression of LAT1, LAT2, and MCT8 in the bone tissue of mice and in osteoblast-like cells. In addition, the pattern of MCT8 expression observed in vivo and in vitro suggests that MCT8 may be important to modulate TH effects on osteoblast differentiation and on bone development and metabolism.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

Associated skeletons of a new middle Triassic ""Rauisuchia"" from Brazil

For more than 30 million years, in early Mesozoic Pangea, ""rauisuchian"" archosaurs were the apex predators in most terrestrial ecosystems, but their biology and evolutionary history remain poorly understood. We describe a new ""rauisuchian"" based on ten individuals found in a single locality from the Middle Triassic (Ladinian) Santa Maria Formation of southern Brazil. Nine articulated and associated skeletons were discovered, three of which have nearly complete skulls. Along with sedimentological and taphonomic data, this suggests that those highly successful predators exhibited some kind of intraspecific interaction. Other monotaxic assemblages of Triassic archosaurs are Late Triassic (Norian-Rhaetian) in age, approximately 10 million years younger than the material described here. Indeed, the studied assemblage may represent the earliest evidence of gregariousness among archosaurs, adding to our knowledge on the origin of a behavior pattern typical of extant taxa.

TOWARD SEMANTIC WEB SERVICES AS MVC APPLICATIONS: FROM OWL-S VIA UML

OWL-S is an application of OWL, the Web Ontology Language, that describes the semantics of Web Services so that their discovery, selection, invocation and composition can be automated. The research literature reports the use of UML diagrams for the automatic generation of Semantic Web Service descriptions in OWL-S. This paper demonstrates a higher level of automation by generating complete complete Web applications from OWL-S descriptions that have themselves been generated from UML. Previously, we proposed an approach for processing OWL-S descriptions in order to produce MVC-based skeletons for Web applications. The OWL-S ontology undergoes a series of transformations in order to generate a Model-View-Controller application implemented by a combination of Java Beans, JSP, and Servlets code, respectively. In this paper, we show in detail the documents produced at each processing step. We highlight the connections between OWL-S specifications and executable code in the various Java dialects and show the Web interfaces that result from this process.

Objective characterization of the course of the parasellar internal carotid artery using mathematical tools

Background Along the internal carotid artery (ICA), atherosclerotic plaques are often located in its cavernous sinus (parasellar) segments (pICA). Studies indicate that the incidence of pre-atherosclerotic lesions is linked with the complexity of the pICA; however, the pICA shape was never objectively characterized. Our study aims at providing objective mathematical characterizations of the pICA shape. Methods and results Three-dimensional (3D) computer models, reconstructed from contrast enhanced computed tomography (CT) data of 30 randomly selected patients (60 pICAs) were analyzed with modern visualization software and new mathematical algorithms. As objective measures for the pICA shape complexity, we provide calculations of curvature energy, torsion energy, and total complexity of 3D skeletons of the pICA lumen. We further measured the posterior knee of the so-called ""carotid siphon"" with a virtual goniometer and performed correlations between the objective mathematical calculations and the subjective angle measurements. Conclusions Firstly, our study provides mathematical characterizations of the pICA shape, which can serve as objective reference data for analyzing connections between pICA shape complexity and vascular diseases. Secondly, we provide an objective method for creating Such data. Thirdly, we evaluate the usefulness of subjective goniometric measurements of the angle of the posterior knee of the carotid siphon.

Experimental micromorphology in Tierra del Fuego (Argentina): building a reference collection for the study of shell middens in cold climates

Commonly used in archaeological contexts, micromorphology did not see a parallel advance in the field of experimental archaeology. Drawing from early work conducted in the 1990`s on ethnohistoric sites in the Beagle Channel, we analyze a set of 25 thin sections taken from control features and experimental tests. The control features include animal pathways and environmental contexts (beach samples, forest litter, soils from the proximities of archaeological sites), while the experimental samples comprise anthropic structures, such as hearths, and valves of Mytilus edulis (the most important component of shell middens in the region) heated from 200 degrees C to 800 degrees C. Their micromorphological study constitutes a modern analogue to assist archaeologists studying site formation and ethnographical settings in cold climates, with particular emphasis on shell midden contexts. (c) 2010 Elsevier Ltd. All rights reserved.

Testing permutation properties through subpermutations

There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this combinatorial structure, by considering only a randomly chosen substructure of sufficiently large, but constant size. These problems are called property testing and parameter testing, where a property or parameter is said to be testable if it can be estimated accurately in this way. The algorithmic appeal is evident, as, conditional on sampling, this leads to reliable constant-time randomized estimators. Our paper addresses property testing and parameter testing for permutations in a subpermutation perspective; more precisely, we investigate permutation properties and parameters that can be well approximated based on a randomly chosen subpermutation of much smaller size. In this context, we use a theory of convergence of permutation sequences developed by the present authors [C. Hoppen, Y. Kohayakawa, C.G. Moreira, R.M. Sampaio, Limits of permutation sequences through permutation regularity, Manuscript, 2010, 34pp.] to characterize testable permutation parameters along the lines of the work of Borgs et al. [C. Borgs, J. Chayes, L Lovasz, V.T. Sos, B. Szegedy, K. Vesztergombi, Graph limits and parameter testing, in: STOC`06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 261-270.] in the case of graphs. Moreover, we obtain a permutation result in the direction of a famous result of Alon and Shapira [N. Alon, A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, SIAM J. Comput. 37 (6) (2008) 1703-1727.] stating that every hereditary graph property is testable. (C) 2011 Elsevier B.V. All rights reserved.

Repetition-free longest common subsequence

We study the following problem. Given two sequences x and y over a finite alphabet, find a repetition-free longest common subsequence of x and y. We show several algorithmic results, a computational complexity result, and we describe a preliminary experimental study based on the proposed algorithms. We also show that this problem is APX-hard. (C) 2009 Elsevier B.V. All rights reserved.

Computer-aided Structure Elucidation of Neolignans

This paper describes a new module of the expert system SISTEMAT used for the prediction of the skeletons of neolignans by (13)C NMR, (1)H NMR and botanical data obtained from the literature. SISTEMAT is composed of MACRONO, SISCONST, C13MACH, H1MACH and SISOCBOT programs, each analyzing data of the neolignan in question to predict the carbon skeleton of the compound. From these results, the global probability is computed and the most probable skeleton predicted. SISTEMAT predicted the skeletons of 75% of the 20 neolignans tested, in a rapid and simple procedure demonstrating its advantage for the structural elucidation of new compounds.

New Improvements in Automatic Structure Elucidation Using the LSD (Logic for Structure Determination) and the SISTEMAT Expert Systems

This article describes the integration of the LSD (Logic for Structure Determination) and SISTEMAT expert systems that were both designed for the computer-assisted structure elucidation of small organic molecules. A first step has been achieved towards the linking of the SISTEMAT database with the LSD structure generator. The skeletal descriptions found by the SISTEMAT programs are now easily transferred to LSD as substructural constraints. Examples of the synergy between these expert systems are given for recently reported natural products.

C-glycosyl flavones from Peperomia blanda

The methanol extract from aerial parts of the Peperomia blanda (Piperaceae) yielded two C-glycosyl-flavones. Their structures were elucidated on the basis of extensive spectroscopic analysis, including 1D and 2D NMR, chemical transformation and comparison with the related known compounds. The structure of the new flavonoids were established as 4`-methoxy-vitexin 7-O-beta-D-xylopyranoside (1) (7-O-beta-D-xylopyranosyl-8-C-beta-D-glucopyranosyl-4`-methoxy-apigenin) and vicenin-2 (2). The antioxidant activity of both compounds was investigated using the DPPH assay. Both compounds showed only modest activity, with IC50 values of 357.2 mu M for 1, and 90.5 mu M for 2. (C) 2008 Elsevier B.V. All rights reserved.

Use of self-organizing maps and molecular descriptors to predict the cytotoxic activity of sesquiterpene lactones

Some sesquiterpene lactones (SLs) are the active compounds of a great number of traditionally medicinal plants from the Asteraceae family and possess considerable cytotoxic activity. Several studies in vitro have shown the inhibitory activity against cells derived from human carcinoma of the nasopharynx (KB). Chemical studies showed that the cytotoxic activity is due to the reaction of alpha,beta-unsaturated carbonyl structures of the SLs with thiols, such as cysteine. These studies support the view that SLs inhibit tumour growth by selective alkylation of growth-regulatory biological macromolecules, such as key enzymes, which control cell division, thereby inhibiting a variety of cellular functions, which directs the cells into apoptosis. In this study we investigated a set of 55 different sesquiterpene lactones, represented by 5 skeletons (22 germacranolides, 6 elemanolides, 2 eudesmanolides, 16 guaianolides and nor-derivatives and 9 pseudoguaianolides), in respect to their cytotoxic properties. The experimental results and 3D molecular descriptors were submitted to Kohonen self-organizing map (SOM) to classify (training set) and predict (test set) the cytotoxic activity. From the obtained results, it was concluded that only the geometrical descriptors showed satisfactory values. The Kohonen map obtained after training set using 25 geometrical descriptors shows a very significant match, mainly among the inactive compounds (similar to 84%). Analyzing both groups, the percentage seen is high (83%). The test set shows the highest match, where 89% of the substances had their cytotoxic activity correctly predicted. From these results, important properties for the inhibition potency are discussed for the whole dataset and for subsets of the different structural skeletons. (C) 2008 Elsevier Masson SAS. All rights reserved.

Computer-Assisted Approach to Structural Elucidation of Lignans

This paper reports an expert system (SISTEMAT) developed for structural determination of diverse chemical classes of natural products, including lignans, based mainly on 13C NMR and 1H NMR data of these compounds. The system is composed of five programs that analyze specific data of a lignan and shows a skeleton probability for the compound. At the end of analyses, the results are grouped, the global probability is computed, and the most probable skeleton is exhibited to the user. SISTEMAT was able to properly predict the skeletons of 80% of the 30 lignans tested, demonstrating its advantage during the structural elucidation course in a short period of time.