Jump to content

Talk:Shapiro–Senapathy algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Opencooper (talk | contribs) at 02:50, 4 March 2019 (Opencooper moved page Talk:Shapiro - Senapathy Algorithm to Talk:Shapiro–Senapathy algorithm: Title case and endash per MOS:ENBETWEEN ). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Shapiro–Senapathy_algorithm&oldid=886071114"