ArticleslgStudy

computer science

Shapiro–Senapathy algorithm

Shapiro–Senapathy algorithm is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Shapiro–Senapathy algorithm rather than just read about it. In short: The Shapiro—Senapathy algorithm (S&S) is a computational method for identifying splice sites in eukaryotic genes. The algorithm employs a Position Weight Matrix (PWM) scoring formula to predict donor and acceptor splice sites in any given gene.

Shapiro–Senapathy algorithm — main illustration
Shapiro–Senapathy algorithm — illustration

Key takeaways

  • Shapiro–Senapathy algorithm belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Shapiro–Senapathy algorithm to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Shapiro–Senapathy algorithm from memory before moving on to harder problems.

Reference excerpt

The Shapiro—Senapathy algorithm (S&S) is a computational method for identifying splice sites in eukaryotic genes. The algorithm employs a Position Weight Matrix (PWM) scoring formula to predict donor and acceptor splice sites in any given gene. This methodology has been used to discover splice sites and disease-causing splice site mutations in the human genome, and has become a standard tool in clinical genomics. The S&S algorithm has been cited in thousands of clinical studies, according to Google Scholar. It has also formed the basis of widely used software, including Human Splicing Finder, SROOGLE, and Alamut, which identify splice sites and splice site mutations that cause disease. The algorithm has uncovered splicing mutations in diseases ranging from cancers to inherited disorders, and predicted the deleterious effects of these mutations including exon skipping, intron retention, and cryptic splice site activation.

The algorithm A splice site defines the boundary between a coding exon and a non-coding intron in eukaryotic genes. The S&S algorithm employs a sliding window, corresponding to the length of the splice site motif, to scan a gene sequence and detect potential splice sites. For each sliding window, the algorithm calculates a score by comparing the nucleotide sequence to a Position Weight Matrix (PWM) derived from known splice sites. This formula generates a percentile score, indicating the likelihood that a given sequence functions as a donor or acceptor splice site. The majority of disease-causing mutations in the human genome are located in splice sites. Clinical genomics studies analyze the splice site scores generated by the S&S algorithm to predict the consequences of splice site mutations including exon skipping and intron retention. The algorithm's sensitivity to single-nucleotide changes allows it to determine mutations that may impact RNA splicing and contribute to disease. In addition to identifying real splice sites, the S&S algorithm has been used to discover cryptic splice sites — alternative splice sites activated by mutations — which may disrupt normal splicing. The algorithm detects mutations that lead to the activation of cryptic splice sites, which may be located proximal to real splice sites or deep within non-coding introns. It has thus been used to determine the causes of numerous diseases that are due to cryptic splicing.

Cancer gene discovery using S&S The S&S algorithm has been used to identify splice-site mutations in genes associated with several cancers. For example, genes causing commonly occurring cancers including breast cancer, ovarian cancer, colorectal cancer, leukemia, head and neck cancers, prostate cancer, retinoblastoma, squamous cell carcinoma, gastrointestinal cancer, melanoma, liver cancer, Lynch syndrome, skin cancer, and neurofibromatosis have been found. In addition, splicing mutations in genes causing less commonly known cancers including gastric cancer, gangliogliomas, Li-Fraumeni syndrome, Loeys–Dietz syndrome, Osteochondromas (bone tumor), Nevoid basal cell carcinoma syndrome, and Pheochromocytomas have been identified. Specific mutations in different splice sites in various genes causing breast cancer (e.g., BRCA1, PALB2), ovarian cancer (e.g., SLC9A3R1, COL7A1, HSD17B7), colon cancer (e.g., APC, MLH1, DPYD), colorectal cancer (e.g., COL3A1, APC, HLA-A), skin cancer (e.g., COL17A1, XPA, POLH), and Fanconi anemia (e.g., FANC, FANA) have been uncovered. The mutations in the donor and acceptor splice sites in different genes causing a variety of cancers that have been identified by S&S are shown in Table 1.

Discovery of genes causing inherited disorders using S&S Specific mutations in different splice sites in various genes that cause inherited disorders, including, for example, Type 1 diabetes (e.g., PTPN22, TCF1 (HCF-1A)), hypertension (e.g., LDL, LDLR, LPL), Marfan syndrome (e.g., FBN1, TGFBR2, FBN2), cardiac diseases (e.g., COL1A2, MYBPC3, ACTC1), eye disorders (e.g., EVC, VSX1) have been uncovered. A few example mutations in the donor and acceptor splice sites in different genes causing a variety of inherited disorders identified using S&S are shown in Table 2.

Genes causing immune system disorders More than 100 immune system disorders affect humans, including inflammatory bowel diseases, multiple sclerosis, systemic lupus erythematosus, bloom syndrome, familial cold autoinflammatory syndrome, and dyskeratosis congenita. The Shapiro–Senapathy algorithm has been used to discover genes and mutations involved in many immune disorder diseases, including Ataxia telangiectasia, B-cell defects, epidermolysis bullosa, and X-linked agammaglobulinemia. Xeroderma pigmentosum, an autosomal recessive disorder is caused by faulty proteins formed due to new preferred splice donor site identified using S&S algorithm and resulted in defective nucleotide excision repair. Type I Bartter syndrome (BS) is caused by mutations in the gene SLC12A1. S&S algorithm helped in disclosing the presence of two novel heterozygous mutations c.724 + 4A > G in intron 5 and c.2095delG in intron 16 leading to complete exon 5 skipping. Mutations in the MYH gene, which is responsible for removing the oxidatively damaged DNA lesion are cancer-susceptible in the individuals. The IVS1+5C plays a causative role in the activation of a cryptic splice donor site and the alternative splicing in intron 1, S&S algorithm shows, guanine (G) at the position of IVS+5 is well conserved (at the frequency of 84%) among primates. This also supported the fact that the G/C SNP in the conserved splice junction of the MYH gene causes the alternative splicing of intron 1 of the β type transcript. Splice site scores were calculated according to S&S to find EBV infection in X-linked lymphoproliferative disease. Identification of Familial tumoral calcinosis (FTC) is an autosomal recessive disorder characterized by ectopic calcifications and elevated serum phosphate levels and it is because of aberrant splicing.

… excerpt ends here. Continue reading the full article.

Illustrations

Shapiro–Senapathy algorithm: The different types of splicing mutations in genes. Mutations within the splicing regions of genes can lead to a defective transcript and protein. Depending on where exactly the mutation occurs and which "cryptic" splice site near the original site is chosen for splicing, the specific defect in the transcript and protein will vary. Frequently, splicing mutations will lead to exon skipping, intron inclusion, exon extension/truncation, and premature termination in the resulting transcript. The various defects in the transcript will in turn result in different kinds of disruption in the amino acid sequence of the protein.
The different types of splicing mutations in genes. Mutations within the splicing regions of genes can lead to a defective transcript and protein. Depending on where exactly the mutation occurs and which "cryptic" splice site near the original site is chosen for splicing, the specific defect in the transcript and protein will vary. Frequently, splicing mutations will lead to exon skipping, intron inclusion, exon extension/truncation, and premature termination in the resulting transcript. The various defects in the transcript will in turn result in different kinds of disruption in the amino acid sequence of the protein.
Shapiro–Senapathy algorithm: Exon Skipping caused by a donor mutation in the gene MLH1 leading to colorectal cancer. The generation of a mRNA from a split gene involves the transcription of the gene into the primary RNA transcript, and the precise removal of the introns and the joining of the exons from the primary RNA transcript. A deleterious mutation within the splicing signals (donor or acceptor splice sites) can affect the recognition of the correct splice junction and lead to an aberration in the joining of the authentic exons. Depending on if the mutation occurs within the donor or the acceptor site, and the particular base that is mutated within the splice sequence, the aberration could lead to the skipping of a complete or partial exon, or the inclusion of a partial intron or a cryptic exon in the mRNA produced by the splicing process. Either of these situations will usually lead to a premature stop codon in the mRNA and result in a completely defective protein. The S&S algorithm aids in determining which splice site and exon in a gene are mutated, and the S&S score of the mutated splice site aids in determining the type of splicing aberration and the resulting mRNA structure and sequence. The example gene MLH1 affected in colorectal cancer is shown in the figure. It was found using the S&S algorithm that a mutation in the donor splice site in exon 8 led to the skipping of the exon 8. The mRNA thus lacks the sequence corresponding to exon 8 (sequence positions are shown in the figure). This causes a frame shift in the mRNA coding sequence at amino acid position 226, leading to premature protein truncation at amino acid position 233. This mutated protein is completely defective, which has led to colorectal cancer in the patient.
Exon Skipping caused by a donor mutation in the gene MLH1 leading to colorectal cancer. The generation of a mRNA from a split gene involves the transcription of the gene into the primary RNA transcript, and the precise removal of the introns and the joining of the exons from the primary RNA transcript. A deleterious mutation within the splicing signals (donor or acceptor splice sites) can affect the recognition of the correct splice junction and lead to an aberration in the joining of the authentic exons. Depending on if the mutation occurs within the donor or the acceptor site, and the particular base that is mutated within the splice sequence, the aberration could lead to the skipping of a complete or partial exon, or the inclusion of a partial intron or a cryptic exon in the mRNA produced by the splicing process. Either of these situations will usually lead to a premature stop codon in the mRNA and result in a completely defective protein. The S&S algorithm aids in determining which splice site and exon in a gene are mutated, and the S&S score of the mutated splice site aids in determining the type of splicing aberration and the resulting mRNA structure and sequence. The example gene MLH1 affected in colorectal cancer is shown in the figure. It was found using the S&S algorithm that a mutation in the donor splice site in exon 8 led to the skipping of the exon 8. The mRNA thus lacks the sequence corresponding to exon 8 (sequence positions are shown in the figure). This causes a frame shift in the mRNA coding sequence at amino acid position 226, leading to premature protein truncation at amino acid position 233. This mutated protein is completely defective, which has led to colorectal cancer in the patient.

Worked examples

Example 1 — a first encounter with Shapiro–Senapathy algorithm

Start with the simplest possible case. Write down what Shapiro–Senapathy algorithm claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Shapiro–Senapathy algorithm before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Shapiro–Senapathy algorithm ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Shapiro–Senapathy algorithm

In research
Shapiro–Senapathy algorithm appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Shapiro–Senapathy algorithm in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Shapiro–Senapathy algorithm is common in secondary-school and first-year university syllabi. It links to neighbouring topics Algorithms, Bioinformatics algorithms, Gene expression, so understanding it makes those chapters shorter.
In everyday life
Look for Shapiro–Senapathy algorithm outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Shapiro–Senapathy algorithm” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Shapiro–Senapathy algorithm in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Shapiro–Senapathy algorithm means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Shapiro–Senapathy algorithm out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Shapiro–Senapathy algorithm in simple terms?

The Shapiro—Senapathy algorithm (S&S) is a computational method for identifying splice sites in eukaryotic genes. The algorithm employs a Position Weight Matrix (PWM) scoring formula to predict donor and acceptor splice sites in any given gene.

Why does Shapiro–Senapathy algorithm matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Shapiro–Senapathy algorithm?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Shapiro–Senapathy algorithm.

Tags

  • Algorithms
  • Bioinformatics algorithms
  • Gene expression
  • RNA splicing
  • Spliceosome

Keep exploring