Pathogens Sequenciating

  • Uploaded by: kolita kamal
  • 0
  • 0
  • May 2020
  • PDF

This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA


Overview

Download & View Pathogens Sequenciating as PDF for free.

More details

  • Words: 297
  • Pages: 2
Sequenciaton

Pathogens Sequenciating

„

DNA sequencing enables us to perform a thorough analysis of DNA because it provides us with the most basic information of all: the the sequence of nucleotides. With this knowledge, for example, we can locate regulatory and gene sequences, make comparisons between homologous genes across across species and identify mutations.

„

Two methods were independently developed: chemical Enzimatic (Sanger’ (Sanger’s method). Sanger’ Sanger’s method became the standard

1. 2.

B.K.Kolita Kamal Jinadasa, Jinadasa, Post Harvest Technology Division, NARA, ColomboColombo-15, Sri Lanka.

„

Sanger’ Sanger’s method, is based on the use of dideoxynucleotides (ddNTP’ ddNTP’s) in addition to the normal nucleotides (NTP’ NTP’s) found in DNA. Dideoxynucleotides are essentially the same as nucleotides except they contain a hydrogen group on the 3’ carbon instead of a hydroxyl group (OH). These modified nucleotides, when integrated into a sequence, prevent the addition of further nucleotides..This occurs because a phosphodiester bond cannot form between the dideoxynucleotide and the next incoming nucleotide, and thus the DNA chain is terminated.

because of its practicality

Sequenciation results

Blast „

„

„

„

In bioinformatics, bioinformatics, Basic Local Alignment Search Tool, or BLAST, BLAST, is an algorithm for comparing primary biological sequence information, such as the aminoamino-acid sequences of different proteins or the nucleotides of DNA sequences. sequences. A BLAST search enables a researcher to compare a query sequence with a library or database of sequences, and identify library sequences that resemble the query sequence above a certain threshold. To run, BLAST requires two sequences as input: a query sequence and a sequence database. BLAST searches for high scoring sequence alignments between the query sequence and sequences in the database using a heuristic approach approach that approximates the SmithSmith-Waterman algorithm

1

Blast results Query sequence input

Search start

Taxonomy tree

2

Related Documents


More Documents from ""