1,002 research outputs found
Thermally activated interface motion in a disordered ferromagnet
We investigate interface motion in disordered ferromagnets by means of Monte
Carlo simulations. For small temperatures and driving fields a so-called creep
regime is found and the interface velocity obeys an Arrhenius law. We analyze
the corresponding energy barrier as well as the field and temperature
dependence of the prefactor.Comment: accepted for publication in Computer Physics Communication
Assessing the robustness of parsimonious predictions for gene neighborhoods from reconciled phylogenies
The availability of a large number of assembled genomes opens the way to
study the evolution of syntenic character within a phylogenetic context. The
DeCo algorithm, recently introduced by B{\'e}rard et al. allows the computation
of parsimonious evolutionary scenarios for gene adjacencies, from pairs of
reconciled gene trees. Following the approach pioneered by Sturmfels and
Pachter, we describe how to modify the DeCo dynamic programming algorithm to
identify classes of cost schemes that generates similar parsimonious
evolutionary scenarios for gene adjacencies, as well as the robustness to
changes to the cost scheme of evolutionary events of the presence or absence of
specific ancestral gene adjacencies. We apply our method to six thousands
mammalian gene families, and show that computing the robustness to changes to
cost schemes provides new and interesting insights on the evolution of gene
adjacencies and the DeCo model.Comment: Accepted, to appear in ISBRA - 11th International Symposium on
Bioinformatics Research and Applications - 2015, Jun 2015, Norfolk, Virginia,
United State
The genome of the medieval Black Death agent (extended abstract)
The genome of a 650 year old Yersinia pestis bacteria, responsible for the
medieval Black Death, was recently sequenced and assembled into 2,105 contigs
from the main chromosome. According to the point mutation record, the medieval
bacteria could be an ancestor of most Yersinia pestis extant species, which
opens the way to reconstructing the organization of these contigs using a
comparative approach. We show that recent computational paleogenomics methods,
aiming at reconstructing the organization of ancestral genomes from the
comparison of extant genomes, can be used to correct, order and complete the
contig set of the Black Death agent genome, providing a full chromosome
sequence, at the nucleotide scale, of this ancient bacteria. This sequence
suggests that a burst of mobile elements insertions predated the Black Death,
leading to an exceptional genome plasticity and increase in rearrangement rate.Comment: Extended abstract of a talk presented at the conference JOBIM 2013,
https://colloque.inra.fr/jobim2013_eng/. Full paper submitte
On the enumeration of rooted trees with fixed size of maximal decreasing trees
Let \T_{n} be the set of rooted labeled trees on . A maximal
decreasing subtree of a rooted labeled tree is defined by the maximal subtree
from the root with all edges being decreasing. In this paper, we study a new
refinement \T_{n,k} of \T_n, which is the set of rooted labeled trees whose
maximal decreasing subtree has vertices.Comment: 10 pages, 1 figure
Average-case analysis of perfect sorting by reversals (Journal Version)
Perfect sorting by reversals, a problem originating in computational
genomics, is the process of sorting a signed permutation to either the identity
or to the reversed identity permutation, by a sequence of reversals that do not
break any common interval. B\'erard et al. (2007) make use of strong interval
trees to describe an algorithm for sorting signed permutations by reversals.
Combinatorial properties of this family of trees are essential to the algorithm
analysis. Here, we use the expected value of certain tree parameters to prove
that the average run-time of the algorithm is at worst, polynomial, and
additionally, for sufficiently long permutations, the sorting algorithm runs in
polynomial time with probability one. Furthermore, our analysis of the subclass
of commuting scenarios yields precise results on the average length of a
reversal, and the average number of reversals.Comment: A preliminary version of this work appeared in the proceedings of
Combinatorial Pattern Matching (CPM) 2009. See arXiv:0901.2847; Discrete
Mathematics, Algorithms and Applications, vol. 3(3), 201
- …