MULTIPLE SOLUTIONS OF DNA RESTRICTION MAPPING PROBLEMS

被引：24

作者：

SCHMITT, W ^{[1
]}

WATERMAN, MS ^{[1
]}

机构：

[1] UNIV SO CALIF, DEPT MATH, LOS ANGELES, CA 90089 USA

来源：

ADVANCES IN APPLIED MATHEMATICS | 1991年 / 12卷 / 04期

基金：

美国国家科学基金会; 美国国家卫生研究院;

关键词：

D O I：

10.1016/0196-8858(91)90028-H

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The construction of a restriction map of a DNA molecule from fragment length data is known to be NP hard. However, it is also known that under a simple model of randomness the number of solutions to the mapping problem increases exponentially with the length of the DNA molecule. In this paper we define a hierarchy of equivalence relations on the set of all solutions to the mapping problem and study the combinatorics and characterization of the equivalence classes. © 1991.

引用

页码：412 / 427

页数：16

共 7 条

[1] MAPPING THE ORDER OF DNA RESTRICTION FRAGMENTS [J].