bioinformatics - Prove that L >= G for Local and Global alignments of a specific function -

I am taking a bioinformatics class in this semester and I have trouble with a specific question from the book.

* Considering the two DNA sequential, S and T, define the same length of N and let the scoring function as follows: match = 1, mismatch = -1, indel = -2 value Take that G and L are the scores of an optimal global alignment and an optimum local alignment between S and T, respectively.

Prove that L> = G

I understand how to find the related alignment of two random scenes, but I am having trouble in proving this. As far as I can say it is true. G will never be more than the LL because the Indal Penalty is so high and the match is not getting ready for it. I had to produce an example to prove that they could be equal, so I know that this is true.

So yes, how great a sign will be about this.

Well, this site is not doing us homework, but this is a simple question There is a crack on this: / P>

We assume that the points that you originally made are valid (about scoring).

On the contrary, let's assume there is some local alignment that is less than G. If this is true, then it means that your best local alignment (i.e. you are far from the beginning or end of the G) is actually less efficient than your global alignment. But we know that this can not be a case because the local alignment is a subset of your global alignment (worst position, your local alignment is your global alignment)

So we prove that in this statement There is no count.

Hope that makes sense!