Scribd Logo
Upload

Welcome to Scribd!

  • 48 views

    Anna University:: Chennai - 600 025 Model Question Paper

    Uploaded by

    rahul
    This document is a model question paper for the sixth semester B.Tech course in Industrial Bio-Technology. It contains two sections - Section A consists of 10 short answer questions worth 2 marks each for a total of 20 marks. Section B contains 5 long answer questions worth 16 marks each for a total of 80 marks. Question 11 is compulsory and covers an algorithm for global alignment of strings using the Needleman-Wunsch algorithm. The other questions cover topics like ultrametric tree construction, database searching, multiple sequence alignment, gene finding, DNA assembly, clustering methods, and challenges in bioinformatics.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Anna University:: Chennai - 600 025 Model Question Paper

    Uploaded by

    rahul
    48 views2 pages
    This document is a model question paper for the sixth semester B.Tech course in Industrial Bio-Technology. It contains two sections - Section A consists of 10 short answer questions worth 2 marks each for a total of 20 marks. Section B contains 5 long answer questions worth 16 marks each for a total of 80 marks. Question 11 is compulsory and covers an algorithm for global alignment of strings using the Needleman-Wunsch algorithm. The other questions cover topics like ultrametric tree construction, database searching, multiple sequence alignment, gene finding, DNA assembly, clustering methods, and challenges in bioinformatics.

    Original Description:

    Srm

    Original Title

    3587-9-2012-09-16865491

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is a model question paper for the sixth semester B.Tech course in Industrial Bio-Technology. It contains two sections - Section A consists of 10 short answer questions worth 2 marks each for a total of 20 marks. Section B contains 5 long answer questions worth 16 marks each for a total of 80 marks. Question 11 is compulsory and covers an algorithm for global alignment of strings using the Needleman-Wunsch algorithm. The other questions cover topics like ultrametric tree construction, database searching, multiple sequence alignment, gene finding, DNA assembly, clustering methods, and challenges in bioinformatics.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    48 views2 pages

    Anna University:: Chennai - 600 025 Model Question Paper

    Uploaded by

    rahul
    This document is a model question paper for the sixth semester B.Tech course in Industrial Bio-Technology. It contains two sections - Section A consists of 10 short answer questions worth 2 marks each for a total of 20 marks. Section B contains 5 long answer questions worth 16 marks each for a total of 80 marks. Question 11 is compulsory and covers an algorithm for global alignment of strings using the Needleman-Wunsch algorithm. The other questions cover topics like ultrametric tree construction, database searching, multiple sequence alignment, gene finding, DNA assembly, clustering methods, and challenges in bioinformatics.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    ANNA UNIVERSITY :: CHENNAI – 600 025

    MODEL QUESTION PAPER


    VI - SEMESTER
    B.TECH. INDUSTRIAL BIO-TECHNOLOGY
    IB341 - BIOINFORMATICS

    Time: 3hrs Max Marks: 100

    Answer ALL Questions


    PART – A (10 x 2 = 20 marks)

    1. Given 2 strings ”SWALN” and “CRWLNA” give an alignment, edit distance and
    edit transcript for it. If the cost of replacement is – 1 and the cost of an indel is –2
    what is the weighted edit distance?
    2. 2 alignments have the same edit distance. Will the score of the alignments also be
    the same?
    3. What are sequence motifs? Give an example.
    4. Name 2 protein databases. What is cross-referencing in databases.
    5. What is basecalling? How do they resolve sequencing errors in genome
    sequencing projects?
    6. What does the number 62 signify in the substitution matrix BLOSUM62?
    7. Define raw score, bit score and e-value in BLAST.
    8. What are the features of a multiuser operating system?
    9. What is annotation?
    10. Construct a profile with the following multiple sequence alignment
    R G M _ A
    R G A G A
    R M M G _
    M G _ G M
    A G A R A

    PART – B (5 x 16 = 80 marks)
    Question 11 is compulsory

    11. Describe an algorithm for global alignment of strings. Align the two strings
    LLNCDR and LRCDN globally using the Needleman and Wunsch algorithm

    12. Discuss the ultrametric tree construction. What kind of data is used to build such a
    tree? Do the data points 6,3,3 qualify to be ultrametric?

    (OR)
    What are the heuristic methods employed for database searching. Explain Gapped
    Blast. What are the applications of such database searches.

    13. What is the biological basis for multiple sequence alignment? Explain the various
    applications of multiple sequence alignment.

    (OR)

    What are the various parameters used in insilico gene finding approaches? Name
    two software used for gene finding.

    14. Write short notes on


    a) Shotgun DNA assembly
    b) PSI BLAST

    (OR)

    Write short notes on


    a) Gap penalty
    b) UPGMA clustering method

    15. What are the challenges in bioinformatics in the post genomic era?

    (OR)

    Discuss physical and genetic mapping procedures.

    -----

    You might also like