Abstract
Multiple sequence alignment is an unsolved NP-complete combinatorial optimization problem.This paper described a new exhaustive genetic algorithm based on Gap Crossover and Gap Mutation(GC-GM) for multiple sequence alignment by genetic operation on gap matrixes reassembled.The approach was examined by using a set of standard instances taken from the benchmark alignment database BAliBASE.Numerical simulation results were compared with those obtained by using the Clustal W algorithm and showed the effectiveness of the new approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
