Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The assignment of orthologous genes beten a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various biological problems critically rely on bona fide orthologs as input. While it is usually done using sequence similarity search,  recently proposed a new combinatorial approach that combines sequence similarity and genome rearrangement.  continues the development of the approach and unites genome rearrangement events and (post-speciation) duplication events in a single framework under the parsimony principle. In this framework, orthologous genes are assumed to correspond to each other in the most parsimonious evolutionary scenario involving both genome rearrangement and (post-speciation) gene duplication. Besides several original algorithmic contributions, the enhanced method allows for the detection of inparalogs. Following this approach,  have implemented a high-throughput system for ortholog assignment on a genome scale, called MSOAR, and applied it to the genomes of human and mouse. As the result will show, MSOAR is able to find 99 more true orthologs than the INPARANOID program did.  have also compared MSOAR with the iterated exemplar algorithm on simulated data and found that MSOAR performed very ll in terms of assignment accuracy. These test results indiate that our approach is very promising for genome-wide ortholog assignment.
['Zheng Fu', 'Xin Chen', 'Vladimir Vacic', 'Peng Nan', 'Yang Zhong', 'Tao Jiang']
I am writing a research paper on a idea A parsimony approach to genome-wide ortholog assignment
[{"from": "human", "value": "I am writing a research paper on a idea A parsimony approach to genome-wide ortholog assignment"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The assignment of orthologous genes beten a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various biological problems critically rely on bona fide orthologs as input. While it is usually done using sequence similarity search,  recently proposed a new combinatorial approach that combines sequence similarity and genome rearrangement.  continues the development of the approach and unites genome rearrangement events and (post-speciation) duplication events in a single framework under the parsimony principle. In this framework, orthologous genes are assumed to correspond to each other in the most parsimonious evolutionary scenario involving both genome rearrangement and (post-speciation) gene duplication. Besides several original algorithmic contributions, the enhanced method allows for the detection of inparalogs. Following this approach,  have implemented a high-throughput system for ortholog assignment on a genome scale, called MSOAR, and applied it to the genomes of human and mouse. As the result will show, MSOAR is able to find 99 more true orthologs than the INPARANOID program did.  have also compared MSOAR with the iterated exemplar algorithm on simulated data and found that MSOAR performed very ll in terms of assignment accuracy. These test results indiate that our approach is very promising for genome-wide ortholog assignment."}]