PubMed · 2059851
A generic algorithm for finding restriction sites within DNA sequences.
Abstract
This paper describes a generic algorithm for finding restriction sites within DNA sequences. The 'genericity' of the algorithm is made possible through the use of set theory. Basic elements of DNA sequences, i.e. nucleotides (bases), are represented in sets, and DNA sequences, whether specific, ambiguous or even protein-coding, are represented as sequences of those sets. The set intersection operation demonstrates its ability to perform pattern-matching correctly on various DNA sequences. The performance analysis showed that the degree of complexity of the pattern matching is reduced from exponential to linear. An example is given to show the actual and potential restriction sites, derived by the generic algorithm, in the DNA sequence template coding for a synthetic calmodulin.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
K Y Jiang, J Zheng, S B Higgins. 1991. A generic algorithm for finding restriction sites within DNA sequences.. https://doi.org/10.1093/bioinformatics%2F7.2.249. https://pubmed.health/record/pubmed%3A2059851/a-generic-algorithm-for-finding-restriction-sites-within-dna-sequences
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite PubMed Health by Indiciae: BibTeX · RIS.