Abstract

In this paper, we briefly describe a prototype of the software system we have developed for multiple whole genome alignment. To develop our algorithm, we have to solve several problems including decomposition of genomes with a suffix tree, finding an LIS for multiple MUM sequences, and iterative pairwise multiple sequence alignment. This results in an overall linear time complexity for our algorithm for finding conserved regions; and between linear and quadratic time complexity for multiple whole genome alignment. One application is the problem of finding a maximum set of conserved regions in closely related microorganisms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call