Graph theoretic approach to parallel gene assembly
نویسندگان
چکیده
منابع مشابه
Graph Theoretic Approach to Parallel Gene
7 We study parallel complexity of signed graphs motivated by the highly 8 complex genetic recombination processes in ciliates. The molecular gene 9 assembly operations have been modeled by operations of signed graphs, 10 i.e., graphs where the edges have a sign + or −. In the optimization prob11 lem for signed graphs one wishes to find the parallel complexity by which 12 the graph can be reduce...
متن کاملA module theoretic approach to zero-divisor graph with respect to (first) dual
Let $M$ be an $R$-module and $0 neq fin M^*={rm Hom}(M,R)$. We associate an undirected graph $gf$ to $M$ in which non-zero elements $x$ and $y$ of $M$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. Weobserve that over a commutative ring $R$, $gf$ is connected anddiam$(gf)leq 3$. Moreover, if $Gamma (M)$ contains a cycle,then $mbox{gr}(gf)leq 4$. Furthermore if $|gf|geq 1$, then$gf$ is finit...
متن کاملA Group Theoretic Approach to Assembly Planning
high-level robotic assembly planning. An assembly is a collection of bodies that are spatially related. When two bodies in an assembly are related, they do not make contact over their whole surface; rather, features of each body are in contact. For the moment, let us think of a feature as some part of the surface of a body. Thus, for example, a journal on a shaft fits a bearing, the teeth of ge...
متن کاملGraph-theoretic approach to quantum correlations.
Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a subgraph. We show that the maximum value of the correlations for classical, quantum, and more general theories is the independence number, the Lovász number...
متن کاملA Graph { Theoretic Approach to ImageDatabase
Feature vectors that are used to represent images exist in a very high dimensional space. Usually, a parametric characterization of the distribution of this space is impossible. It is generally assumed that the features are able to locate visually similar images close in the feature space so that non-parametric approaches, like the k-nearest neighbor search, can be used for retrieval. This pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.01.022