Practice question
Question
Which algorithm is used for global alignment?
Explanation
Global alignment aligns entire sequences end-to-end maximizing overall similarity, suitable for similar length sequences. Needleman-Wunsch dynamic programming uses scoring matrix and gap penalties to find optimal global alignment. Smith-Waterman finds local alignments, therefore Needleman-Wunsch is correct for global strategy.
Related blogs
Guides and insights connected to this topic
PYR Test: Principle, Media, Steps, Results, Uses
Introduction to the PYR TestThe PYR test (Pyrrolidonyl Arylamidase test) is an essential biochemical assay used primarily for the identifica...
How Covishield cause Heart Attack?
IntroductionThe SARS-CoV-2 pandemic has been one of the most significant global health crises in human history. While numerous therapeutic s...
STUDY OF COMPOUND MICROSCOPE
INTRODUCTION The word microscope is derived from two Greek words ‘micro’ meaning small and ‘scope” meaning to view. In other words a microsc...
Discussion
Comments
Please log in to join the discussion.
Login to commentNo comments yet. Be the first to start the discussion.