Answer / Shrikant Gupta

The Needleman-Wunsch algorithm is a dynamic programming algorithm for global sequence alignment. It compares two sequences and finds an optimal alignment with the highest score, taking into account both substitutions and gaps. The algorithm calculates scores for each possible alignment path using a matrix of scores for matching characters, mismatching characters, inserting a gap, and deleting a gap.

can u give me an example of a project you were involved with that illustrates your interest and skills in bringing people together?

1 Answers   AgriGold,

---

How to run DOCK 6 using cygwin?

2 Answers  

---

What is the Sequence for cd44v6?

1 Answers  

---

Draw the E-R diagram for the database of a departmental store having the following relational database scheme Employees(e-no, address) Department(d-name) work-n(e-no, d-name) Looking-after(d-name, e-no) Item (item-no, brand-name, model-no, cost-price, sale-price)

1 Answers  

---

A catalyst (a)always slows down the reaction (b)always starts a rection that would not have ocurred at all otherwise (c)causes changes in the rate of the reaction (d)changes the quantities of the products formed.

1 Answers   Wipro,

---

Image of point (3,8) in the line x + 3y = 7 is (a) (-1,-4) (b) (-1,4) (c) (2,-4) (d) (-2,-4)

1 Answers   3i Infotech, Wipro,

---

what is e value?

4 Answers  

---

Define COG and KOG ?

1 Answers  

---

Explain Homology modelling?

1 Answers  

---

Tell us about three kinds of DNA?

3 Answers  

---

What is PatternHunter?

1 Answers  

---

How can i do the Homology Modeling of GPCR receptor successfully? My target identity with template is only 27%

4 Answers  

---