BOOL-AN: A method for comparative sequence analysis and phylogenetic reconstruction

A novel discrete mathematical approach is proposed as an additional tool for molecular systematics which does not require prior statistical assumptions concerning the evolutionary process. The method is based on algorithms generating mathematical representations directly from DNA/RNA or protein sequences, followed by the output of numerical (scalar or vector) and visual characteristics (graphs). The binary encoded sequence information is transformed into a compact analytical form, called the Iterative Canonical Form (or ICF) of Boolean functions, which can then be used as a generalized molecular descriptor. The method provides raw vector data for calculating different distance matrices, which in turn can be analyzed by neighbor-joining or UPGMA to derive a phylogenetic tree, or by principal coordinates analysis to get an ordination scattergram. The new method and the associated software for inferring phylogenetic trees are called the Boolean analysis or BOOL-AN

Getting Feasible Variable Estimates From Infeasible Ones: MRF Local Polytope Study

This paper proposes a method for construction of approximate feasible primal solutions from dual ones for large-scale optimization problems possessing certain separability properties. Whereas infeasible primal estimates can typically be produced from (sub-)gradients of the dual function, it is often not easy to project them to the primal feasible set, since the projection itself has a complexity comparable to the complexity of the initial problem. We propose an alternative efficient method to obtain feasibility and show that its properties influencing the convergence to the optimum are similar to the properties of the Euclidean projection. We apply our method to the local polytope relaxation of inference problems for Markov Random Fields and demonstrate its superiority over existing methods.Comment: 20 page, 4 figure

Dynamics and Topological Aspects of a Reconstructed Two-Dimensional Foam Time Series Using Potts Model on a Pinned Lattice

We discuss a method to reconstruct an approximate two-dimensional foam structure from an incomplete image using the extended Potts mode with a pinned lattice we introduced in a previous paper. The initial information consists of the positions of the vertices only. We locate the centers of the bubbles using the Euclidean distance-map construction and assign at each vertex position a continuous pinning field with a potential falling off as $1/r$. We nucleate a bubble at each center using the extended Potts model and let the structure evolve under the constraint of scaled target areas until the bubbles contact each other. The target area constraint and pinning centers prevent further coarsening. We then turn the area constraint off and let the edges relax to a minimum energy configuration. The result is a reconstructed structure very close to the simulation. We repeated this procedure for various stages of the coarsening of the same simulated foam and investigated the simulation and reconstruction dynamics, topology and area distribution, finding that they agree to good accuracy.Comment: 31 pages, 20 Postscript figures Accepted in the Journal of Computational Physic