DNA Recombination by XPCR

Franco, Giuditta; Manca, Vincenzo; Giagulli, Cinzia; Laudanna, Carlo

doi:10.1007/11753681_5

Cited by 9 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An experimental analysis of both basic and multiple XPCR protocols, previously introduced [6,5,8,14,7], has been carried out in this work, where limits and potentialities of the techniques to concatenate several genes have been outlined. As a biological setting, we have worked with the three genes dbtAa (1019 Fig.…”

Section: Discussionmentioning

confidence: 99%

“…Recombination of two DNA strings along with a (given) common substring γ may be efficiently implemented by XPCR γ (or γ-cross-pairing PCR [6]), as well as other procedures (such as DNA extraction, combinatorial libraries generation, and mutagenesis [6,5,8,14,7]) which can be described in terms of null context splicing rules. These are rewriting rules introduced by T. Head in the context of Formal Language Theory (FLT) as particular H-systems, inspired by selective recombination induced by few (existent in nature) restriction enzymes [9]: αXγY β, αV γW β → αXγW β, αV γY β Such rule may be seen as a specific chimeras generation method, which we briefly call γ-recombination.…”

Section: Xpcr Protocolmentioning

confidence: 99%

“…Fig. 3: Amplification by means of XPCR γ (from [8]). Long strands in the middle are seeds of exponential amplification, newly produced at every iteration within PCR.…”

Section: Xpcr Protocolmentioning

confidence: 99%

See 2 more Smart Citations

Experimental Analysis of XPCR-based protocols

Franco,

Bellamoli,

Lampis

2017

Preprint

Self Cite

View full text Add to dashboard Cite

This paper reports some experimental results validating in a broader context a variant of PCR, called XPCR, previously introduced and tested on relatively short synthetic DNA sequences. Basic XPCR technique confirmed to work as expected, to concatenate two genes of different lengths, while a library of all permutations of three different genes (extracted from the bacterial strain Bulkolderia fungorum DBT1) has been realized in one step by multiple XPCR. Limits and potentialities of the protocols have been discussed, and tested in several experimental conditions, by aside showing that overlap concatenation of multiple copies of one only gene is not realizable by these procedures, due to strand displacement phenomena. In this case, in fact, one copy of the gene is obtained as a unique amplification product.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Xpcr Protocolmentioning

confidence: 99%

See 1 more Smart Citation

Experimental Analysis of XPCR-based protocols

Franco,

Bellamoli,

Lampis

2017

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the context of experimental DNA computing, overlap assembly was used in, e.g., [7,12,24,32] for the formation of combinatorial DNA or RNA libraries. Overlap assembly can also be viewed as modeling a special case of an experimental lab procedure called cross-pairing PCR, introduced in [15] and studied in, e.g., [13,14,16,27].…”

Section: Introductionmentioning

confidence: 99%

State Complexity of Overlap Assembly

Brzozowski

Kari

Bai

et al. 2018

Implementation and Application of Automata

View full text Add to dashboard Cite

The state complexity of a regular language Lm is the number m of states in a minimal deterministic finite automaton (DFA) accepting Lm. The state complexity of a regularity-preserving binary operation on regular languages is defined as the maximal state complexity of the result of the operation where the two operands range over all languages of state complexities ≤ m and ≤ n, respectively. We find a tight upper bound on the state complexity of the binary operation overlap assembly on regular languages. This operation was introduced by Csuhaj-Varjú, Petre, and Vaszil to model the process of self-assembly of two linear DNA strands into a longer DNA strand, provided that their ends "overlap". We prove that the state complexity of the overlap assembly of languages Lm and Ln, where m ≥ 2 and n ≥ 1, is at most 2(m − 1)3 n−1 + 2 n . Moreover, for m ≥ 2 and n ≥ 3 there exist languages Lm and Ln over an alphabet of size n whose overlap assembly meets the upper bound and this bound cannot be met with smaller alphabets. Finally, we prove that m + n is a tight upper bound on the overlap assembly of unary languages, and that there are binary languages whose overlap assembly has exponential state complexity at least m(2 n−1 − 2) + 2. /15/B/ST6/00615.3 Informally, during a shuffle between two words with a trajectory over {0, 1, σ} + , the symbols of the trajectory are interpreted as follows: 0 (respectively 1) signifies that the corresponding letter from the first (respectively second) word is retained, and σ signifies that a letter from the first word is retained, provided it coincides with the corresponding letter in the second word.

show abstract

“…In the context of experimental DNA computing, overlap assembly was used in, e.g., [10,11,12,13] for the formation of combinatorial DNA or RNA libraries. Overlap assembly can also be viewed as modelling a special case of an experimental procedure called cross-pairing PCR, introduced in [14] and studied in, e.g., [15,16,17,18]. This paper is a continuation of the theoretical analysis of overlap assembly as a formal language operation, that was started in [1] and [2].…”

Section: Introductionmentioning

confidence: 99%

Further remarks on DNA overlap assembly

Enaganti

Ibarra

Kari

et al. 2017

Information and Computation

View full text Add to dashboard Cite

The operation of overlap assembly was defined by Csuhaj-Varju, Petre, and Vaszil as a formal model of the linear self-assembly of DNA strands: The overlap assembly of two strings, xy and yz, which share an "overlap" y, results in the string xyz. This paper continues the exploration of the properties of the overlap assembly operation by investigating closure of various language classes under iterated overlap assembly, and the decidability of the completeness of a language. It also investigates the problem of deciding whether a given string is terminal with respect to a language, and the problem of deciding if a given language can be generated by an overlap assembly operation of two given others.

show abstract

DNA Recombination by XPCR

Cited by 9 publications

References 12 publications

Experimental Analysis of XPCR-based protocols

Experimental Analysis of XPCR-based protocols

State Complexity of Overlap Assembly

Further remarks on DNA overlap assembly

Contact Info

Product

Resources

About