Skip Navigation

This Article
Right arrow Full Text (Print PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ho, S. T. S.
Right arrow Articles by Yee, C. N.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Ho, S. T. S.
Right arrow Articles by Yee, C. N.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© IRL Press at Oxford University Press

Restriction site mapping for three or more enzymes

Shirley T. S. Ho , Lloyd Allison and Chut N. Yee

Department of Computer Science, Monash University Clayton, Victoria, Australia 3168

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 (≥3) into subproblems. The constraint checker is based on separation theory. Some insights into the extent of constraint checking involved in and the 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.

Received on July 30, 1989; accepted on April 4, 1990

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.