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 Badcoe, I.G.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Badcoe, I.G.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

A fast algorithm for counting the arrangements for packing identical items on a one-dimensional grid with application in DNA—protein and similar interactions

I.G. Badcoe *

Molecular Recognition Centre and Department of Biochemistry, University of Bristol Medical School, University Walk Bristol BS8 1TD. UK

*To whom reprint requests should be sent

An algorithm is described, originally developed for use with DNA–protein complexes, which precisely counts the number of possible arrangements for non-overlapping items, each occupying M points, on a lattice of N such points. The algorithm counts the total number of arrangments for a given number of items and can be readily extended to count the number of arrangements which meet an additional criterion. Examples are given of two such classifications and of the application of one of them to a problem in DNA–protein interactions.

Received on August 9, 1991; accepted on January 9, 1992

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.