Talk:Shapiro–Senapathy algorithm
Appearance
| This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
Template:WikiProject Genetics
| |||||||||||
But how does it work?
The article describes the purpose of the S&S algorithm, but tells us nothing about how it works. It's as if the Euclidean algorithm article said "the Euclidean algorithm is an efficient method for computing the greatest common divisor of two numbers", and explained how useful it is to be able to calculate greatest common divisors, but said nothing about how it works. Can this be remedied? Maproom (talk) 12:45, 2 November 2018 (UTC)