2012
DOI: 10.1016/j.ic.2012.02.003
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing restriction site placement for synthetic genomes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…He suggests a dynamic programming algorithm that is exponential in the length of the longest restriction site and proves that the problem is NP-complete for non-fixed restriction site lengths. Another related problem is the Unique Restriction Site Placement Problem (URSPP) presented in [19]. The objective in this problem is to allow only one restriction site for any given restriction enzyme, keep the translated sequence of amino acids unchanged, and minimize the maximum gap between adjacent restriction sites.…”
Section: Theoretical Analysis Of Related Problemsmentioning
confidence: 99%
See 1 more Smart Citation
“…He suggests a dynamic programming algorithm that is exponential in the length of the longest restriction site and proves that the problem is NP-complete for non-fixed restriction site lengths. Another related problem is the Unique Restriction Site Placement Problem (URSPP) presented in [19]. The objective in this problem is to allow only one restriction site for any given restriction enzyme, keep the translated sequence of amino acids unchanged, and minimize the maximum gap between adjacent restriction sites.…”
Section: Theoretical Analysis Of Related Problemsmentioning
confidence: 99%
“…They do not provide a detailed description of their algorithm and specifically how they avoid creating new restriction sites. Both [23] and [19] give higher priority to avoiding changes in the translated amino acid sequence over the number or placement of restriction sites.…”
Section: Theoretical Analysis Of Related Problemsmentioning
confidence: 99%
“…Restriction site and other pattern placement/elimination is an NP-hard problem in its general form (Montes et al, 2010 ). Because most patterns have sufficient length to occur sparsely by chance, in conjunction with the small number of patterns that are usually targeted when designing genes, the problem of incorporating and eliminating patterns becomes trivial, and as a singular objective it has a linear time complexity as a function of sequence length.…”
Section: Gene Design Objectives and Algorithmsmentioning
confidence: 99%