Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Needleman–Wunsch algorithm
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Choosing a scoring system=== Next, decide how to score each individual pair of letters. Using the example above, one possible alignment candidate might be: 12345678 {{DNA sequence|GCATG-CG}} {{DNA sequence|G-ATTACA}} The letters may match, mismatch, or be matched to a gap (a deletion or insertion ([[indel]])): * Match: The two letters at the current index are the same. * Mismatch: The two letters at the current index are different. * Indel (Insertion or Deletion): The best alignment involves one letter aligning to a gap in the other string. Each of these scenarios is assigned a score and the sum of the scores of all the pairings is the score of the whole alignment candidate. Different systems exist for assigning scores; some have been outlined in the [[#Scoring systems|Scoring systems]] section below. For now, the system used by Needleman and Wunsch<ref name="Needleman"/>{{verification failed|reason=Needleman and Wunsch use 1 and 0 not 1 and -1|date=October 2024}} will be used: * Match: +1 * Mismatch or Indel: −1 For the Example above, the score of the alignment would be 0: {{DNA sequence|GCATG-CG}} {{DNA sequence|G-ATTACA}} +−++−−+− −> 1*4 + (−1)*4 = 0
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)