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: | ||||||||||||||||||||||||||||||||
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
|
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)
Categories:
- All unassessed articles
- C-Class Molecular Biology articles
- Unknown-importance Molecular Biology articles
- C-Class Genetics articles
- Low-importance Genetics articles
- WikiProject Genetics articles
- C-Class Computational Biology articles
- Low-importance Computational Biology articles
- WikiProject Computational Biology articles
- All WikiProject Molecular Biology pages
- C-Class medicine articles
- Low-importance medicine articles
- All WikiProject Medicine pages