COMPUTER SCIENTIST
Needleman–Wunsch algorithm

Needleman–Wunsch algorithm
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. The algorithm essentially divides a large problem (e.g. Read more on Wikipedia
Their biography is available in different languages on Wikipedia. Needleman–Wunsch algorithm is the 160th most popular computer scientist (down from 133rd in 2019). (down from 4,019th in 2019)
Memorability Metrics
Page views of Needleman–Wunsch algorithm by language
Among COMPUTER SCIENTISTS
Among computer scientists, Needleman–Wunsch algorithm ranks 160 out of 245. Before them are Bertrand Meyer, Hal Abelson, Kent Beck, Elizabeth J. Feinler, Annie Easley, and Kathleen Booth. After them are Silvio Micali, Henriette Avram, Liu Gang, Yoshua Bengio, James H. Clark, and Leslie Valiant.
Most Popular Computer Scientists in Wikipedia
Go to all RankingsBertrand Meyer
1950 - Present
HPI: 54.15
Rank: 154
Hal Abelson
1947 - Present
HPI: 54.05
Rank: 155
Kent Beck
1961 - Present
HPI: 53.53
Rank: 156
Elizabeth J. Feinler
1931 - Present
HPI: 53.44
Rank: 157
Annie Easley
1933 - 2011
HPI: 53.43
Rank: 158
Kathleen Booth
1922 - 2022
HPI: 53.43
Rank: 159
Needleman–Wunsch algorithm
HPI: 53.20
Rank: 160
Silvio Micali
1954 - Present
HPI: 53.18
Rank: 161
Henriette Avram
1919 - 2006
HPI: 53.13
Rank: 162
Liu Gang
1961 - Present
HPI: 53.11
Rank: 163
Yoshua Bengio
1964 - Present
HPI: 53.01
Rank: 164
James H. Clark
1944 - Present
HPI: 52.70
Rank: 165
Leslie Valiant
1949 - Present
HPI: 52.68
Rank: 166