Mapping clones with a given ordering or interleaving
- McMaster Univ., Hamilton, Ontario (Canada)
- Univ. of Washington, Seattle, WA (United States)
We study the problem of constructing a most compact physical map for a collection of clones whose ordering or interleaving on a DNA molecule are given. Each clone is a contiguous section of the DNA and is represented by its fingerprint obtained from biochemical experiments. In this paper, the fingerprint of a done is either a multiset containing the sizes of the restriction fragments occurring in the clone in single complete digest mapping or a multiset containing the short oligonucleotide probes occurring in the clone in mapping by hybridization of probes. Our goal is to position the clones and restriction fragments on the DNA consistently with the given ordering or interleaving so that the total number of restriction fragments required on the DNA is neighbored. We first formulate this as a constrained path cover problem on a multistage graph. Using this formulation, it is shown that finding a most compact map for clones with a given ordering is NP-hard. The approximability of the problem is then considered. We present a simple approximation algorithm with ratio 2. This is in fact the best possible as the above NP-hardness proof actually shows that achieving ratio 2 - {epsilon} is impossible for any constant {epsilon} > 0, unless P = NP. We also give a polynomial time approximation scheme when the multiplicity is bounded by one. The exact complexity of the problem in this special case is presently unknown. Finally we consider the mapping problem when an interleaving is given which depicts how the clones overlap with each other on the DNA. In the case of restriction fragment data, it is shown that finding a consistent map is NP-complete even if the multiplicity is bounded by 3. This may suggest that information about the interleaving of clones does not necessarily make the problem computationally easier in single complete digest mapping.
- OSTI ID:
- 471696
- Report Number(s):
- CONF-970142-; CNN: Grant OGP0046613; Grant GO-12278; TRN: 97:001377-0045
- Resource Relation:
- Conference: 8. annual Association for Computing Machinery (ACM)-Society for Industrial and Applied Mathematics (SIAM) symposium on discrete algorithms, New Orleans, LA (United States), 5-7 Jan 1997; Other Information: PBD: 1997; Related Information: Is Part Of Proceedings of the eighth annual ACM-SIAM symposium on discrete algorithms; PB: 798 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
High-resolution physical mapping of a 250-kb region of human chromosome 11q24 by genomic sequence sampling (GSS)
An algorithmic approach to multiple complete digest mapping