Information for "Needleman–Wunsch algorithm"

From HandWiki

Basic information

Display titleNeedleman–Wunsch algorithm
Default sort keyNeedleman-Wunsch Algorithm
Page length (in bytes)25,889
Namespace ID0
Page ID242063
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Page imageNeedleman-Wunsch pairwise sequence alignment.png
HandWiki item IDNone

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>Jport
Date of page creation17:48, 6 February 2024
Latest editorimported>Jport
Date of latest edit17:48, 6 February 2024
Total number of edits1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (34)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
The Needleman–Wunsch algorithm is an algorithm used in bioinformatics to align protein or nucleotide sequences. It was one of the first applications of dynamic programming to compare biological sequences. The algorithm was developed by Saul B. Needleman and Christian D. Wunsch and published in 1970...
Information from Extension:WikiSEO