title: A teaching approach from the exhaustive search method to the Needleman-Wunsch algorithm.
abstract: The Needleman-Wunsch algorithm has become one of the core algorithms in bioinformatics; however, this programming requires more suitable explanations for students with different major backgrounds. In supposing sample sequences and using a simple store system, the connection between the exhaustive search method and the Needleman-Wunsch algorithm was analyzed to more thoroughly explain this algorithm. The present study could benefit the teaching and learning of the Needleman-Wunsch algorithm. © 2016 by The International Union of Biochemistry and Molecular Biology, 45(3):194-204, 2017.
authors.affiliation: Department of Ecology, Jinan University, Guangzhou, 510632, China.
authors.forename: Zhongneng
authors.initials: Z
authors.lastname: Xu
authors.affiliation: Department of Ecology, Jinan University, Guangzhou, 510632, China.
authors.forename: Yayun
authors.initials: Y
authors.lastname: Yang
authors.affiliation: Departament d'Enginyeria Quimica, Universitat Rovira i Virgili, 26 Av. dels Paisos Catalans, 43007, Tarragona, Spain.|Department of Experimental Therapeutics, The University of Texas M. D. Anderson Cancer Center, Unit 36, Houston, TX 77030, USA.
authors.forename: Beibei
authors.initials: B
authors.lastname: Huang
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000193:education*; D006801:Humans; D016415:Sequence Alignment / Q000379:methods*
keywords: Needleman-Wunsch algorithm; exhaustive search; sequence alignment; teaching