BIF501 Bioinformatics II Assignment No 02 Fall 2020 Solution / Discussion

[+ M.Tariq Malik]

BIF501 Bioinformatics II Assignment No 02 Fall 2020 Solution / Discussion

[+ M.Tariq Malik]

Share the Assignment Questions & Discuss Here.... 

Stay touched with this discussion, Solution idea will be uploaded as soon as possible in replies here before the due date.

[+ M.Tariq Malik]

one mor solution file 

BIF501-assignment-2-solution

Click on the below link to download the file

BIF501-assignment-2-solution.pdf

[+ M.Tariq Malik]

BIF501_Assignment_No_02_Solution_Fall_2020

Click on the below link to download the file

BIF501_Assignment_No_02_Solution_Fall_2020

[+ M.Tariq Malik]

BIF501 assignment 2 solution 2020

BIF501 assignment 2 solution 2021

Dear students download solution file from the link which is available at the end of the page thanks.

Note read carefully.

Aslam u alaikum dear students welome on my website and  please allow notification so that you can get a notification when I upload a new solution of many latest assignment, GDB or quizzes solution. If that nootification is related to your subject then visit the website otherwise you can ignore that notificqation.

 

A. Explain pairwise alignment and its type? With at least 2 examples? (5)
Answer: The process of lining up two sequences to achieve maximal levels of identity (and
conservation, for amino acid sequences) for the purpose of assessing the degree of similarity and the
possibility of homology.
• Optimal global alignment methods allow the best overall score for the comparison of the two
sequences to be obtained, including a consideration of gaps.
• Optimal local alignment algorithms seek to identify the best local similarities between two sequences
but, unlike segment methods, include explicit consideration of gaps.
there are two types of pair alignments.
1. Global
2. Local
Global
Needleman-Wunsch global alignment.
A global alignment is one that compares the two sequences over their entire lengths, and is appropriate
for comparing sequences that are expected to share similarity over the whole length.
Needleman-Wunsch [] algorithm for global alignmen

Smith-Waterman local alignment
Local
In Local alignment we compare one whole sequence with the one portion of other like this.
A second comparison method, local alignment, searches for regions of local similarity and need not
include the entire length of the sequences. Local alignment methods are very useful for scanning
databases or when you do not know that the sequences are similar over their entire lengths. The
EMBOSS program water is a rigorous implementation of the Smith Waterman algorithm for local
alignments [].

 

GET THE IDEA AND MAKE YOUR OWN ASSIGNEMNT PLEASE TO AVOID THE ZERO MARKS.

bif501 assignment no. 2 solution

bif501 assignment 2 solution

bif501 assignment 2 solution 2020

bif501 assignment NO2 solution 2021

BIF501 assignment 2 solution 2021

DOWNLAOD SOLUTION FILE FROM HERE

[+ M.Tariq Malik]

one mor solution file 

BIF501-assignment-2-solution

Click on the below link to download the file

BIF501-assignment-2-solution.pdf