/**********************************************************************
 *  readme template                                                   
 *  DNA Sequence Alignment
 **********************************************************************/

Name:
Login:

Hours to complete assignment (optional):

/**********************************************************************
 *  Explain what you did to find the alignment itself.
 **********************************************************************/



/**********************************************************************
 *  How much main memory does your computer have? Typical answers
 *  are 256MB, 512MB, and 1GB.
 **********************************************************************/


/**********************************************************************
 *  For each data file, fill in the edit distance computed by your
 *  program and the amount of time it takes to compute it. If your
 *  program cannot execute on your system because of insufficient
 *  memory, indicate this instead.
 **********************************************************************/

data file           distance       time (seconds)
-------------------------------------------------
ecoli2500.txt
ecoli3000.txt
ecoli5000.txt
ecoli7000.txt
ecoli10000.txt


/**********************************************************************
 *  As a function of the string length N (assume M = N), estimate the
 *  running time of your program in seconds. Your answer should have the
 *  form a * N^b for some constants a and b. Explain how you arrived
 *  at your answer.
 *
 *  What is the largest N your program can handle if it is limited to 1
 *  day of computation. Assume you have as much main memory as you need.
 **********************************************************************/
a = 
b = 
largest N = 

/**********************************************************************
 *  As a function of the string length N (assume M = N), estimate the
 *  amount of memory used in bytes. Your answer should have the
 *  form a * N^b for some constants a and b. Assume char = 2 bytes, and
 *  int = 4 bytes. Justify your answer.
 *
 *  What is the largest N that your program can handle if it is
 *  limited to 1GB (billion bytes) of memory. 
 **********************************************************************/
a =
b = 
largest N =