Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A basic problem in the area of combinatorial algorithms for genome evolution is to determine the minimum number of large scale evolutionary events (genome rearrangements) that transform a genome into another. The present paper is a contribution to the algorithmic study of genom evolution by translocations which is an area related to pattern recognition. Furthermore, it may be vied as a contribution to other areas related to pattern recognition like: error estimation, genetic programming, disease diagnosis.   consider chromosomes as being linear strings that exchange each other prefixes in the translocation process. A new type of translocation distance beten a pair of multi-chromosomal genomes is introduced;  examine the complexity of computing this distance in the case of uniform translocation, that is at each step the strings exchange prefixes of the same length.  present an exact polynomial algorithm based on the greedy strategy when the target set is a singleton while, a 2-approximation algorithm is provided when considering arbitrary target sets. Some open problems are finally formulated.
['Carlos Martín-Vide', 'Victor Mitrana']
I am writing a research paper on a idea A New Uniform Translocation Distance
[{"from": "human", "value": "I am writing a research paper on a idea A New Uniform Translocation Distance"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A basic problem in the area of combinatorial algorithms for genome evolution is to determine the minimum number of large scale evolutionary events (genome rearrangements) that transform a genome into another. The present paper is a contribution to the algorithmic study of genom evolution by translocations which is an area related to pattern recognition. Furthermore, it may be vied as a contribution to other areas related to pattern recognition like: error estimation, genetic programming, disease diagnosis.   consider chromosomes as being linear strings that exchange each other prefixes in the translocation process. A new type of translocation distance beten a pair of multi-chromosomal genomes is introduced;  examine the complexity of computing this distance in the case of uniform translocation, that is at each step the strings exchange prefixes of the same length.  present an exact polynomial algorithm based on the greedy strategy when the target set is a singleton while, a 2-approximation algorithm is provided when considering arbitrary target sets. Some open problems are finally formulated."}]