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.
Original language | English (US) |
---|---|
Pages (from-to) | 194-204 |
Number of pages | 11 |
Journal | Biochemistry and Molecular Biology Education |
Volume | 45 |
Issue number | 3 |
DOIs | |
State | Published - May 1 2017 |
Keywords
- Needleman–Wunsch algorithm
- exhaustive search
- sequence alignment
- teaching
ASJC Scopus subject areas
- Biochemistry
- Molecular Biology