Solutions of Theory of Algorithms assignment15.2-4

Solutions of Theory of Algorithms assignment15.2-4 - and...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Solutions of Theory of Algorithms Assignment 3 Exercise 15.4-4 As elements of c at index i and j is computed using elements from I, i-1, j,
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: and j-1, therefore we can compute the length of an LCS using only 2 min( m , n ) entries in the c table...
View Full Document

This note was uploaded on 11/09/2010 for the course CS 11841 taught by Professor Dr.ayman during the Spring '09 term at Alexandria University.

Ask a homework question - tutors are online