Smith-Waterman Algorithm
oueltligetca ortrocce
Smith-Waterman Algorithm
Smith-Waterman Algorithmì Dynamic Programmingì´ë¼ë ì Âì°ÃÂÂì ìÂÂ고리즠ì¤Âì ÃÂÂëÂÂë¡ ê°ÂìÂÂ¥ ê°Âë¨Ã Ã´ëµì ìÂÂê³ ìÂÂê³ , ê·¸ ôëµì ì´ì©Ã´ ì Âì Â
ë Ã° ë²ÂìÂÂë¡ ÃÂÂìÂÂ¥ ìÂÂì¼ÂëÂÂê°Âë©´ì ë§Âì§Â맠ôëµì ìÂȑ 경ì°ì ì“©ëÂÂë ìÂÂ고리ì¦Âì´ë¤. ê°ÂìÂÂ¥ ê°Âë¨Ã t(ÃÂÂ)ê³¼ s(ì´)ì 첫ë²Â째 ìÂÂì´ì ì Âì Âà배ì´ì ëÂÂÃÂÂ
ôëµì ì½겠ìÂȓÂÂì ìÂÂê³ , ê·¸ ê°Âì 근거론ÃÂÂì¬ Ã´ëµì ì Âì  ÃÂÂìÂÂ¥ ìÂÂì¼ ì Âì²´ ìÂÂì´ì ì Âì Âà배ì´론구ÃÂÂÃÂÂë ê²Âì´ë¤.
http://biocc.ngic.re.kr/Biopedia/Biowiki/images/c/cb/Smith.gif
# 참고쓴ø
http://www.maths.tcd.ie/~lily/pres2/sld009.htm