ﻻ يوجد ملخص باللغة العربية
In the small phylogeny problem we, are given a phylogenetic tree and gene orders of the extant species and our goal is to reconstruct all of the ancestral genomes so that the number of evolutionary operations is minimized. Algorithms for reconstructing evolutionary history from gene orders are usually based on repeatedly computing medians of genomes at neighbouring vertices of the tree. We propose a new, more general approach, based on an iterative local optimization procedure. In each step, we propose candidates for ancestral genomes and choose the best ones by dynamic programming. We have implemented our method and used it to reconstruct evolutionary history of 16 yeast mtDNAs and 13 Campanulaceae cpDNAs.
Optimally selecting a subset of targets from a larger catalog is a common problem in astronomy and cosmology. A specific example is the selection of targets from an imaging survey for multi-object spectrographic follow-up. We present a new heuristic
We address the Merton problem of maximizing the expected utility of terminal wealth using techniques from variational analysis. Under a general continuous semimartingale market model with stochastic parameters, we obtain a characterization of the opt
A great variety of complex physical, natural and artificial systems are governed by statistical distributions, which often follow a standard exponential function in the bulk, while their tail obeys the Pareto power law. The recently introduced $kappa
We point out that in theories where the gravitino mass, $M_{3/2}$, is in the range (10-50)TeV, with soft-breaking scalar masses and trilinear couplings of the same order, there exists a robust region of parameter space where the conditions for electr
Given the Thomas-Fermi equation sqrt(x)phi=phi*(3/2), this paper changes first the dependent variable by defining y(x)=sqrt(x phi(x)). The boundary conditions require that y(x) must vanish at the origin as sqrt(x), whereas it has a fall-off behaviour