Electrical & Computer Engineering, Department of
Date of this Version
2003
Citation
Pub. No.: US 2003/0224384 A1
Pub. Date: Dec. 4, 2003
Abstract
The present invention provides a new algorithm for assembling fragments from a long DNA sequence. The algorithm of the invention Solves simultaneously fragment assembly-related problems. Such as the fragment orientation, overlap and layout phases. This is achieved by clustering fragments with respect to their Average Mutual Information (AMI) profiles using the k-means algorithm.
COinS
Comments
Sayood et al.
US 2003/0224384 A1