Research Poster

hordeprobableΒιοτεχνολογία

4 Οκτ 2013 (πριν από 3 χρόνια και 8 μήνες)

68 εμφανίσεις

Bioinformatics:

Sequence Alignment

Carmen
Nigro



The above figure is a graphical representation of the
Needleman
-
Wunsch

algorithm., which is based on
dyanmic

programming. The algorithm produces the optimal global
alignment based on the scoring function pictured on the left.


Each diagonal edge corresponds to
a character match, whether they
are identical or not


Each down edge corresponds to a
gap in string 2


Each across edge corresponds to a
gap in string 1


The goal is to find the path from
start to end that would give the
largest value


Weights of the arcs are
determined by the scoring function

Scoring Functions


Allow for different alignments to
be compared


There may be different match
costs
(green numbers)


There may be different mismatch
costs
(red numbers)


There may also be different gap
costs
(blue numbers)

Needleman
-
Wunsch

and
Smith
-
Waterman
Algorithms


Both are dynamic programming
approaches


Needleman

Wunsch



䝬潢慬G慬楧湭敮a


Smith
-
Waterman


䱯捡氠慬楧湭敮a