Genome rearrangement is an important area in computational biology and bioinformatics. The basic problem in genome rearrangements is to compute the edit distance, i.e., the minimum number of operations needed to transform one genome into another. Unfortunately, unsigned genome rearrangement problem is NP-hard. In this study an improved ant colony optimization algorithm to approximate the edit d...

During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures. A main task in all phylogenetic reconstruction algorithms is to solve the median of three problem. Although this problem is NP-hard even for the simplest distance measures, there are exact algorithms for the breakpoint median and...

We examine incentives in research teams where the market, such as scientific community, attributes credit for success based on its inference of individual efforts. A social planner who could commit to ex ante would induce more effort from higher ability agents exchange less per unit effort. Lacking commitment, Bayesian market assigns proportional perceived This inability distort leads an incent...

This document gives formatting guidelines for authors preparing papers for publication in the International Journal of Emerging Technology and Advanced Engineering The authors must follow the instructions given in the document for the papers to be published. Keywords—Keyword are your own designated keyword which can be used for easy location of the manuscript using any search engines. It includ...

Keyword-based linked data information retrieval is an easy choice for general-purpose users, but the implementation of such an approach is a challenge because mere keywords do not hold semantic information. Some studies have incorporated templates in an effort to bridge this gap, but most such approaches have proven ineffective because of inefficient template management. Because linked data can...

This paper contributes to the literature concerning burden sharing. We provide a quantitative expression of the burden sharing behaviour of 174 states in the case of combating terrorist financing and address specific burden sharing issues in this context (i.e., weakest link; no substitutability). We conclude that advanced states have shown more effort to control terrorist financing than develop...