Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Motivation: To construct a multiple sequence alignment (MSA) of a large number (>∼10 000) of sequences, the calculation of a guide tree with a complexity of O(N2) to O(N3), where N is the number of sequences, is the most time-consuming process.#R##N##R##N#Results: To overcome this limitation,  have developed an approximate algorithm, PartTree, to construct a guide tree with an average time complexity of O(N log N). The new MSA method with the PartTree algorithm can align ∼60 000 sequences in several minutes on a standard desktop computer. The loss of accuracy in MSA caused by this approximation was estimated to be several percent in benchmark tests using Pfam.#R##N##R##N#Availability: The present algorithm has been implemented in the MAFFT sequence alignment package (http://align.bmr.kyushu-u.ac.jp/mafft/software/).#R##N##R##N#Contact: katoh@bioreg.kyushu-u.ac.jp#R##N##R##N#Supplementary information: Supplementary information is available at Bioinformatics online.
['Kazutaka Katoh', 'Hiroyuki Toh']
I am writing a research paper on a idea PartTree: an algorithm to build an approximate tree from a large number of unaligned sequences
[{"from": "human", "value": "I am writing a research paper on a idea PartTree: an algorithm to build an approximate tree from a large number of unaligned sequences"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Motivation: To construct a multiple sequence alignment (MSA) of a large number (>\u223c10\u2009000) of sequences, the calculation of a guide tree with a complexity of O(N2) to O(N3), where N is the number of sequences, is the most time-consuming process.#R##N##R##N#Results: To overcome this limitation,  have developed an approximate algorithm, PartTree, to construct a guide tree with an average time complexity of O(N log N). The new MSA method with the PartTree algorithm can align \u223c60\u2009000 sequences in several minutes on a standard desktop computer. The loss of accuracy in MSA caused by this approximation was estimated to be several percent in benchmark tests using Pfam.#R##N##R##N#Availability: The present algorithm has been implemented in the MAFFT sequence alignment package (http://align.bmr.kyushu-u.ac.jp/mafft/software/).#R##N##R##N#Contact: katoh@bioreg.kyushu-u.ac.jp#R##N##R##N#Supplementary information: Supplementary information is available at Bioinformatics online."}]