Schema Decomposition for Non-Binary Gene

نویسندگان
چکیده

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

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

منابع مشابه

Non-binary Evaluation for Schema Matching

In this work we extend the commonly used binary evaluation of schema matching to support evaluation methods for non-binary matching results as well. We motivate our work with some new applications of schema matching. Non-binary evaluation is formally defined together with a set of three new, non-binary evaluation measures using a vector-space representation of schema matching outcome. We provid...

متن کامل

Rectangular Decomposition of Binary Images

The contribution deals with the most important methods for decomposition of binary images into union of rectangles. The overview includes run-length encoding and its generalization, decompositions based on quadtrees, on the distance transformation, and a theoretically optimal decomposition based on maximal matching in bipartite graphs. We experimentally test their performance in binary image co...

متن کامل

Spinodal Decomposition in Binary Gases

We carried out three-dimensional simulations, with about 1.4 × 10 particles, of phase segregation in a low density binary fluid mixture, described mesoscopically by energy and momentum conserving Boltzmann-Vlasov equations. Using a combination of Direct Simulation Monte Carlo(DSMC) for the short range collisions and a version of Particle-In-Cell(PIC) evolution for the smooth long range interact...

متن کامل

Binary vs. non-binary constraints

There are two well known transformations from non-binary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the dual transformation and the hidden (variable) transformation. We perform a detailed formal comparison of these two transformations. Our comparison focuses on two backtracking algorithms that maintain a local consistency propert...

متن کامل

Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost

Polytomies in gene trees are multifurcated nodes corresponding to unresolved parts of the tree, usually due to insufficient differentiation between sequences. Resolving a multifurcated tree has been considered by many authors, the objective function often being the number of duplications and losses reflected by the reconciliation of the resolved gene tree with a given species tree. Here, we pre...

متن کامل

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


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

ژورنال

عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers

سال: 1995

ISSN: 1342-5668,2185-811X

DOI: 10.5687/iscie.8.535