FROM TRISECTIONS IN MODULE CATEGORIES TO QUASI-DIRECTED COMPONENTS

In this paper, we define and study a special type of trisections in a module category, namely the compact trisections which characterize quasi-directed components. We apply this notion to the study of laura algebras and we use it to define a class of algebras with predictable Auslander-Reiten components.

Designing Novel Antitrypanosomal Agents from a Mixed Graph-Theoretical Substructural Approach

Chagas disease is nowadays the most serious parasitic health problem. This disease is caused by Trypanosoma cruzi. The great number of deaths and the insufficient effectiveness of drugs against this parasite have alarmed the scientific community worldwide. In an attempt to overcome this problem, a model for the design and prediction of new antitrypanosomal agents was obtained. This used a mixed approach, containing simple descriptors based on fragments and topological substructural molecular design descriptors. A data set was made up of 188 compounds, 99 of them characterized an antitrypanosomal activity and 88 compounds that belong to other pharmaceutical categories. The model showed sensitivity, specificity and accuracy values above 85%. Quantitative fragmental contributions were also calculated. Then, and to confirm the quality of the model, 15 structures of molecules tested as antitrypanosomal compounds (that we did not include in this study) were predicted, taking into account the information on the abovementioned calculated fragmental contributions. The model showed an accuracy of 100% which means that the ""in silico"" methodology developed by our team is promising for the rational design of new antitrypanosomal drugs. (C) 2009 Wiley Periodicals, Inc. J Comput Chem 31: 882-894. 2010

Calculating Flash Point Numbers from Molecular Structure: An Improved Method for Predicting the Flash Points of Acyclic Alkanes

We report a novel method for calculating flash points of acyclic alkanes from flash point numbers, N(FP), which can be calculated from experimental or calculated boiling point numbers (Y(BP)) with the equation N(FP) = 1.020Y(BP) - 1.083 Flash points (FP) are then determined from the relationship FP(K) = 23.369N(FP)(2/3) + 20.010N(FP)(1/3) + 31.901 For it data set of 102 linear and branched alkanes, the correlation of literature and predicted flash points has R(2) = 0.985 and an average absolute deviation of 3.38 K. N(FP) values can also be estimated directly from molecular structure to produce an even closer correspondence of literature and predicted FP values. Furthermore, N(FP) values provide a new method to evaluate the reliability of literature flash point data.

Design of novel antituberculosis compounds using graph-theoretical and substructural approaches

The increasing resistance of Mycobacterium tuberculosis to the existing drugs has alarmed the worldwide scientific community. In an attempt to overcome this problem, two models for the design and prediction of new antituberculosis agents were obtained. The first used a mixed approach, containing descriptors based on fragments and the topological substructural molecular design approach (TOPS-MODE) descriptors. The other model used a combination of two-dimensional (2D) and three-dimensional (3D) descriptors. A data set of 167 compounds with great structural variability, 72 of them antituberculosis agents and 95 compounds belonging to other pharmaceutical categories, was analyzed. The first model showed sensitivity, specificity, and accuracy values above 80% and the second one showed values higher than 75% for these statistical indices. Subsequently, 12 structures of imidazoles not included in this study were designed, taking into account the two models. In both cases accuracy was 100%, showing that the methodology in silico developed by us is promising for the rational design of antituberculosis drugs.

Directed Differentiation of Neural Progenitors into Neurons Is Accompanied by Altered Expression of P2X Purinergic Receptors

Neural differentiation has been extensively studied in vitro in a model termed neurospheres, which consists of aggregates of neural progenitor cells. Previous studies suggest that they have a great potential for the treatment of neurological disorders. One of the major challenges for scientists is to control cell fate and develop ideal culture conditions for neurosphere expansion in vitro, without altering their features. Similar to human neural progenitors, rat neurospheres cultured in the absence of epidermal and fibroblast growth factors for a short period increased the levels of beta-3 tubulin and decreased the expression of glial fibrillary acidic protein and nestin, compared to neurospheres cultured in the presence of these factors. In this work, we show that rat neurospheres cultured in suspension under mitogen-free condition presented significant higher expression of P2X2 and P2X6 receptor subunits, when compared to cells cultured in the presence of growth factors, suggesting a direct relationship between P2X2/6 receptor expression and induction of neuronal differentiation in mitogen-free cultured rat neurospheres.

Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.

From the road network database to a graph for localization purposes

The problems of finding best facility locations require complete and accurate road network with the corresponding population data in a specific area. However the data obtained in road network databases usually do not fit in this usage. In this paper we propose our procedure of converting the road network database to a road graph which could be used in localization problems. The road network data come from the National road data base in Sweden. The graph derived is cleaned, and reduced to a suitable level for localization problems. The population points are also processed in ordered to match with that graph. The reduction of the graph is done maintaining most of the accuracy for distance measures in the network.

Optimization of cable cycles : a trade-off between reliability and cost

This paper elaborates the routing of cable cycle through available routes in a building in order to link a set of devices, in a most reasonable way. Despite of the similarities to other NP-hard routing problems, the only goal is not only to minimize the cost (length of the cycle) but also to increase the reliability of the path (in case of a cable cut) which is assessed by a risk factor. Since there is often a trade-off between the risk and length factors, a criterion for ranking candidates and deciding the most reasonable solution is defined. A set of techniques is proposed to perform an efficient and exact search among candidates. A novel graph is introduced to reduce the search-space, and navigate the search toward feasible and desirable solutions. Moreover, admissible heuristic length estimation helps to early detection of partial cycles which lead to unreasonable solutions. The results show that the method provides solutions which are both technically and financially reasonable. Furthermore, it is proved that the proposed techniques are very efficient in reducing the computational time of the search to a reasonable amount.