Switch to
| Predicate | Object |
|---|---|
| rdf:type | |
| lifeskim:mentions | |
| pubmed:issue |
3
|
| pubmed:dateCreated |
1990-11-5
|
| pubmed:abstractText |
Restriction site mapping requires a generator to put forward possible maps and a constraint checker to reject false maps. Ideally these combine to give an algorithm which calculates a sound and complete solution set. Three algorithms for generation are presented and compared. Two decompose a multi-enzyme problem (greater than or equal to 3) into subproblems. The constraint checker is based on separation theory. Some insights into the extent of constraint checking involved in and feasibility of more checking for three or more enzymes are discussed. The trade-off between computation time and the soundness of the solution set is examined.
|
| pubmed:language |
eng
|
| pubmed:journal | |
| pubmed:citationSubset |
IM
|
| pubmed:chemical | |
| pubmed:status |
MEDLINE
|
| pubmed:month |
Jul
|
| pubmed:issn |
0266-7061
|
| pubmed:author | |
| pubmed:issnType |
Print
|
| pubmed:volume |
6
|
| pubmed:owner |
NLM
|
| pubmed:authorsComplete |
Y
|
| pubmed:pagination |
195-204
|
| pubmed:dateRevised |
2006-11-15
|
| pubmed:meshHeading | |
| pubmed:year |
1990
|
| pubmed:articleTitle |
Restriction site mapping for three or more enzymes.
|
| pubmed:affiliation |
Department of Computer Science, Monash University, Clayton, Victoria, Australia.
|
| pubmed:publicationType |
Journal Article
|