Imperfectness of Data for STS-Based Physical Mapping [chapter]

Hiro Ito, Kazuo Iwama, Takeyuki Tamura
IFIP International Federation for Information Processing  
In the STS-based mapping, we are requested to obtain the correct order of probes in a DNA sequence from a given set of fragments or equivalently a hybridization matrix A. It is well-known that the problem is formulated as the combinatorial problem of obtaining a permutation of A's columns so that the resulting matrix has the consecutive-one property. If the data (the hybridization matrix) is error free and includes enough information, then the above column order determines the correct order of
more » ... he probes uniquely. Unfortunately this is no longer true if the data include errors, which has been one of the popular research targets in computational biology. Even if there is no error, ambiguities in the probe order may still remain. This in fact happens by the lack of some information of the data, but almost no further investigation was made previously. In this paper, we define a measure of such imperfectness of the data as a minimum amount of additional fragments which are needed to fix the probe order uniquely. Several polynomial-time algorithms to compute such additional fragments of minimum cost are presented.
doi:10.1007/1-4020-8141-3_23 dblp:conf/ifipTCS/ItoIT04 fatcat:2tc6gduaa5grxdpydnvvfhh2s4