Paths and Cycles in Breakpoint Graphs of Random Multichromosomal Genomes

نویسندگان

  • Andrew Wei Xu
  • Chunfang Zheng
  • David Sankoff
چکیده

We study the probability distribution of the distance d = n + chi - kappa - psi between two genomes with n markers distributed on chi chromosomes and with breakpoint graphs containing kappa cycles and psi "good" paths, under the hypothesis of random gene order. We interpret the random order assumption in terms of a stochastic method for constructing the bicolored breakpoint graph. We show that the limiting expectation of E[d] = n - 1/2chi - 1/2 log n+chi/2chi. We also calculate the variance, the effect of different numbers of chromosomes in the two genomes, and the number of plasmids, or circular chromosomes, generated by the random breakpoint graph construction. A more realistic model allows intra- and interchromosomal operations to have different probabilities, and simulations show that for a fixed number of rearrangements, kappa and d depend on the relative proportions of the two kinds of operation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multichromosomal Genome Median and Halving Problems

Genome median and halving problems aim at reconstructing ancestral genomes and the evolutionary events leading from the ancestor to extant species. The NP-hardness of the breakpoint distance and reversal distance median problems for unichromosomal genomes do not easily imply the same for the multichromosomal case. Here we find the complexity of several genome median and halving problems, includ...

متن کامل

Characterization of signed paths and cycles admitting minus dominating function

If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.

متن کامل

DCJ Median Problems on Linear Multichromosomal Genomes: Graph Representation and Fast Exact Solutions

In genome rearrangement, given a set of genomes G and a distance measure d, the median problem asks for another genome q that minimizes the total distance [Formula: see text]. This is a key problem in genome rearrangement based phylogenetic analysis. Although this problem is known to be NP-hard, we have shown in a previous article, on circular genomes and under the DCJ distance measure, that a ...

متن کامل

SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy

The breakpoint distance is one of the most straightforward genome comparison measures. Surprisingly, when it comes to define it precisely for multichromosomal genomes with both linear and circular chromosomes, there is more than one way to go about it. In this paper we study Single-Cut-or-Join (SCJ), a breakpoint-like rearrangement event for which we present linear and polynomial time algorithm...

متن کامل

Genome-scale evolution: reconstructing gene orders in the ancestral species.

Recent progress in genome-scale sequencing and comparative mapping raises new challenges in studies of genome rearrangements. Although the pairwise genome rearrangement problem is well-studied, algorithms for reconstructing rearrangement scenarios for multiple species are in great need. The previous approaches to multiple genome rearrangement problem were largely based on the breakpoint distanc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of computational biology : a journal of computational molecular cell biology

دوره 14 4  شماره 

صفحات  -

تاریخ انتشار 2006