A teaching approach from the exhaustive search method to the Needleman–Wunsch algorithm

Zhongneng Xu, Yayun Yang, Beibei Huang

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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 languageEnglish (US)
Pages (from-to)194-204
Number of pages11
JournalBiochemistry and Molecular Biology Education
Volume45
Issue number3
DOIs
StatePublished - May 1 2017

Keywords

  • Needleman–Wunsch algorithm
  • exhaustive search
  • sequence alignment
  • teaching

ASJC Scopus subject areas

  • Biochemistry
  • Molecular Biology

Fingerprint

Dive into the research topics of 'A teaching approach from the exhaustive search method to the Needleman–Wunsch algorithm'. Together they form a unique fingerprint.

Cite this