Comparing DNA Sequences By Dynamic Programming In Sequential And Parallel Computer Environments
Unknown
January 1, 2006
Cited by 4
Abstract
Comparing two sequences by using dynamic programming algorithms is studied. Both serial and (multiple processor) parallel computer algorithms are discussed. Numerical performance of the developed software is validated through small to large-scale applications. Results (based upon comparing 2 large sequences with 40,000 and 36,000 character length, respectively, and using 2-24 parallel processors) indicate that the developed software is reliable and highly efficient.