Gillett W, Daues J, Hanks L, Capra R
Department of Computer Science, Washington University, St. Louis, MO 63130, USA.
J Comput Biol. 1995 Summer;2(2):185-205. doi: 10.1089/cmb.1995.2.185.
In the process of constructing high-resolution restriction maps via greedy algorithms, a classical anomaly, known as fragment collapsing, introduces errors into the maps that impedes further map assembly. Fragment collapsing occurs when two different genomic fragments of approximately the same length and occurring in the digestion of two different overlapping clones are incorrectly identified as representative of a single genomic fragment. This introduces a single fragment of commensurate length into an incorrect position in the map. The present work describes techniques for detecting and correcting such anomalies.
