Experiment No.

Aim: To retrieve and analyse nucleotide sequences from the NCBI database.

Theory:

The National Center for Biotechnology Information (NCBI) is part of the United States National
Library of Medicine (NLM), a branch of the National Institute of Health (NIH). It is approved and
funded by the government of the United States. The NCBI is located in Bethesda, Maryland and
was founded in 1988 through legislation sponsored by US
Congressman Claude Pepper.

The NCBI houses a series of databases relevant to biotechnology and biomedicine and is an
important resource for bioinformatics tools and services. Major databases include GenBank for
DNA sequences and PubMed, a bibliographic database for biomedical literature. Other
databases include the NCBI Epigenomics database. All these
databases are available online through the Entrez search engine. NCBI was directed by David
Lipman, one of the original authors of the BLAST sequence alignment program
and a widely respected figure in bioinformatics.

The different databases present in NCBI are as follows:

1. Assembly: A database providing information on the structure of assembled genomes, assembly

names and other meta-data, statistical reports, and links to genomic
sequence data.

2. BioCollection: BioCollections is a curated dataset of metadata for culture

collections, museums, herbaria and other natural history collections, including Darwin Core
institution and collection codes, and URL formulae for mapping specimen ids to web pages at
the collection site.
3. BioProject: A BioProject is a collection of biological data related to a single initiative, originating
from a single organization or from a consortium. A BioProject record provides users a single place to
find links to the diverse data types generated for that project.
4. BioSample: The BioSample database contains descriptions of biological source
materials used in experimental assays.
5. BioSystem: The NCBI BioSystems Database provides integrated access to biological
systems and their component genes, proteins, and small molecules, as well as literature
describing those biosystems and other related data throughout Entrez.

6. Nucleotide: The Nucleotide database is a collection of sequences from several sources,

including GenBank, RefSeq, TPA and PDB. Genome, gene and transcript sequence data
provide the foundation for biomedical research and discovery.
7. ClinVar: ClinVar aggregates information about genomic variation and its relationship to
human health.
8. Conserved Domain Database (CDD): The Conserved Domain Database is a resource for the
annotation of functional units in proteins. Its collection of domain models
includes a set curated by NCBI, which utilizes 3D structure to provide insights into
sequence/structure/function relationships.
9. dbGaP: The database of Genotypes and Phenotypes (dbGaP) was developed to archive
and distribute the data and results from studies that have investigated the interaction of
genotype and phenotype in Humans.
10. dbVar: dbVar is NCBI's database of human genomic Structural Variation — large
variants >50 bp including insertions, deletions, duplications, inversions, mobile
elements, translocations, and complex variants.

Procedure:

1. Open NCBI website ([Link]

2. Select Nucleotide from the database drop-down menu.

3. Enter the gene/organism’s name in the search bar (e.g., BRCA1 Homo sapiens) and
search.
4. From the results, click the required accession number.

5. View the record details (organism, length, annotations).

6. Click Send to → File → FASTA → Create File to download the sequence.

7. Save the file with a proper name for future analysis.

Result

Nucleotide sequence for the selected gene was successfully retrieved from the NCBI database in
FASTA format.

Experiment No. 2

Aim: To explore protein databases and retrieve protein sequences and structures.

UniProt:

Theory:

UniProt is a freely accessible database of protein sequence and functional information,

many entries being derived from genome sequencing projects. It contains a large

amount of information about the biological function of proteins derived from the

research literature. It is maintained by the UniProt consortium, which consists of

several European bioinformatics organisations and a foundation from Washington, DC,

United States. The UniProt consortium comprises the European Bioinformatics Institute

(EBI), the Swiss Institute of Bioinformatics (SIB), and the Protein Information Resource

(PIR). EBI, located at the Wellcome Trust Genome Campus in Hinxton, UK, hosts a large

resource of bioinformatics databases and services. SIB, located in Geneva, Switzerland,

maintains the ExPASy (Expert Protein Analysis System) servers that are a central

resource for proteomics tools and databases. PIR, hosted by the National Biomedical
Research Foundation (NBRF) at the Georgetown University Medical Center in

Washington, DC, US, is heir to the oldest protein sequence database, Margaret

Dayhoff's Atlas of Protein Sequence and Structure, first published in 1965. In 2002, EBI,

SIB, and PIR joined forces as the UniProt consortium. The UniProt Knowledgebase

consists of two sections: a section containing manually annotated records with

information extracted from literature and curator-evaluated computational analysis

(UniProtKB/Swiss-Prot), and a section with computationally analyzed records that await

full manual annotation (UniProtKB/TrEMBL).

Procedure:

1. Open UniProt Website

Go to [Link] in your web browser.

2. Search for a Protein

In the search bar, type the name of the protein you want to study

(example: “kinase”) and press Enter.

3. View Search Results

A list of protein entries will appear.

Click on any one protein entry from the list to open its details.

4. Explore Protein Information

On the protein page, observe:

o Protein name

o Organism

o Sequence information

o Structure, function, domains, pathways

o References and cross-links

5. Download Protein Sequence

Scroll down and select FASTA format or click the Download button to save the protein
sequence to your computer.

PDB

Theory:

The Protein Data Bank (PDB) is a database for the three-dimensional structural data of large
biological molecules, such as proteins and nucleic acids. The data, typically obtained by X-
ray crystallography, NMR spectroscopy, or, increasingly, cryo-electron microscopy, and
submitted by biologists and biochemists from around the world, are freely accessible on the
Internet via the websites of its member organisations (PDBe, PDBj, RCSB, and BMRB). The
PDB is overseen by an organization called the Worldwide Protein Data Bank, wwPDB. The
PDB is a key in areas of structural biology, such as structural genomics. Most major scientific
journals and some funding agencies now require scientists to submit their structure data to the
PDB.

Many other databases use protein structures deposited in the PDB. For example, SCOP and
CATH classify protein structures, while PDBsum provides a graphic overview of PDB entries
using information from other sources, such as Gene ontology.

Procedure:

1. Open the Protein Data Bank (PDB) using URL.

2. In the search bar, type the protein name (example: GABA) and press Enter.

3. Use filters like organism, taxonomy, or experimental method if needed.

4. Click on a protein entry from the results (example: PDB ID: 5GWM).

5. Click on the Structure or 3D View tab to see the protein's 3D model.

6. Use the on-screen tools to rotate, zoom, and view different parts of the protein.

7. To save the structure, click Download and choose the required format (e.g., PDB file).

Result:

Protein information and sequence were successfully explored and downloaded from

the UniProt and PDB database.

Experiment No. 3

Aim

To understand single nucleotide polymorphisms (SNPs) in the context of the Human Genome
Project (HGP), retrieve SNP data from dbSNP (NCBI).

Theory

1. Single Nucleotide Polymorphism (SNP)

 A SNP is a single base change at a specific genomic position that is present in a

significant fraction of the population (commonly ≥1%).

 SNPs are the most common form of genetic variation in humans and can be located in
coding regions (synonymous, nonsynonymous/missense, nonsense), non-coding
regulatory regions (promoters, enhancers), introns, or intergenic regions.

 SNPs can be neutral, deleterious, or beneficial depending on their effect on gene

function, regulation, or splicing.

 Studying SNPs helps in population genetics, association studies (GWAS),

 pharmacogenomics, and tracing evolutionary history.

SNPs are valuable genetic markers used for:

 Disease association studies (GWAS)

 Population genetics

 Pharmacogenomics (drug response studies)

 Evolutionary and genetic diversity analysis

The dbSNP (Database of Single Nucleotide Polymorphisms) by NCBI provides

comprehensive information on SNPs, including:

 rsID (Reference SNP ID)

 Chromosome position (GRCh38 / GRCh37 assembly)

 Allelic variants (A/T/G/C)

 Gene name and functional class (missense, intron, synonymous, etc.)

 Population frequency and clinical significance (linked to ClinVar)

By searching a gene name in dbSNP, one can explore the number of SNPs discovered in that
gene, their locations, and their potential biological relevance.

2. Human Genome Project (HGP)

The Human Genome Project (HGP) was an international scientific research effort launched
in 1990 and completed in 2003 with the goal of mapping and sequencing the entire human
genome — the complete set of DNA containing all human genes. It was one of the largest
collaborative biological projects ever undertaken, involving scientists from the United States,
United Kingdom, Japan, France, Germany, and China.

The HGP aimed to:

 Determine the complete DNA sequence (about 3 billion base pairs) of the human
genome.

 Identify and map all human genes (~20,000–25,000 genes).

 Store this information in publicly accessible genomic databases.

 Develop new tools for data analysis and bioinformatics.

 Address ethical, legal, and social implications (ELSI) of genomic research.

Key Achievements of HGP:

 Produced the first high-quality reference genome, serving as the foundation for
studying genetic variation among individuals.

 Established a coordinate system for mapping genetic variants such as SNPs,

insertions, deletions, and structural variants.

 Led to the creation of genome assemblies like GRCh37 and GRCh38, which provide
standardized reference sequences for genetic and clinical studies.
  Enabled the discovery of disease-associated genes and genomic regions linked to
inherited disorders.

 Accelerated the growth of personalized medicine, comparative genomics, and

evolutionary biology.

 Resulted in the development of major databases such as GenBank, Ensembl, UCSC

Genome Browser, and dbSNP.

Relation to SNP Analysis:

The HGP laid the groundwork for identifying genomic variants across different populations.
By comparing individual genomes to the reference sequence, researchers can pinpoint Single
Nucleotide Polymorphisms (SNPs) and other genetic differences. These variants help
explain genetic diversity, disease susceptibility, drug response, and evolutionary
relationships.

In summary, the Human Genome Project revolutionized genetics and bioinformatics by

providing a blueprint of human DNA and enabling large-scale studies of genetic variation
using resources like dbSNP and ClinVar.

Procedure

1. Open any web browser and go to the NCBI dbSNP website:

👉 [Link]

2. In the search box, type the gene name of interest (for example, BRCA1, TP53, or
CFTR) and click Search.

3. A result page will appear showing a list of SNPs associated with the selected gene.
Observe the following columns and their meanings:

o SNP ID (rsID): Unique reference number assigned to each SNP (e.g.,

rs80357713).

o Gene Name: The gene where the SNP is located.

o Chromosome and Position: Location of the SNP on the human genome (e.g.,
Chr17:43045629).

o Alleles: The nucleotide variants found at that position (e.g., A/G).

o Variant Type: Whether the SNP is in exon, intron, UTR, or regulatory region.

o Functional Consequence: Indicates if the SNP causes a change in the protein

sequence (missense, nonsense, synonymous, intronic, etc.).

o Global Minor Allele Frequency (MAF): Shows how common the minor
allele is in global populations.

o Links to ClinVar: Shows whether the SNP is known to be associated with any
disease or clinical condition.

4. Click on any rsID (e.g., rs80357713) to open the detailed SNP record page.
Note down the following from the page:

o Chromosome number and position (GRCh38 assembly)

 o Reference and Alternate alleles

o Validation status (by frequency, cluster, or literature)

o Population allele frequencies (for example, 1000 Genomes, gnomAD)

o Clinical significance (e.g., Pathogenic, Benign, Uncertain significance)

o Link to associated gene and PubMed references

Result

 SNPs for the selected gene were successfully identified and analyzed using the NCBI
dbSNP database.

 Each SNP record displayed information about its location, allelic variation,
functional effect, and population frequency.

 The analysis demonstrated how dbSNP provides a detailed catalog of genetic

variations contributing to human diversity, disease susceptibility, and evolutionary
studies.

Experiment No. 4

Aim: To develop basic programming skills in Python focusing on fundamental data structures,
control flow, and operators required for bioinformatics.
Theory:

Python is a high-level programming language widely used in bioinformatics because it is simple,

fast, and supports scientific libraries.
Data types define the kind of value a variable can store. Common data types used in
bioinformatics include strings for storing DNA, RNA, and protein sequences, integers for
counting bases, floats for calculations like GC percentage, and booleans for
true/false checks during sequence comparisons. These data types help manage
different forms of biological data efficiently and allow programmers to perform various
computational operations.
Python provides built-in data structures that help organize and store data efficiently. Lists hold
multiple values like codons or amino acids and can be modified. Tuples are similar but cannot be
changed, useful for fixed biological values like sequence coordinates. Dictionaries store key-
value pairs, such as base counts ({'A':10, 'T':8}), and sets store unique values like distinct amino
acids in a protein. These structures are essential for handling large biological datasets in
bioinformatics.
Control statements in Python decide the flow of a program. Conditional statements like if, elif, and
else help choose actions based on conditions, such as checking if a DNA base is valid. Loops such as for and
while repeat tasks, like scanning every nucleotide in a sequence or counting codons. These statements
enable automation and decision- making, making sequence analysis more efficient.
Operators in Python perform operations on data. Arithmetic operators (+, -, *, /) handle numeric
calculations like computing GC%. Comparison operators (==, >, <) check conditions, e.g.,
whether two sequences match. Logical operators (and, or, not) combine conditions, useful for validating
sequence rules. Membership operators (in, not in) check if a base exists in "ATGC". Operators are central
to building logic in bioinformatics programs.

Procedure

1. Open Jupyter Notebook containing the Python codes for the experiment.

2. Load the notebook environment and ensure Python is working properly.

3. Run each cell step-by-step using the Run button or Shift + Enter.

4. The first codes demonstrate basic Python data types (string, int, float, boolean) by storing
biological values like sequences or numbers.
5. Next, codes implement data structures (lists, tuples, dictionaries, sets) to store and
manipulate biological data such as nucleotide bases, codons, and amino
acids.

6. Control statements (if-else, for, while) are then executed to process sequences, check
conditions, and perform tasks like counting nucleotides.
7. Operators (arithmetic, comparison, logical, membership) are used within the codes to
perform calculations (e.g., GC%), compare values, and validate
sequence data.

8. Outputs for each code cell are observed and interpreted to understand how Python
handles biological information.

9. The notebook is saved after successful execution of all code cells.

Result:

Demonstrated the use of basic data types, data structures, control flow, and operators.
We were able to store DNA sequences, calculate GC content, and check for
palindromic sequences, showing how Python can be applied to simple bioinformatics tasks.

Experiment No. 5

Aim: To practice DNA sequence analysis by counting nucleotide bases, simulating restriction
enzyme cuts and identifying remaining sequences after digestion.
Theory:

Restriction enzymes are specialized proteins found in bacteria that recognize and cut DNA at
specific nucleotide sequences, known as recognition sites. They act as
molecular scissors, helping bacteria defend against viral DNA by breaking it into pieces. In
biotechnology and bioinformatics, restriction enzymes are widely used for DNA cloning, genetic
engineering, and fragment analysis. Each enzyme has a unique cutting pattern, producing either
sticky or blunt ends, which makes them essential tools for manipulating DNA in laboratory
experiments.
In Python, a DNA sequence can be modelled as a string, which lets us count
nucleotide bases, compute GC content, and locate cut sites by searching for
recognition patterns (often with simple substring search or regular expressions). By simulating
digestion—splitting the sequence at each cut site—we can list the resulting fragment lengths and
sequences, and then report any remaining/uncut regions when an enzyme does not find its site.
This combines basic programming (loops, slicing, string methods/regex) with core molecular
biology concepts.

Procedure

1. Open the Jupyter Notebook and run the code cell to enter a DNA sequence from the user.
2. Clean the sequence to keep only valid bases (A, T, G, C) and count the
nucleotides.
3. Enter the restriction enzyme name when prompted.

4. Use the Biopython ([Link]) module to simulate cutting the DNA at the
enzyme's recognition sites.
5. Display the resulting DNA fragments and calculate their lengths.

6. Count nucleotide bases again after digestion and verify that the total base count remains
unchanged.
7. Save the notebook after successful execution.

Result –

The DNA sequence was successfully digested using the selected restriction enzyme, producing
fragments of different lengths. Base counts before and after digestion
remained the same, confirming that restriction cutting splits the sequence without altering the
total nucleotide composition.

Experiment No. 6

Aim: To calculate the GC content of DNA sequences and visualize the nucleotide composition
graphically for sequence characterization.
Theory

GC content is the percentage of guanine (G) and cytosine (C) bases present in a DNA sequence,
and it serves as an important indicator of genome stability, gene expression level, and evolutionary
characteristics. DNA regions rich in GC pairs are more thermally stable due to three hydrogen
bonds between G–C bases compared to two in A–T pairs.
In bioinformatics, GC content calculation helps classify organisms, identify coding regions, and
analyze genome composition. Using Python, a DNA sequence can be processed as a string,
allowing us to count nucleotides and compute GC percentage efficiently. Visualization of
nucleotide composition through graphs further enhances sequence interpretation by providing
insight into base distribution patterns across the DNA sequence.
Procedure

1. Read the DNA sequence FASTA file using Biopython’s SeqIO module.

2. Executed a Python function to calculate the GC content of the sequence.

3. Counted occurrences of each nucleotide (A, T, G, C) from the sequence data.

 4. Used Matplotlib to plot a bar chart showing the nucleotide composition for visual analysis.
5. Verified that the calculated GC percentage and the bar plot correctly
represented the sequence characteristics.
Result

The FASTA sequence was successfully read and processed, and GC content was
accurately calculated using Python. A bar chart visualization clearly showed the relative frequency
of A, T, G, and C bases, helping characterize the nucleotide composition of the DNA sequence.

EXPERIMENT No. 7

AIM: To understand and perform local sequence alignment methods to determine regions of
similarity between DNA or Protein sequences.

THEORY

Local sequence alignment is a computational technique used to identify the most similar
regions between two biological sequences, such as DNA, RNA, or proteins. Instead of
aligning entire sequences, this method focuses specifically on short stretches that share a high
degree of similarity. It is particularly valuable when sequences contain conserved functional
elements, such as protein domains, active sites, or regulatory motifs, embedded within larger
regions that may not be related. Local alignment is well-suited for studying evolutionary
relationships, identifying functional regions in newly sequenced molecules, and
characterizing sequence motifs that are crucial to biological function.

The core idea behind local sequence alignment is to locate and score only the highly similar
subsections between two sequences, ignoring regions that do not contribute to meaningful
similarity. To achieve this, the method uses substitution scoring matrices (e.g., PAM or
BLOSUM for proteins) and predefined penalties for insertions or deletions. The result is an
optimal alignment that highlights biologically relevant similarities while allowing the
algorithm to disregard unrelated or low-similarity segments. In practical research, this
approach forms the foundation of motif detection, protein family analysis, functional
annotation, and comparative genomics.

The most widely used algorithm for performing local sequence alignment is the Smith–
Waterman algorithm, a dynamic programming method that guarantees the highest scoring
local match between two sequences. It systematically evaluates all possible subsequence
alignments and assigns scores based on matches, mismatches, and gaps. The algorithm
constructs a scoring matrix and traces back from the highest scoring cell to determine the
precise local region of similarity. The EMBOSS Water tool can be used for performing local
sequence alignment as it implements the Smith-Waterman algorithm.
Steps involved:

1. Initialization
2. Matrix filling
3. Trace back

Step 1 [Initialization]:

A scoring matrix is created where each row and column represents the two sequences being
compared. One extra row and column are added at the top and left to act as starting points. In
local alignment, all cells in this first row and first column are filled with zero, so the
alignment can start from any position within the sequences. This ensures that no previous
score affects the beginning of the alignment region.

Step 2 [Matrix Filling]:

Each cell in the matrix is filled by calculating a score from four possible values:
 The diagonal value plus a match reward or mismatch penalty
 The value above minus a gap penalty
 The value to the left minus a gap penalty
 Zero

The value for each cell is chosen as the highest among the calculated options. If any
calculated score turns out to be negative, it is changed to zero. This rule makes sure that the
alignment continues only when the sequences are showing real similarity. By doing this, the
algorithm ignores poor matching regions and focuses only on the most similar part of the
sequences. The cell with the highest score in the matrix is noted because it marks the end
point of the best local alignment.

Step 3 [Traceback]:

The traceback starts from the highest scoring cell in the matrix. From there, the path is
followed backwards based on how the score was formed — moving diagonally for a match or
mismatch, upward when there is a gap in one sequence, or left when there is a gap in the
other. This back-tracking continues until a cell with a score of zero is reached. Reaching zero
marks the beginning of the best matching region. The path traced in this way shows the most
similar subsequences between the two sequences.

[PLEASE SOLVE THE THREE QUESTIONS/EXAMPLES GIVEN TO YOU IN CLASS

BY ANUPAMA AFTER WRITING THIS PORTION AND AFTER THAT CONTINUE
WITH THE PROCEDURE]

Procedure:
1. Open a web browser and search for “EMBOSS Water”
2. Select the sequence type (Nucleotide or Protein) depending on the input data.
3. In the first input box, paste or upload the first sequence in FASTA format.
4. In the second input box, paste or upload the second sequence in FASTA format.
5. Select output format
6. Click on the Submit button to start the alignment.
7. Wait for the tool to process the sequences.
8. The alignment results will be displayed on the screen.
9. Observe and record the output.

Result –
Local sequence alignment was successfully performed using EMBOSS Water. The tool
identified the most similar region between the given biological sequences and generated the
optimal local alignment along with identity and similarity statistics.

EXPERIMENT NO. 8

Aim: To understand and perform global sequence alignment methods to determine regions of
similarity between DNA or Protein sequences.

THEORY

Global sequence alignment is a method used to align two biological sequences across their
entire length. The objective is to match each position in one sequence with a corresponding
position in the other, including terminal ends. This approach is useful when the sequences are
of similar length and are expected to be closely related, such as comparing homologous genes
or proteins across species, or aligning isoforms.
The method assigns scores for matches, mismatches, and gaps, and seeks to maximize the
total alignment score over the full span of both sequences. Gap penalties are used to manage
insertions or deletions and to ensure biologically meaningful alignment. Unlike methods that
only highlight a matching region, global alignment ensures that both sequences are aligned
from the first character to the last, producing a complete comparison of similarity and
variation.
The most widely used algorithm for performing global sequence alignment is the Needleman
Wunsch algorithm, a dynamic programming algorithm designed to obtain an optimal global
alignment. It constructs a scoring matrix, applies match/mismatch and gap penalties across
the full length of both sequences, and then performs traceback to generate the final alignment
covering the entire sequence.

There are 3 major steps to perform global alignments:

1. Initialization step
2. Matrix filling
3. Trace back or sequence retrieval

Step 1: INITIALIZATION STEP

A scoring matrix is created representing both sequences. An extra top row and left column are
added. Unlike local alignment, these initial cells are filled by applying gap penalties in a step-
wise manner. This ensures the alignment begins from the first position of both sequences.

Step 2: MATRIX FILLING

Each cell is scored by considering:

 Diagonal movement: match or mismatch score
 Upwards movement: gap penalty
  Leftwards movement: gap penalty
The highest value among these options is selected and filled in the cell. No cell is set to zero
because alignment must cover the full length, and negative scores are allowed to maintain
alignment continuity.

Step 3: TRACEBACK

Traceback begins from the last cell of the matrix (bottom-right corner). The path is traced
backward following the direction of optimal scoring — diagonal for match/mismatch, upward
or leftward for gaps. Traceback continues until the first cell (top-left) is reached. This gives
the complete global alignment between both sequences.

There are three key rules for traceback:

1. If the score is obtained diagonally, we say the two residues are match.
2. If the score is obtained from horizontal plane, then we place a gap in the lower or the
second sequence or the query sequence.
3. And if the score is obtained from vertical plane, we place gap in the upper or the first
sequence or the reference sequence.

[PLEASE SOLVE THE THREE QUESTIONS/EXAMPLES GIVEN TO YOU IN CLASS

BY ANUPAMA AFTER WRITING THIS PORTION AND AFTER THAT CONTINUE
WITH THE PROCEDURE]

Procedure:
1. Open a web browser and search for “EMBOSS Needle”
2. Select the sequence type (Nucleotide or Protein) depending on the input data.
3. In the first input box, paste or upload the first sequence in FASTA format.
4. In the second input box, paste or upload the second sequence in FASTA format.
5. Select output format [Leave at default].
6. Click on the Submit button to start the alignment.
7. Wait for the tool to process the sequences.
8. The alignment results will be displayed on the screen.
9. Observe and record the output.

Result:
Global sequence alignment was successfully performed using EMBOSS Needle, providing a
full-length comparison of the two sequences and indicating overall similarity

Experiment No. 9

Aim: To generate and interpret dot plots for graphical visualization of sequence similarity and
repeated regions using dotmatcher.
Theory-

Dot matrix was deduced by Gibbs and McIntyre in 1970. It is used to give graphical or visual
representation for the alignment of two sequences. The two sequences are arranged on the
horizontal and vertical axis of the matrix. For each match a dot is placed in substitution matrix. The
possibilities to obtain is high if the window size and stringency is very low. These dots result in
formation of diagonals rows that are used to interpret data. The process begins with comparing the
two sequences placed on both the axis. Each residue on the vertical and horizontal plane and as we
get the similarity regions a dot is placed simultaneously. In larger sequences alignment of one-
on-one residue could result in multiple diagonals that can make it difficult to interpret the data.

So, to avoid such circumstances we select a filter method by setting the window size and
stringency or the threshold value. Once these filters are imposed onto the alignment the dot would
only be placed in that window if there are minimal matches.
WINDOW SIZE:
A specific length of segment that are being compared against the query and reference sequence.
STRINGENCY:
The threshold value specified while the input is provided. If the obtained value is higher than or
equal to the threshold value only in that case a dot is placed whereas in case the obtained value is
less than that of threshold value the space is left blank or empty.
This method can be used for effective study of insertion, deletion and repetitions of residues in the
given sequence. But the major disadvantage of graphical representation is it does not involve the
scoring pattern.
There are multiple online tools available to generate a dot matrix:

1. Dotmatcher

2. DNA-strider

3. Dotter

4. Compare and dot plot

Interpretation of Dot Matrix Patterns

a. Single Repeat Sequence / Repeat Sequence

 Single Repeat Sequence: Appears as short diagonal lines parallel to the main
diagonal, showing one region repeated once elsewhere in the sequence.
 Multiple Repeat Sequences: Appear as multiple parallel diagonals, indicating
several repeated regions or tandem repeats in the sequence.

b. Palindromic Sequence
 Shows a diagonal line in the opposite (anti-diagonal) direction, indicating that the
sequence reads the same forward and backward — typical for palindromic DNA
regions.

c. Inverted Repeats
 Appear as off-diagonal lines crossing the main diagonal in the opposite direction,
representing sequences that are reverse complements of each other.

d. Insertions and Deletions

Seen as breaks or gaps in the main diagonal line — insertions cause a shift upward,
deletions cause a shift downward, disrupting perfect alignment.

Procedure:

1. Open DOTMATCHER EMBOSS website.

2. Retrieve FASTA format for both query and reference nucleotide or protein
 sequence and paste them separately in the DOTMATCHER EMBOSS webpage.
3. Set the parameters as default.
4. Submit the data.
5. Alignment is obtained.

Result

Dot plots were successfully generated using dotmatcher, clearly visualizing sequence similarity
and repeated regions. The diagonal alignment indicated conserved regions between sequences,
while scattered dots and breaks revealed mismatches and
possible insertions or deletions.

Experiment No. 10

Aim: To perform and analyse multiple sequence alignments of related sequences using ClustalX
and Clustal Omega tools to infer evolutionary relationships and conserved regions.

Theory –

Clustal is a series of widely used computer programs used in bioinformatics for multiple sequence
alignment. There have been many versions of Clustal over the development of the algorithm.
Clustal X is a user friendly free available online software. Also referred to as Clustal 2 becuase it is
an improved version of Clustal W. basically it is graphical version of Clustal W. Used for the
identification of evolutionary and functional relationship by aligning them to identify conserved
regions and gaps.

It uses progressive alignment methods, which align the most similar sequences first and work
their way down to the least similar sequences until a global alignment is created. Clustal X is a
matrix-based algorithm. In these, the sequences with the best alignment score are aligned first, then
progressively more distant groups of sequences are aligned.

This heuristic approach is necessary due to the time and memory demand of finding the global
optimal solution. The first step to the algorithm is computing a rough distance matrix between
each pair of sequences, also known as pairwise sequence alignment. The next step is a neighbor-
joining method that uses midpoint rooting to create an overall guide tree. It offers multiple file
formats in which the output of the alignment results can be generated. But Clustal format is
preferred the most.

Clustal Omega is a widely used bioinformatics tool for performing multiple sequence alignment
(MSA) of DNA, RNA, or protein sequences. It uses advanced algorithms,
including progressive alignment and guide trees, to align sequences efficiently and accurately,
even for large datasets. By identifying conserved regions, mutations, and evolutionary relationships,
Clustal Omega helps researchers analyze sequence similarity, build phylogenetic insights, and
study functional or structural conservation across species.

Procedure –
Clustal X –
 1. Open ClustalX software on your system.

2. Click File → Load Sequences and select your FASTA sequence file (or load
sequences one by one).
3. The sequences will appear in the main window—confirm all sequences are loaded
correctly.
4. Go to Alignment → Do Complete Alignment or click the Align button.

5. Wait for the software to process the sequences and generate the alignment.

6. View the aligned sequences in the output window; conserved regions will be
highlighted.
7. To save the alignment, go to File → Save Alignment As, and choose a format (e.g., .aln
or .fas).

Clustal Omega –

1. Open Clustal Omega website.

2. Input your sequences by pasting FASTA sequences in the text box or uploading a FASTA
file that contain all sequences.
3. Select output format if needed (default alignment format is usually sufficient).

4. Click the Submit / Align button to start the alignment.

5. Wait while the tool processes and aligns the sequences.

6. View the aligned sequences shown on the results page; conserved regions will appear
aligned in columns.
7. Download the alignment file for further analysis.

Result –

Multiple sequence alignment was successfully performed using both ClustalX and Clustal
Omega. Conserved regions and sequence similarities were clearly identified, and the aligned
output highlighted evolutionary relationships among the sequences.