Peeling phylogenetic ‘oranges’

We investigate the combinatorics of a topological space that is generated by the set of edge-weighted finite trees. This space arises by multiplying the weights of edges on paths in trees and is closely connected to tree reconstruction problems involving finite state Markov processes. We show that this space is a contractible finite CW-complex whose face poset can be described via a partial order on semilabelled forests. We then describe some combinatorial properties of this poset, showing that, for example, it is pure, thin and contractible.     

Use of anion-exchange high-performance liquid chromatography for the study of smooth muscle myosin light-chain kinase and its catalytic domain

Avian myosin light-chain kinase from smooth muscle of the gizzard and its catalytic domain, derived from the intact enzyme by trypsin digestion, was purified within 30-40 min by both analytical and preparative anion-exchange high-performance liquid chromatography. The proteins obtained were more than 95% pure and retained their biological activity. The high-performance anion-exchange chromatography protocols represent a significant decrease in purification time when compared with conventional ion-exchange chromatography.     

Synthesis of polynitrogenated analogues of glucopyranoses from levoglucosan

Polynitrogenated analogues of glucopyranoses were synthesised from levoglucosan. These compounds are useful intermediates for the synthesis of new aminoglycoside mimetics.     

First synthesis of arylpyrrolo- and pyrazolopyrrolizinones as useful agents with potential biological interest

Novel arylpyrrolo- and pyrazolopyrrolizinones were prepared in three or four steps starting from aminoarylpyrrole and pyrazole carboxylates through the cyclisation of a Vilsmeier-Haack intermediate. This synthesis was enhanced by diverse N-protections of the aza-heterocycle and furnish new series with potential biological interest.     

COSEARCH: A Parallel Cooperative Metaheuristic

In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.