Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Shapiro-Senapathy Algorithm

String Algorithm

The Shapiro-Senapathy algorithm, also called S&S, is a computational method for identifying the splice sites in eukaryotic genes, the precise boundaries where the coding exons join the non-coding introns of a split gene. It uses a position weight matrix scoring formula to predict donor and acceptor splice sites in a given gene sequence. Because most disease-causing mutations in the human genome fall at splice sites, the algorithm has become a standard tool in clinical genomics, underlying widely used software such as Human Splicing Finder and Alamut, and is applied in cancer gene discovery and the study of inherited and immune system disorders. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Connections

In Field

Bioinformatics, Fields
Source Wikipedia: Shapiro-Senapathy algorithm
Sources
Wikipedia: Shapiro-Senapathy algorithm
  • Lead section
    The Shapiro-Senapathy algorithm (S&S) is a computational method for identifying splice sites in eukaryotic genes.
  • In Group: Sequence and Code Analysis Algorithms, Introduction
    The Shapiro-Senapathy algorithm (S&S) is a computational method for identifying splice sites in eukaryotic genes.
  • In Field: Bioinformatics, Lead
    The Shapiro-Senapathy algorithm (S&S) is a computational method for identifying splice sites in eukaryotic genes.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.