HiPP: A Novel Hierarchical Point Placement Strategy and its Application to the Exploration of Document Collections

Point placement strategies aim at mapping data points represented in higher dimensions to bi-dimensional spaces and are frequently used to visualize relationships amongst data instances. They have been valuable tools for analysis and exploration of data sets of various kinds. Many conventional techniques, however, do not behave well when the number of dimensions is high, such as in the case of documents collections. Later approaches handle that shortcoming, but may cause too much clutter to allow flexible exploration to take place. In this work we present a novel hierarchical point placement technique that is capable of dealing with these problems. While good grouping and separation of data with high similarity is maintained without increasing computation cost, its hierarchical structure lends itself both to exploration in various levels of detail and to handling data in subsets, improving analysis capability and also allowing manipulation of larger data sets.

Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints

This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed. (C) 2007 Elsevier B.V. All rights reserved.

Thermodynamic characterization of the palm tree Roystonea regia peroxidase stability

The structural stability of a peroxidase, a dimeric protein from royal palm tree (Roystonea regia) leaves, has been characterized by high-sensitivity differential scanning calorimetry, circular dichroism, steady-state tryptophan fluorescence and analytical ultracentifugation under different solvent conditions. It is shown that the thermal and chemical (using guanidine hydrochloride (Gdn-HCl)) folding/unfolding of royal palm tree peroxidase (RPTP) at pH 7 is a reversible process involving a highly cooperative transition between the folded dimer and unfolded monomers, with a free stabilization energy of about 23 kcal per mol of monomer at 25 degrees C. The structural stability of RPTP is pH-dependent. At pH 3, where ion pairs have disappeared due to protonation, the thermally induced denaturation of RPTP is irreversible and strongly dependent upon the scan rate, suggesting that this process is under kinetic control. Moreover, thermally induced transitions at this pH value are dependent on the protein concentration, allowing it to be concluded that in solution RPTP behaves as dimer, which undergoes thermal denaturation coupled with dissociation. Analysis of the kinetic parameters of RPTP denaturation at pH 3 was accomplished on the basis of the simple kinetic scheme N ->(k) D, where k is a first-order kinetic constant that changes with temperature, as given by the Arrhenius equation; N is the native state, and D is the denatured state, and thermodynamic information was obtained by extrapolation of the kinetic transition parameters to an infinite heating rate. Obtained in this way, the value of RPTP stability at 25 degrees C is ca. 8 kcal per mole of monomer lower than at pH 7. In all probability, this quantity reflects the contribution of ion pair interactions to the structural stability of RPTP. From a comparison of the stability of RPTP with other plant peroxidases it is proposed that one of the main factors responsible for the unusually high stability of RPTP which enhances its potential use for biotechnological purposes, is its dimerization. (c) 2008 Elsevier Masson SAS. All rights reserved.

Crystal structure and statistical coupling analysis of highly glycosylated peroxidase from royal palm tree (Roystonea regia)

Royal palm tree peroxidase (RPTP) is a very stable enzyme in regards to acidity, temperature, H(2)O(2), and organic solvents. Thus, RPTP is a promising candidate for developing H(2)O(2)-sensitive biosensors for diverse applications in industry and analytical chemistry. RPTP belongs to the family of class III secretory plant peroxidases, which include horseradish peroxidase isozyme C, soybean and peanut peroxidases. Here we report the X-ray structure of native RPTP isolated from royal palm tree (Roystonea regia) refined to a resolution of 1.85 angstrom. RPTP has the same overall folding pattern of the plant peroxidase superfamily, and it contains one heme group and two calcium-binding sites in similar locations. The three-dimensional structure of RPTP was solved for a hydroperoxide complex state, and it revealed a bound 2-(N-morpholino) ethanesulfonic acid molecule (MES) positioned at a putative substrate-binding secondary site. Nine N-glycosylation sites are clearly defined in the RPTP electron-density maps, revealing for the first time conformations of the glycan chains of this highly glycosylated enzyme. Furthermore, statistical coupling analysis (SCA) of the plant peroxidase superfamily was performed. This sequence-based method identified a set of evolutionarily conserved sites that mapped to regions surrounding the heme prosthetic group. The SCA matrix also predicted a set of energetically coupled residues that are involved in the maintenance of the structural folding of plant peroxidases. The combination of crystallographic data and SCA analysis provides information about the key structural elements that could contribute to explaining the unique stability of RPTP. (C) 2009 Elsevier Inc. All rights reserved.

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

Let M = (V, E, A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C = {C(1), ... , C(k)} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is Sigma(k)(i=1) vertical bar C(i)vertical bar. The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small as possible. The Chinese postman problem is: given a strongly connected mixed graph M, find a minimum length closed walk using all edges and arcs of M. These problems are NP-hard. We show that they can be solved in polynomial time if M has bounded tree-width. (C) 2008 Elsevier B.V. All rights reserved.