Two models for gene assembly in ciliates
|
|
- Howard Brooks
- 6 years ago
- Views:
Transcription
1 Two models for gene assembly in ciliates Tero Harju 1,3, Ion Petre 2,3, and Grzegorz Rozenberg 4 1 Deartment of Mathematics, University of Turku Turku Finland harju@utu.fi 2 Deartment of Comuter Science, Åbo Akademi University Turku Finland ietre@abo.fi 3 Turku Centre for Comuter Science Turku Finland 4 Leiden Institute for Advanced Comuter Science, Leiden University Niels Bohrweg 1, 2333 CA Leiden, the Netherlands, and Deartment of Comuter Science, University of Colorado at Boulder Boulder, Co , USA rozenber@liacs.nl Abstract. Two models for gene assembly in ciliates have been roosed and investigated in the last few years. The DNA maniulations ostulated in the two models are very different: one model is intramolecular a single DNA molecule is involved here, folding on itself according to various atterns, while the other is intermolecular two DNA molecules may be involved here, hybridizing with each other. Consequently, the assembly strategies redicted by the two models are comletely different. Interestingly however, the final result of the assembly (including the assembled gene) is always the same. We comare in this aer the two models for gene assembly, formalizing both in terms of ointer reductions. We also discuss invariants and universality results for both models. 1 Introduction Ciliates are unicellular eukaryotic organisms, see, e.g. [23]. This is an ancient grou of organisms, estimated to have originated around two billion years ago. It is also a very diverse grou some 8000 secies are currently known and many others are likely to exist. Their diversity can be areciated by comaring their genomic sequences: some ciliate tyes differ genetically more than humans differ from fruit flies! Two characteristics unify ciliates as a single grou: the ossession of hairlike cilia used for motility and food cature, and the resence of two kinds of functionally different nuclei in the same cell, a micronucleus and a macronucleus, see [15], [24], [25]; the latter feature is unique to ciliates. The macronucleus is the household nucleus all RNA transcrits are roduced in the macronucleus. The micronucleus is a germline nucleus and has no known function in the growth or in the division of the cell. The micronucleus is activated only in the rocess of sexual reroduction, where at some stage the micronuclear 1
2 genome gets transformed into the macronuclear genome, while the old macronuclear genome is destroyed. This rocess is called gene assembly, it is the most involved DNA rocessing known in living organisms, and it is most sectacular in the Stichotrichs secies of ciliates (which we consider in this aer). What makes this rocess so comlex is the unusual rearrangements that ciliates have engineered in the structure of their micronuclear genome. While genes in the macronucleus are contiguous sequences of DNA laced (mostly) on their own molecules (and some of them are the shortest DNA molecules known in Nature), the genes in the micronucleus are laced on long chromosomes and they are broken into ieces called MDSs, searated by noncoding blocks called IESs, see [15, 21 26]. Adding to the comlexity, the order of the MDSs is ermuted and MDSs may be inverted. One of the amazing features of this rocess is that ciliates aear to use linked lists in gene assembly, see [29, 30], similarly as in software engineering! Two different models have been roosed for gene assembly. The first one, roosed by Landweber and Kari, see [19], [20], is intermolecular: the DNA maniulations here may involve two molecules exchanging arts of their sequences through recombination. The other one, roosed by Ehrenfeucht, Prescott, and Rozenberg, see [11], [27], is intramolecular: here, all maniulations involve one single DNA molecule folding on itself and swaing arts of its sequence through recombination. In the intermolecular model one traditionally attemts to cature both the rocess of identifying ointers and the rocess of using ointers by oerations that accomlish gene assembly. In the intramolecular model one assumes that the ointer structure of a molecule is known, i.e., the ointers have been already identified. This imlies some imortant differences between the models: e.g., the intramolecular reresentations of genes contain only ointers, with two occurrences for each ointer, and moreover, rocessing a ointer imlies its removal from the rocessed string; these roerties do not hold in the intermolecular model. Finally, the bulk of the work on the intermolecular model, see [1 3, 16 18], is concerned with the comutational ower of the oerations in the sense of comutability theory; e.g., it is roved in [18 20] that the model has the comutational ower of the Turing machine. On the other hand, research on the intramolecular model, see [4 6, 8 10, 12 14] and esecially [7], deals with reresentations and roerties of the gene assembly rocess (reresented by various kinds of reduction systems). We believe that the two aroaches together shed light on the comutational nature of gene assembly in ciliates. In this aer, we take a novel aroach on the intermolecular model aiming to comare the assembly strategies redicted by each model. Therefore, we formalize both models in terms of MDS-IES descritors and describe the gene assembly in terms of ointer reductions. We rove a universality result showing that the assembly ower of the two models is the same: any gene that can be assembled in one model can also be assembled in the other. Nevertheless, the assembly strategies and the gene atterns throughout the rocess are comletely different in the two models. Somewhat surrisingly, we show that the two models agree on the final results of the assembly rocess. 2
3 2 The structure of micronuclear genes We shall now take a formal aroach to gene assembly. The central role in this rocess is layed by ointers. These are short sequences at the ends of MDSs (i.e., at the border of an MDS and an IES) the ointer in the end of an MDS M coincides as a nucleotide sequence with the ointer in the beginning of the MDS following M in the macronuclear gene, see [22, 25]. For the urose of an adequate formal reresentation, the first (last, res.) MDS begins (ends, res.) with a secific marker b (e, res.). It is enough for our uroses to describe any MDS by the air of ointers or markers flanking it at its ends. The gene will then be described as a sequence of such airs intersersed with strings describing the sequence of IES we thus obtain MDS-IES descritors formally defined in the following. For more details we refer to [7]. For an alhabet Σ and a string u over Σ, we will denote by [u] the circular version of string u we refer to [7] for a formal definition. Let Σ = {a a Σ} and u = a 1 a 2... a n, a i Σ Σ. The inverse of u is the string u = a n... a 2 a 1, where a = a, for all a Σ. The emty string will be denoted by Λ. Let M = { b, e, b, e } denote the set of the markers and their inverses. For each index κ 2, let κ = { 2, 3,..., κ } and Π κ = κ κ. An element Π κ is called a ointer. Also let Γ κ = { (b, e), } { (b, i), (i, e) 2 i κ } { (i, j) 2 i < j κ } and Γ κ = {(β, α) (α, β) Γ κ }. A string δ over Γ κ Γ κ is called an MDS descritor if (a) δ has exactly one occurrence from the set {b, b} and exactly one occurrence from the set {e, e}; (b) δ has either zero, or two occurrences from {, }, for any ointer Π κ. Let Ω κ = {I 1, I 2,..., I κ 1 } and Ω κ = {I I Ω κ }. Any string ι over Ω κ Ω κ is called an IES-descritor if for any I Ω κ, ι contains at most one occurrence from {I, I}. A string γ over Γ κ Γ κ Ω κ Ω κ is called an MDS-IES descritor if γ = ι 1 ( 1, q 1 )ι 2 ( 2, q 2 )... ι n ( n, q n )ι n+1, where ι 1 ι 2... ι n+1 is an IES-descritor, and ( 1, q 1 )... ( n, q n ) is an MDS-descritor. We say that γ is assembled if γ = ι 1 (m, m )ι 2 for some IES-descritors ι 1, ι 2 and m, m M. If (m, m ) = (b, e), then we say that γ is assembled in the orthodox order and if (m, m ) = (e, b), then we say that γ is assembled in the inverted order. A circular string [γ] is an (assembled) MDS-IES descritor if γ is so. Examle 1. The MDS-IES descritor associated to the micronuclear actin I gene in S.nova, shown in Fig. 1, is M 3 I 1 M 4 I 2 M 6 I 3 M 5 I 4 M 7 I 5 M 9 I 6 M 2 I 7 M 1 I 8 M 8. 3
4 Fig. 1. Structure of the micronuclear gene encoding actin rotein in the stichotrich Sterkiella nova. The nine MDSs are in a scrambled disorder. 3 Two models for gene assembly We briefly resent in this section the intramolecular and the intermolecular models for gene assembly in ciliates. We then formalize both models in terms of ointer reductions and MDS-IES descritors. For more details we refer to [7, 11, 19, 20, 27]. 3.1 The intramolecular model Three intramolecular oerations were ostulated in [11] and [27] for gene assembly: ld, hi, and dlad. In each of these oerations, a linear DNA molecule containing a secific attern is folded on itself in such a way that recombination can take lace. Oerations hi and dlad yield as a result a linear DNA molecule, while ld yields one linear and one circular DNA molecule, see Figs The secific atterns required by each oeration are described bellow: (a) (b) (c) (d) Fig. 2. Illustration of the ld molecular oeration. (a) (b) (c) (d) Fig. 3. Illustration of the hi molecular oeration. (i) The ld oeration is alicable to molecules in which two occurrences (on the same strand) of the same ointer flank one IES. The molecule is folded so that the two occurrences of are aligned to guide the recombination, see Fig. 2. As a result, one circular molecule is excised. 4
5 (a) (b) (c) Fig. 4. Illustration of the dlad molecular oeration. (ii) The hi oeration is alicable to molecules in which a ointer has two occurrences, of which exactly one is inverted. The folding is done as in Fig. 3 so that the two occurrences of are aligned to guide the recombination. (iii) The dlad oeration is alicable to molecules in which two ointers and q have intersersed occurrences (on the same strand): q q. The folding is done as in Fig. 4 so that the two occurrences of and q are aligned to guide the double recombination. Oerations ld, hi, and dlad can be formalized in terms of reduction rules ld, hi, and dlad for MDS-IES descritors as follows: (1) For each Π κ, the ld-rule for is defined by: ld (δ 1 (q, )ι 1 (, r)δ 2 ) = δ 1 (q, r)δ 2 + [ι 1 ], ld (ι 1 (, m)ι 2 (m, )ι 3 ) = ι 1 ι 3 + [(m, m)ι 2 ], where q, r Π κ M, δ 1, δ 2 are MDS-IES descritors, ι 1, ι 2, ι 3 are IES descritors, and m, m M. (2) For each Π κ, the hi-rule for is defined by: hi (δ 1 (, q)δ 2 (, r)δ 3 ) = δ 1 δ 2 (q, r)δ 3, hi (δ 1 (q, )δ 2 (r, )δ 3 ) = δ 1 (q, r)δ 2 δ 3, where q, r Π κ and δ 1, δ 2 (Γ κ Ω). (3) For each, q Π κ, q, the dlad rule for and q is defined by: dlad,q (δ 1 (, r 1 )δ 2 (q, r 2 )δ 3 (r 3, )δ 4 (r 4, q)δ 5 ) = δ 1 δ 4 (r 4, r 2 )δ 3 (r 3, r 1 )δ 2 δ 5, dlad,q (δ 1 (, r 1 )δ 2 (r 2, q)δ 3 (r 3, )δ 4 (q, r 4 )δ 5 ) = δ 1 δ 4 δ 3 (r 3, r 1 )δ 2 (r 2, r 4 )δ 5, dlad,q (δ 1 (r 1, )δ 2 (q, r 2 )δ 3 (, r 3 )δ 4 (r 4, q)δ 5 ) = δ 1 (r 1, r 3 )δ 4 (r 4, r 2 )δ 3 δ 2 δ 5, dlad,q (δ 1 (r 1, )δ 2 (r 2, q)δ 3 (, r 3 )δ 4 (q, r 4 )δ 5 ) = δ 1 (r 1, r 3 )δ 4 δ 3 δ 2 (r 2, r 4 )δ 5, dlad,q (δ 1 (, r 1 )δ 2 (q, )δ 4 (r 4, q)δ 5 ) = δ 1 δ 4 (r 4, r 1 )δ 2 δ 5, dlad,q (δ 1 (, q)δ 3 (r 3, )δ 4 (q, r 4 )δ 5 ) = δ 1 δ 4 δ 3 (r 3, r 4 )δ 5, dlad,q (δ 1 (r 1, )δ 2 (q, r 2 )δ 3 (, q)δ 5 ) = δ 1 (r 1, r 2 )δ 3 δ 2 δ 5, where r 1, r 2, r 3, r 4, r 5 Π κ, and δ 1, δ 2, δ 3, δ 4, δ 5 (Γ κ Ω). Note that each oeration removes one or two ointers from the MDS-IES descritor. When assembled (on a linear or on a circular string), the descritor 5
6 has no ointers anymore. Thus, the whole rocess of gene assembly may be viewed as a rocess of ointer removals. If a comosition ϕ of ld, hi, and dlad oerations is alicable to an MDS- IES descritor γ, then ϕ(γ) is a set of linear and circular MDS-IES descritors. We say that ϕ is a successful reduction for γ if no ointers occur in any of the descritors in ϕ(γ). Examle 2. Consider the MDS-IES descritor δ = (b, 2)I 1 (2, 3)I 2 (4, e)i 3 (3, 4). An assembly strategy for this descritor in the intramolecular model is the following: dlad 3,4 (δ) = (b, 2)I 1 (2, e)i 3 I 2, ld 2 (dlad 3,4 (δ)) = (b, e)i 3 I 2 + [I 1 ]. 3.2 The intermolecular model Three oerations were ostulated in [19] and [20] for gene assembly. One of these oerations is intramolecular: it is a sort of a generalized version of the ld oeration, while the other two are intermolecular: they involve recombination between two different DNA molecules, linear or circular, see Figs We describe these oerations below in terms of ointers, similarly as for the intramolecular model. (i) In the first oeration a DNA molecule containing two occurrences of the same ointer x (on the same strand) is folded so that they get aligned to guide the recombination, see Fig. 5. Note that unlike in ld, the two occurrences of x may have more than just one IES between them. (ii) The second oeration is the inverse of the first one: two DNA molecules, one linear and one circular, each containing one occurrence of a ointer x get aligned so that the two occurrences of x guide the recombination, yielding one linear molecule see Fig. 5. (iii) The third oeration is somewhat similar to the second one: two linear DNA molecules, each containing one occurrence of a ointer x get aligned so that the two occurrences of x guide the recombination, yielding two linear molecules, see Fig. 6. Note that the three molecular oerations in this model are reversible, unlike the oerations in the intramolecular model this is one of the main differences between the two models. We formalize now this intermolecular model in terms of reduction rules for MDS-IES descritors. The three oerations defined above are modelled by the following reduction rules for MDS-IES descritors: 6
7 x x Fig. 5. Illustration of the intramolecular oeration of the Landweber-Kari model. x Fig. x 6. Illustration of the intermolecular oeration of the Landweber-Kari model. δ 1 (q, )δ 2 (, r)δ 3 δ 1 (, q)δ 2 (r, )δ 3 δ 1 (, q)δ 2 + [(r, )δ 3 ] δ 1 (q, )δ 2 + [(, r)δ 3 ] δ 1 (, q)δ 2 + δ 3 (r, )δ 4 δ 1 (q, r)δ 3 + [δ 2 ], (1) δ 1 δ 3 + [δ 2 (r, q)], (2) δ 1 δ 3 (r, q)δ 2, (3) δ 1 (q, r)δ 3 δ 2, (4) δ 1 δ 4 + δ 3 (r, q)δ 2, (5) where δ 1, δ 2, δ 3 (Γ κ Γ κ Ω κ Ω κ ). Note that each reduction rule above removes one ointer, thus making the whole rocess irreversible. Although the intermolecular model was secifically intended to be reversible, this restriction hels in unifying the notation for (and the reasoning about) the two models and it suffices for the results resented in this aer. If a comosition ϕ of the reduction rules (1)-(5) is alicable to an MDS- IES descritor γ, then ϕ(γ) is a set of linear and circular MDS-IES descritors. We say that ϕ is a successful reduction for γ if no ointers occur in any of the descritors in ϕ(γ). Examle 3. Consider the MDS-IES descritor δ = (b, 2)I 1 (2, 3)I 2 (4, e)i 3 (3, 4) of Examle 2. An assembly strategy for this descritor in the intermolecular model is the following: δ (b, 2)I 1 (2, 4) + [I 2 (4, e)i 3 ] (b, 2)I 1 (2, e)i 3 I 2 (b, e)i 3 I 2 + [I 1 ]. Note that although the assembly strategy is very different from the one in Examle 2, the final result of the assembly, {(b, e)i 3 I 2, [I 1 ]} is the same in the two models. 7
8 4 Reduction strategies in the two models The obvious difficulty with the intermolecular model is that it cannot deal with DNA molecules in which a ointer is inverted this is the case, e.g., for the actin I gene in S.nova. Nevertheless, we can show that inverted ointers can be handled in this model, rovided the inut molecule (or its MDS-IES descritor) is available in two coies. Moreover, we consider all linear descritors modulo inversion. The first assumtion is essentially used in research on the intermolecular model, see [16 18, 20]. The second assumtion is quite natural whenever we model double-stranded DNA molecules. As a matter of fact, we use the two assumtions to conclude that for each inut descritor, both the descritor and its inversion are available. Then the hi-rule can be simulated using the intermolecular rules as follows. Let δ = δ 1 (, q)δ 2 (, r)δ 3 (the other case is treated similarly) be an MDS- IES descritor to which hi is alicable. Therefore, we assume that also δ = δ 3 (r, )δ 2 (q, )δ 1 is available. Then we obtain δ + δ δ 1 δ 2 (q, ) δ 1 + δ 3 (r, q)δ 2 (, r) δ 3 δ 1 δ 2 (q, r)δ 3 + δ 3 (r, q)δ 2 δ 1 = hi (δ) + hi (δ). Note that, having two coies of the initial string available, this rule yields two coies of hi (w). We also observe that the ld-rule is a articular case of intermolecular rules (1) and (2), obtained by setting δ 2 = Λ. Moreover, the dlad-rule can be simulated using intermolecular rules as follows. Let δ = δ 1 (, r 1 )δ 2 (q, r 2 )δ 3 (r 3, )δ 4 (r 4, q)δ 5 ) be an MDS-IES descritor to which dlad,q is alicable all other cases can be treated similarly. Then δ δ 1 δ 4 (r 4, q)δ 5 + [δ 2 (q, r 2 )δ 3 (r 3, r 1 )] = δ 1 δ 4 (r 4, q)δ 5 + [δ 3 (r 3, r 1 )δ 2 (q, r 2 )] q δ 1 δ 4 (r 4, r 2 )δ 3 (r 3, r 1 )δ 2 δ 5 = dlad,q (w). The following results is thus roved. Theorem 1. Let δ be an MDS-IES descritor having a successful reduction in the intramolecular model. If two coies of δ are available, then δ has a successful reduction in the intermolecular model. The following universality result has been roved in [8], see [7] for more details. Theorem 2. Any MDS-IES descritor has a successful reduction in the intramolecular model. Theorems 1 and 2 give the following universality result for the intermolecular model. Corollary 1. Any MDS-IES descritor available in two coies has a successful reduction in the intermolecular model. 8
9 5 Invariants In the following two examles we consider the actin I gene in S.nova and investigate assembly strategies for this gene in the intra- and inter-molecular models. Examle 4. Consider the actin gene in Sterkiella nova, see Fig. 1, having the MDS IES descritor δ = (3, 4)I 1 (4, 5)I 2 (6, 7)I 3 (5, 6)I 4 (7, 8)I 5 (9, e)i 6 (3, 2)I 7 (b, 2)I 8 (8, 9). Consider then an assembly strategy for δ, e.g., ld 4 dlad 5,6 ld 7 dlad 8,9 hi 2 hi 3 : ld 4 (δ) = (3, 5)I 2 (6, 7)I 3 (5, 6)I 4 (7, 8)I 5 (9, e)i 6 (3, 2)I 7 (b, 2)I 8 (8, 9) + [I 1 ], dlad 5,6 (ld 4 (δ)) = I 0 (3, 7)I 3 I 2 I 4 (7, 8)I 5 (9, e)i 6 (3, 2)I 7 (b, 2)I 8 (8, 9) + [I 1 ], ld 7 (dlad 5,6 (ld 4 (δ))) = (3, 8)I 5 (9, e)i 6 (3, 2)I 7 (b, 2)I 8 (8, 9) + [I 1 ] + [I 3 I 2 I 4 ], dlad 8,9 (ld 7 (dlad 5,6 (ld 4 (δ)))) = (3, e)i 6 (3, 2)I 7 (b, 2)I 8 I 5 + [I 1 ] + [I 3 I 2 I 4 ], hi 2 (dlad 8,9 (ld 7 (dlad 5,6 (ld 4 (δ))))) = (3, e)i 6 (3, b)i 7 I 8 I 5 + [I 1 ] + [I 3 I 2 I 4 ], hi 3 (hi 2 (dlad 8,9 (ld 7 (dlad 5,6 (ld 4 (δ)))))) = I 6 (e, b)i 7 I 8 I 5 + [I 1 ] + [I 3 I 2 I 4 ]. Thus, the gene is assembled in the inverted order, laced in a linear DNA molecule, with the IES I 6 receding it and the sequence of IESs I 7 I 8 I 5 succeeding it. Two circular molecules are also roduced: [I 1 ] and [I 3 I 2 I 4 ]. Examle 5. Consider the same actin gene in Sterkiella nova with the MDS IES descritor δ = (3, 4)I 1 (4, 5)I 2 (6, 7)I 3 (5, 6)I 4 (7, 8)I 5 (9, e)i 6 (3, 2)I 7 (b, 2)I 8 (8, 9). Then δ can be assembled in the intermolecular model as follows: δ 5 (3, 4)I 1 (4, 6)I 4 (7, 8)I 5 (9, e)i 6 (3, 2)I 7 (b, 2)I 8 (8, 9) + [I 2 (6, 7)I 3 ] 8 (3, 4)I 1 (4, 6)I 4 (7, 9) + [I 5 (9, e)i 6 (3, 2)I 7 (b, 2)I 8 ] + [I 2 (6, 7)I 3 ] 4 (3, 6)I 4 (7, 9) + [I 1 ] + [I 5 (9, e)i 6 (3, 2)I 7 (b, 2)I 8 ] + [I 2 (6, 7)I 3 ] 7 (3, 6)I 4 I 3 I 2 (6, 9) + [I 1 ] + [I 5 (9, e)i 6 (3, 2)I 7 (b, 2)I 8 ] 6 (3, 9) + [I 4 I 3 I 2 ] + [I 1 ] + [I 5 (9, e)i 6 (3, 2)I 7 (b, 2)I 8 ] 9 (3, e)i 6 (3, 2)I 7 (b, 2)I 8 I 5 + [I 4 I 3 I 2 ] + [I 1 ]. Since δ is also available, the assembly continues as follows. Here, for a (circular) string τ, we use 2 τ to denote τ + τ: 9
10 δ + δ... (3, e)i 6 (3, 2)I 7 (b, 2)I 8 I 5 + I 5 I 8 (2, b)i 7 (2, 3)I 6 (e, 3) + 2 [I 4 I 3 I 2 ] + 2 [I 1 ] 2 (3, e)i 6 (3, b)i 7 (2, 3)I 6 (e, 3) + I 5 I 8 I 7 (b, 2)I 8 I [I 4 I 3 I 2 ] + 2 [I 1 ] 2 (3, e)i 6 (3, b)i 7 I 8 I 5 + I 5 I 8 I 7 (b, 3)I 6 (e, 3) + 2 [I 4 I 3 I 2 ] + 2 [I 1 ] 3 (3, e)i 6 + I 5 I 8 I 7 (b, 3)I 6 (e, b)i 7 I 8 I [I 4 I 3 I 2 ] + 2 [I 1 ] 3 I 6 (e, b)i 7 I 8 I 5 + I 5 I 8 I 7 (b, e) + 2 [I 4 I 3 I 2 ] + 2 [I 1 ] = 2 (I 6 (e, b)i 7 I 8 I 5 + +[I 1 ] + [I 3 I 2 I 4 ]). Note that this intermolecular assembly redicts the same context for the assembled string, the same set of residual strings, and the same linearity of the assembled string as the intramolecular assembly considered in Examle 4. It is clear from the above two examles, see also Examles 2 and 3, that the two models for gene assembly redict comletely different assembly strategies for the same micronuclear gene. As it turns out however, the redicted final result of the assembly, i.e., the linearity of the assembled gene and the exact nucleotide sequences of all excised molecules, is the same in the two models, see [7] for details. The following is a result from [7], see also [10]. Theorem 3. Let δ be an MDS IES descritor. If ϕ 1 and ϕ 2 are any two successful assembly strategies for δ, intra- or inter-molecular, then (1) if ϕ 1 (δ) is assembled in a linear descritor, then so is ϕ 2 (δ); (2) if ϕ 1 (δ) is assembled in a linear descritor in orthodox order, then so is ϕ 2 (δ); (3) The sequence of IESs flanking the assembled gene is the same in ϕ 1 (δ) and ϕ 2 (δ); (4) The sequence of IESs in all excised descritors is the same in ϕ 1 (δ) and ϕ 2 (δ); (5) There si an equal number of circular descritors in ϕ 1 (δ) and ϕ 2 (δ). Examle 6. Consider the MDS IES descritor δ = (10, 8)I 1 (3, b)i 2 (5, 3)I 3 (10, 11)I 4 (5, 8)I 5 (11, e). A successful assembly strategy for δ in the intramolecular model is the following: hi 10 (δ) = I 3 (3, 5)I 2 (b, 3)I 1 (8, 11)I 4 (5, 8)I 5 (11, e), dlad 8,11 (hi 10 (δ)) = I 3 (3, 5)I 2 (b, 3)I 1 I 5 I 4 (5, e), dlad 3,5 (dlad 8,11 (hi 10 (δ))) = I 3 I 1 I 5 I 4 I 2 (b, e). 10
11 Thus, δ is always assembled in a linear molecule, and no IES is excised during the assembly rocess, i.e., no ld is ever alied in a rocess of assembling δ. Moreover, the assembled descritor will always be receded by the IES sequence I 3 I 1 I 5 I 4 I 2 and followed by the emty IES sequence. Examle 7. Consider the MDS IES descritor δ = (10, 8)I 1 (3, b)i 2 (5, 3)I 3 (10, 11)I 4 (5, 8)I 5 (11, e) from Examle 6. Then δ can be assembled in the intermolecular model as follows: δ 3 (10, 8)I 1 I 3 (10, 11)I 4 (5, 8)I 5 (11, e) + [I 2 (5, b)] 11 (10, 8)I 1 I 3 (10, e) + [I 4 (5, 8)I 5 ] + [I 2 (5, b)]. Since also δ is available, the assembly continues as follows: δ + δ... (10, 8)I 1 I 3 (10, e) + (e, 10)I 3 I 1 (8, 10) [I 4 (5, 8)I 5 ] + 2 [I 2 (5, b)] I 3 I 1 (8, 10) + (e, 8)I 1 I 3 (10, e) + 2 [I 4 (5, 8)I 5 ] + 2 [I 2 (5, b)] I 3 I 1 (8, e) + (e, 8)I 1 I 3 + [I 4 (5, 8)I 5 ] + [I 5 (8, 5)I 4 ] + 2 [I 2 (5, b)] 8, 8 I 3 I 1 I 5 I 4 (5, e) + (e, 5)I 4 I 5 I 1 I 3 + [(5, b)i 2 ] + [I 2 (b, 5)] 5, 5 I 3 I 1 I 5 I 4 I 2 (b, e) + (e, b)i 2 I 4 I 5 I 1 I 3 = 2 I 3 I 1 I 5 I 4 I 2 (b, e). Note that, again, we obtain the same context for the assembled string, the same set of residual strings, and the same linearity of the assembled string as the intramolecular assembly considered in Examle 6. References 1. Daley, M., Comutational Modeling of Genetic Processes in Stichotrichous Ciliates. PhD thesis, University of London, Ontario, Canada (2003) 2. Daley, M., and Kari, L., Some roerties of ciliate bio-oerations. Lecture Notes in Comut. Sci (2003) Daley, M., Ibarra, O. H., and Kari, L., Closure roeties and decision questions of some language classes under ciliate bio-oerations. Theoret. Comut. Sci., to aear 4. Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D. M., and Rozenberg, G., Formal systems for gene assembly in ciliates. Theoret. Comut. Sci. 292 (2003) Ehrenfeucht, A., Harju, T., Petre, I., and Rozenberg, G., Patterns of micronuclear genes in cliates. Lecture Notes in Comut. Sci (2002)
12 6. Ehrenfeucht, A., Harju, T., Petre, I., and Rozenberg, G., Characterizing the micronuclear gene atterns in ciliates. Theory of Comut. Syst. 35 (2002) Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D. M., and Rozenberg, G., Comutation in Living Cells: Gene Assembly in Ciliates, Sringer (2003). 8. Ehrenfeucht, A., Petre, I., Prescott, D. M., and Rozenberg, G., Universal and simle oerations for gene assembly in ciliates. In: V. Mitrana and C. Martin- Vide (eds.) Words, Sequences, Languages: Where Comuter Science, Biology and Linguistics Meet, Kluwer Academic, Dortrecht, (2001) Ehrenfeucht, A., Petre, I., Prescott, D. M., and Rozenberg, G., String and grah reduction systems for gene assembly in ciliates. Math. Structures Comut. Sci. 12 (2001) Ehrenfeucht, A., Petre, I., Prescott, D. M., and Rozenberg, G., Circularity and other invariants of gene assembly in cliates. In: M. Ito, Gh. Paun and S. Yu (eds.) Words, semigrous, and transductions, World Scientific, Singaore, (2001) Ehrenfeucht, A., Prescott, D. M., and Rozenberg, G., Comutational asects of gene (un)scrambling in ciliates. In: L. F. Landweber, E. Winfree (eds.) Evolution as Comutation, Sringer, Berlin, Heidelberg, New York (2001) Harju, T., Petre, I., and Rozenberg, G., Gene assembly in ciliates: molecular oerations. In: G.Paun, G. Rozenberg, A.Salomaa (Eds.) Current Trends in Theoretical Comuter Science, (2004). 13. Harju, T., Petre, I., and Rozenberg, G., Gene assembly in ciliates: formal frameworks. In: G.Paun, G. Rozenberg, A.Salomaa (Eds.) Current Trends in Theoretical Comuter Science, (2004). 14. Harju, T., and Rozenberg, G., Comutational rocesses in living cells: gene assembly in ciliates. Lecure Notes in Comut. Sci (2003) Jahn, C. L., and Klobutcher, L. A., Genome remodeilng in ciliated rotozoa. Ann. Rev. Microbiol. 56 (2000), Kari, J., and Kari, L. Context free recombinations. In: C. Martin-Vide and V. Mitrana (eds.) Where Mathematics, Comuter Science, Linguistics, and Biology Meet, Kluwer Academic, Dordrecht, (2000) Kari, L., Kari, J., and Landweber, L. F., Reversible molecular comutation in ciliates. In: J. Karhumäki, H. Maurer, G. Pǎun and G. Rozenberg (eds.) Jewels are Forever, Sringer, Berlin HeidelbergNew York (1999) Kari, L., and Landweber, L. F., Comutational ower of gene rearrangement. In: E. Winfree and D. K. Gifford (eds.) Proceedings of DNA Bases Comuters, V American Mathematical Society (1999) Landweber, L. F., and Kari, L., The evolution of cellular comuting: Nature s solution to a comutational roblem. In: Proceedings of the 4th DIMACS Meeting on DNA-Based Comuters, Philadelhia, PA (1998) Landweber, L. F., and Kari, L., Universal molecular comutation in ciliates. In: L. F. Landweber and E. Winfree (eds.) Evolution as Comutation, Sringer, Berlin Heidelberg New York (2002) 21. Prescott, D. M., Cutting, slicing, reordering, and elimination of DNA sequences in hyotrichous ciliates. BioEssays 14 (1992) Prescott, D. M., The unusual organization and rocessing of genomic DNA in hyotrichous ciliates. Trends in Genet. 8 (1992) Prescott, D. M., The DNA of ciliated rotozoa. Microbiol. Rev. 58(2) (1994)
13 24. Prescott, D. M., The evolutionary scrambling and develomental unscabling of germlike genes in hyotrichous ciliates. Nucl. Acids Res. 27 (1999), Prescott, D. M., Genome gymnastics: unique modes of DNA evolution and rocessing in ciliates. Nat. Rev. Genet. 1(3) (2000) Prescott, D. M., and DuBois, M., Internal eliminated segments (IESs) of Oxytrichidae. J. Eukariot. Microbiol. 43 (1996) Prescott, D. M., Ehrenfeucht, A., and Rozenberg, G., Molecular oerations for DNA rocessing in hyotrichous ciliates. Euro. J. Protistology 37 (2001) Prescott, D. M., Ehrenfeucht, A., and Rozenberg, G., Temlate-guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates. Technical Reort , LIACS, Leiden University (2002) 29. Prescott, D. M., and Rozenberg, G., How ciliates maniulate their own DNA A slendid examle of natural comuting. Natural Comuting 1 (2002) Prescott, D. M., and Rozenberg, G., Encryted genes and their reassembly in ciliates. In: M. Amos (ed.) Cellular Comuting, Oxford University Press, Oxford (2003) 13
Patterns of Simple Gene Assembly in Ciliates
Patterns of Simple Gene Assembly in Ciliates Tero Harju Department of Mathematics, University of Turku Turku 20014 Finland harju@utu.fi Ion Petre Academy of Finland and Department of Information Technologies
More informationComplexity Measures for Gene Assembly
Tero Harju Chang Li Ion Petre Grzegorz Rozenberg Complexity Measures for Gene Assembly TUCS Technical Report No 781, September 2006 Complexity Measures for Gene Assembly Tero Harju Department of Mathematics,
More informationComputational nature of gene assembly in ciliates
Computational nature of gene assembly in ciliates Robert Brijder 1, Mark Daley 2, Tero Harju 3, Natasha Jonoska 4, Ion Petre 5, and Grzegorz Rozenberg 1,6 1 Leiden Institute of Advanced Computer Science,
More informationPart I. Gene Assembly in Ciliates
Part I Gene Assembly in Ciliates Chater 2 Reducibility of Gene Patterns in Ciliates using the Breakoint Grah Abstract Gene assembly in ciliates is one of the most involved DNA rocessings going on in any
More informationComputational processes
Spring 2010 Computational processes in living cells Lecture 6: Gene assembly as a pointer reduction in MDS descriptors Vladimir Rogojin Department of IT, Abo Akademi http://www.abo.fi/~ipetre/compproc/
More informationTheoretical Computer Science
Theoretical Computer Science 411 (2010) 919 925 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Algorithmic properties of ciliate sequence
More informationExploring Phylogenetic Relationships in Drosophila with Ciliate Operations
Exploring Phylogenetic Relationships in Drosophila with Ciliate Operations Jacob Herlin, Anna Nelson, and Dr. Marion Scheepers Department of Mathematical Sciences, University of Northern Colorado, Department
More informationCombinatorial models for DNA rearrangements in ciliates
University of South Florida Scholar Commons Graduate Theses and Dissertations Graduate School 2009 Combinatorial models for DNA rearrangements in ciliates Angela Angeleska University of South Florida Follow
More informationComputational Power of Gene Rearrangement. Lila Kari and Laura F. Landweber
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Computational Power of Gene Rearrangement Lila Kari and Laura F. Landweber Abstract. In [8] we proposed a model to describe the homologous
More informationModels of Natural Computation: Gene Assembly and Membrane Systems. Robert Brijder
Models of Natural Computation: Gene Assembly and Membrane Systems Robert Brijder The work in this thesis has been carried out under the auspices of the research school IPA (Institute for Programming research
More informationEXACTLY PERIODIC SUBSPACE DECOMPOSITION BASED APPROACH FOR IDENTIFYING TANDEM REPEATS IN DNA SEQUENCES
EXACTLY ERIODIC SUBSACE DECOMOSITION BASED AROACH FOR IDENTIFYING TANDEM REEATS IN DNA SEUENCES Ravi Guta, Divya Sarthi, Ankush Mittal, and Kuldi Singh Deartment of Electronics & Comuter Engineering, Indian
More informationCOMPUTATIONAL PROCESSES IN LIVING CELLS
COMPUTATIONAL PROCESSES IN LIVING CELLS Lecture 7: Formal Systems for Gene Assembly in Ciliates: the String Pointer Reduction System March 31, 2010 MDS-descriptors MDS descriptors: strings over the following
More informationMODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL
Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management
More informationPARTITIONS AND (2k + 1) CORES. 1. Introduction
PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND 2k + CORES SILVIU RADU AND JAMES A. SELLERS Abstract. In this aer we rove several new arity results for broken k-diamond artitions introduced in 2007
More informationTheoretical Computer Science. Rewriting rule chains modeling DNA rearrangement pathways
Theoretical Computer Science 454 (2012) 5 22 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Rewriting rule chains modeling
More informationSolvability and Number of Roots of Bi-Quadratic Equations over p adic Fields
Malaysian Journal of Mathematical Sciences 10(S February: 15-35 (016 Secial Issue: The 3 rd International Conference on Mathematical Alications in Engineering 014 (ICMAE 14 MALAYSIAN JOURNAL OF MATHEMATICAL
More information#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS
#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt
More informationThe Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule
The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca
More informationA CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract
A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave
More informationPositive decomposition of transfer functions with multiple poles
Positive decomosition of transfer functions with multile oles Béla Nagy 1, Máté Matolcsi 2, and Márta Szilvási 1 Deartment of Analysis, Technical University of Budaest (BME), H-1111, Budaest, Egry J. u.
More informationP Systems with Minimal Insertion and Deletion
P Systems with Minimal Insertion and Deletion Artiom Alhazov,, Alexander Krassovitskiy, Yurii Rogozhin,, Sergey Verlan 4 IEC, Deartment of Information Engineering, Graduate School of Engineering Hiroshima
More informationRecombination Faults in Gene Assembly in Ciliates Modeled Using Multimatroids
Recombination Faults in Gene Assembly in Ciliates Modeled Using Multimatroids Robert Brijder 1 Hasselt University and Transnational University of Limburg, Belgium Abstract We formally model the process
More informationModel checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle]
Chater 5 Model checking, verification of CTL One must verify or exel... doubts, and convert them into the certainty of YES or NO. [Thomas Carlyle] 5. The verification setting Page 66 We introduce linear
More informationExamples from Elements of Theory of Computation. Abstract. Introduction
Examles from Elements of Theory of Comutation Mostafa Ghandehari Samee Ullah Khan Deartment of Comuter Science and Engineering University of Texas at Arlington, TX-7609, USA Tel: +(87)7-5688, Fax: +(87)7-784
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM
ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Conve Analysis and Economic Theory Winter 2018 Toic 16: Fenchel conjugates 16.1 Conjugate functions Recall from Proosition 14.1.1 that is
More informationCombining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)
Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment
More informationOn Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm
On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm Gabriel Noriega, José Restreo, Víctor Guzmán, Maribel Giménez and José Aller Universidad Simón Bolívar Valle de Sartenejas,
More informationDimension Characterizations of Complexity Classes
Dimension Characterizations of Comlexity Classes Xiaoyang Gu Jack H. Lutz Abstract We use derandomization to show that sequences of ositive sace-dimension in fact, even ositive k-dimension for suitable
More informationState Estimation with ARMarkov Models
Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,
More informationMultiplicity of weak solutions for a class of nonuniformly elliptic equations of p-laplacian type
Nonlinear Analysis 7 29 536 546 www.elsevier.com/locate/na Multilicity of weak solutions for a class of nonuniformly ellitic equations of -Lalacian tye Hoang Quoc Toan, Quô c-anh Ngô Deartment of Mathematics,
More informationHow Does Nature Compute?
How Does Nature Compute? Lila Kari Dept. of Computer Science University of Western Ontario London, ON, Canada http://www.csd.uwo.ca/~lila/ lila@csd.uwo.ca Computers: What can they accomplish? Fly spaceships
More informationON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS
#A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,
More informationChapter 1 Fundamentals
Chater Fundamentals. Overview of Thermodynamics Industrial Revolution brought in large scale automation of many tedious tasks which were earlier being erformed through manual or animal labour. Inventors
More informationMAS 4203 Number Theory. M. Yotov
MAS 4203 Number Theory M. Yotov June 15, 2017 These Notes were comiled by the author with the intent to be used by his students as a main text for the course MAS 4203 Number Theory taught at the Deartment
More informationOn the Toppling of a Sand Pile
Discrete Mathematics and Theoretical Comuter Science Proceedings AA (DM-CCG), 2001, 275 286 On the Toling of a Sand Pile Jean-Christohe Novelli 1 and Dominique Rossin 2 1 CNRS, LIFL, Bâtiment M3, Université
More informationThe inverse Goldbach problem
1 The inverse Goldbach roblem by Christian Elsholtz Submission Setember 7, 2000 (this version includes galley corrections). Aeared in Mathematika 2001. Abstract We imrove the uer and lower bounds of the
More informationA Model for Randomly Correlated Deposition
A Model for Randomly Correlated Deosition B. Karadjov and A. Proykova Faculty of Physics, University of Sofia, 5 J. Bourchier Blvd. Sofia-116, Bulgaria ana@hys.uni-sofia.bg Abstract: A simle, discrete,
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationMetrics Performance Evaluation: Application to Face Recognition
Metrics Performance Evaluation: Alication to Face Recognition Naser Zaeri, Abeer AlSadeq, and Abdallah Cherri Electrical Engineering Det., Kuwait University, P.O. Box 5969, Safat 6, Kuwait {zaery, abeer,
More informationLinear diophantine equations for discrete tomography
Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,
More informationPROCESSING OF LOW-VISCOSITY CBT THERMOPLASTIC COMPOSITES: HEAT TRANSFER ANALYSIS
PROCESSING OF LOW-VISCOSITY CBT THERMOPLASTIC COMPOSITES: HEAT TRANSFER ANALYSIS Dr. Adrian Murtagh, Siora Coll and Dr. Conchúr Ó Brádaigh Comosites Research Unit Det. of Mechanical & Biomedical Engineering,
More informationBond Computing Systems: a Biologically Inspired and High-level Dynamics Model for Pervasive Computing
Bond Comuting Systems: a Biologically Insired and High-level Dynamics Model for Pervasive Comuting Linmin Yang 1, Zhe Dang 1, and Oscar H. Ibarra 2 1 School of Electrical Engineering and Comuter Science
More informationCombinatorics of topmost discs of multi-peg Tower of Hanoi problem
Combinatorics of tomost discs of multi-eg Tower of Hanoi roblem Sandi Klavžar Deartment of Mathematics, PEF, Unversity of Maribor Koroška cesta 160, 000 Maribor, Slovenia Uroš Milutinović Deartment of
More information16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes
Infinite Series 6.2 Introduction We extend the concet of a finite series, met in Section 6., to the situation in which the number of terms increase without bound. We define what is meant by an infinite
More informationTowards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK
Towards understanding the Lorenz curve using the Uniform distribution Chris J. Stehens Newcastle City Council, Newcastle uon Tyne, UK (For the Gini-Lorenz Conference, University of Siena, Italy, May 2005)
More informationA Qualitative Event-based Approach to Multiple Fault Diagnosis in Continuous Systems using Structural Model Decomposition
A Qualitative Event-based Aroach to Multile Fault Diagnosis in Continuous Systems using Structural Model Decomosition Matthew J. Daigle a,,, Anibal Bregon b,, Xenofon Koutsoukos c, Gautam Biswas c, Belarmino
More informationCorrespondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R.
1 Corresondence Between Fractal-Wavelet Transforms and Iterated Function Systems With Grey Level Mas F. Mendivil and E.R. Vrscay Deartment of Alied Mathematics Faculty of Mathematics University of Waterloo
More informationON FREIMAN S 2.4-THEOREM
ON FREIMAN S 2.4-THEOREM ØYSTEIN J. RØDSETH Abstract. Gregory Freiman s celebrated 2.4-Theorem says that if A is a set of residue classes modulo a rime satisfying 2A 2.4 A 3 and A < /35, then A is contained
More informationMatching Partition a Linked List and Its Optimization
Matching Partition a Linked List and Its Otimization Yijie Han Deartment of Comuter Science University of Kentucky Lexington, KY 40506 ABSTRACT We show the curve O( n log i + log (i) n + log i) for the
More informationJonathan Sondow 209 West 97th Street, New York, New York
#A34 INTEGERS 11 (2011) REDUCING THE ERDŐS-MOSER EQUATION 1 n + 2 n + + k n = (k + 1) n MODULO k AND k 2 Jonathan Sondow 209 West 97th Street, New York, New York jsondow@alumni.rinceton.edu Kieren MacMillan
More informationAn Overview of Witt Vectors
An Overview of Witt Vectors Daniel Finkel December 7, 2007 Abstract This aer offers a brief overview of the basics of Witt vectors. As an alication, we summarize work of Bartolo and Falcone to rove that
More informationCERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education
CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,
More informationarxiv:cond-mat/ v2 25 Sep 2002
Energy fluctuations at the multicritical oint in two-dimensional sin glasses arxiv:cond-mat/0207694 v2 25 Se 2002 1. Introduction Hidetoshi Nishimori, Cyril Falvo and Yukiyasu Ozeki Deartment of Physics,
More informationApproximation of the Euclidean Distance by Chamfer Distances
Acta Cybernetica 0 (0 399 47. Aroximation of the Euclidean Distance by Chamfer Distances András Hajdu, Lajos Hajdu, and Robert Tijdeman Abstract Chamfer distances lay an imortant role in the theory of
More informationLEIBNIZ SEMINORMS IN PROBABILITY SPACES
LEIBNIZ SEMINORMS IN PROBABILITY SPACES ÁDÁM BESENYEI AND ZOLTÁN LÉKA Abstract. In this aer we study the (strong) Leibniz roerty of centered moments of bounded random variables. We shall answer a question
More informationRESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO
RESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO MARIA ARTALE AND DAVID A. BUCHSBAUM Abstract. We find an exlicit descrition of the terms and boundary mas for the three-rowed
More informationAn Estimate For Heilbronn s Exponential Sum
An Estimate For Heilbronn s Exonential Sum D.R. Heath-Brown Magdalen College, Oxford For Heini Halberstam, on his retirement Let be a rime, and set e(x) = ex(2πix). Heilbronn s exonential sum is defined
More informationA FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE
International Journal of Mathematics & Alications Vol 4, No 1, (June 2011), 77-86 A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE ARPAN SAHA AND KARTHIK C S ABSTRACT: In this aer, we rove a few lemmas
More informationCryptography. Lecture 8. Arpita Patra
Crytograhy Lecture 8 Arita Patra Quick Recall and Today s Roadma >> Hash Functions- stands in between ublic and rivate key world >> Key Agreement >> Assumtions in Finite Cyclic grous - DL, CDH, DDH Grous
More informationVerifying Two Conjectures on Generalized Elite Primes
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 12 (2009), Article 09.4.7 Verifying Two Conjectures on Generalized Elite Primes Xiaoqin Li 1 Mathematics Deartment Anhui Normal University Wuhu 241000,
More informationA Comparison between Biased and Unbiased Estimators in Ordinary Least Squares Regression
Journal of Modern Alied Statistical Methods Volume Issue Article 7 --03 A Comarison between Biased and Unbiased Estimators in Ordinary Least Squares Regression Ghadban Khalaf King Khalid University, Saudi
More informationVarious Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems
Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various
More informationSOME INEQUALITIES FOR (α, β)-normal OPERATORS IN HILBERT SPACES. 1. Introduction
SOME INEQUALITIES FOR (α, β)-normal OPERATORS IN HILBERT SPACES SEVER S. DRAGOMIR 1 AND MOHAMMAD SAL MOSLEHIAN Abstract. An oerator T is called (α, β)-normal (0 α 1 β) if α T T T T β T T. In this aer,
More informationApplications to stochastic PDE
15 Alications to stochastic PE In this final lecture we resent some alications of the theory develoed in this course to stochastic artial differential equations. We concentrate on two secific examles:
More informationInfinitely Many Insolvable Diophantine Equations
ACKNOWLEDGMENT. After this aer was submitted, the author received messages from G. D. Anderson and M. Vuorinen that concerned [10] and informed him about references [1] [7]. He is leased to thank them
More informationHotelling s Two- Sample T 2
Chater 600 Hotelling s Two- Samle T Introduction This module calculates ower for the Hotelling s two-grou, T-squared (T) test statistic. Hotelling s T is an extension of the univariate two-samle t-test
More informationThe Algebra of Gene Assembly in Ciliates
The Algebra of Gene Assembly in Ciliates Robert Brijder and Hendrik Jan Hoogeboom Abstract The formal theory of intramolecular gene assembly in ciliates is fitted into the well-established theories of
More informationFinding Shortest Hamiltonian Path is in P. Abstract
Finding Shortest Hamiltonian Path is in P Dhananay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune, India bstract The roblem of finding shortest Hamiltonian ath in a eighted comlete grah belongs
More informationKhinchine inequality for slightly dependent random variables
arxiv:170808095v1 [mathpr] 7 Aug 017 Khinchine inequality for slightly deendent random variables Susanna Sektor Abstract We rove a Khintchine tye inequality under the assumtion that the sum of Rademacher
More informationElliptic Curves and Cryptography
Ellitic Curves and Crytograhy Background in Ellitic Curves We'll now turn to the fascinating theory of ellitic curves. For simlicity, we'll restrict our discussion to ellitic curves over Z, where is a
More informationA SIMPLE PLASTICITY MODEL FOR PREDICTING TRANSVERSE COMPOSITE RESPONSE AND FAILURE
THE 19 TH INTERNATIONAL CONFERENCE ON COMPOSITE MATERIALS A SIMPLE PLASTICITY MODEL FOR PREDICTING TRANSVERSE COMPOSITE RESPONSE AND FAILURE K.W. Gan*, M.R. Wisnom, S.R. Hallett, G. Allegri Advanced Comosites
More informationVISCOELASTIC PROPERTIES OF INHOMOGENEOUS NANOCOMPOSITES
VISCOELASTIC PROPERTIES OF INHOMOGENEOUS NANOCOMPOSITES V. V. Novikov ), K.W. Wojciechowski ) ) Odessa National Polytechnical University, Shevchenko Prosekt, 6544 Odessa, Ukraine; e-mail: novikov@te.net.ua
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationarxiv: v2 [math.nt] 9 Oct 2018
ON AN EXTENSION OF ZOLOTAREV S LEMMA AND SOME PERMUTATIONS LI-YUAN WANG AND HAI-LIANG WU arxiv:1810.03006v [math.nt] 9 Oct 018 Abstract. Let be an odd rime, for each integer a with a, the famous Zolotarev
More informationHEAT AND LAPLACE TYPE EQUATIONS WITH COMPLEX SPATIAL VARIABLES IN WEIGHTED BERGMAN SPACES
Electronic Journal of ifferential Equations, Vol. 207 (207), No. 236,. 8. ISSN: 072-669. URL: htt://ejde.math.txstate.edu or htt://ejde.math.unt.edu HEAT AN LAPLACE TYPE EQUATIONS WITH COMPLEX SPATIAL
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More informationFactorability in the ring Z[ 5]
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Dissertations, Theses, and Student Research Paers in Mathematics Mathematics, Deartment of 4-2004 Factorability in the ring
More informationSome results on Lipschitz quasi-arithmetic means
IFSA-EUSFLAT 009 Some results on Lischitz quasi-arithmetic means Gleb Beliakov, Tomasa Calvo, Simon James 3,3 School of Information Technology, Deakin University Burwood Hwy, Burwood, 35, Australia Deartamento
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers:,2,..., These are constructed using Peano axioms. We will not get into the hilosohical questions related to this and simly assume the
More informationFor q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i
Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:
More informationDiscrete Applied Mathematics. Maximal pivots on graphs with an application to gene assembly
Discrete Applied Mathematics 158 (2010) 1977 1985 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Maximal pivots on graphs with an application
More informationA Parallel Algorithm for Minimization of Finite Automata
A Parallel Algorithm for Minimization of Finite Automata B. Ravikumar X. Xiong Deartment of Comuter Science University of Rhode Island Kingston, RI 02881 E-mail: fravi,xiongg@cs.uri.edu Abstract In this
More informationSection 0.10: Complex Numbers from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative
Section 0.0: Comlex Numbers from Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.
More informationResearch Article A Wavelet Algorithm for Fourier-Bessel Transform Arising in Optics
Hindawi Publishing Cororation International Engineering Mathematics Volume 25, Article ID 789675, 9 ages htt://dx.doi.org/.55/25/789675 Research Article A Wavelet Algorithm for Fourier-Bessel Transform
More informationFault Tolerant Quantum Computing Robert Rogers, Thomas Sylwester, Abe Pauls
CIS 410/510, Introduction to Quantum Information Theory Due: June 8th, 2016 Sring 2016, University of Oregon Date: June 7, 2016 Fault Tolerant Quantum Comuting Robert Rogers, Thomas Sylwester, Abe Pauls
More informationIntrinsic Approximation on Cantor-like Sets, a Problem of Mahler
Intrinsic Aroximation on Cantor-like Sets, a Problem of Mahler Ryan Broderick, Lior Fishman, Asaf Reich and Barak Weiss July 200 Abstract In 984, Kurt Mahler osed the following fundamental question: How
More informationALGEBRAIC TOPOLOGY MASTERMATH (FALL 2014) Written exam, 21/01/2015, 3 hours Outline of solutions
ALGERAIC TOPOLOGY MASTERMATH FALL 014) Written exam, 1/01/015, 3 hours Outline of solutions Exercise 1. i) There are various definitions in the literature. ased on the discussion on. 5 of Lecture 3, as
More information16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes
Infinite Series 6. Introduction We extend the concet of a finite series, met in section, to the situation in which the number of terms increase without bound. We define what is meant by an infinite series
More information1. Introduction. ( u p 2 u ) (p 1) u p 2 u = 0, u(0) = 0, u (0) = 1,
Electronic Journal of Differential Equations, Vol. 208 (208), No. 35,.. ISSN: 072-669. URL: htt://ejde.math.txstate.edu or htt://ejde.math.unt.edu MACLAURIN SERIES FOR sin WITH AN INTEGER GREATER THAN
More informationPERFORMANCE BASED DESIGN SYSTEM FOR CONCRETE MIXTURE WITH MULTI-OPTIMIZING GENETIC ALGORITHM
PERFORMANCE BASED DESIGN SYSTEM FOR CONCRETE MIXTURE WITH MULTI-OPTIMIZING GENETIC ALGORITHM Takafumi Noguchi 1, Iei Maruyama 1 and Manabu Kanematsu 1 1 Deartment of Architecture, University of Tokyo,
More informationwhether a process will be spontaneous, it is necessary to know the entropy change in both the
93 Lecture 16 he entroy is a lovely function because it is all we need to know in order to redict whether a rocess will be sontaneous. However, it is often inconvenient to use, because to redict whether
More informationMATH 361: NUMBER THEORY EIGHTH LECTURE
MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first
More informationUsing a Computational Intelligence Hybrid Approach to Recognize the Faults of Variance Shifts for a Manufacturing Process
Journal of Industrial and Intelligent Information Vol. 4, No. 2, March 26 Using a Comutational Intelligence Hybrid Aroach to Recognize the Faults of Variance hifts for a Manufacturing Process Yuehjen E.
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem on Arithmetic Progressions Thai Pham Massachusetts Institute of Technology May 2, 202 Abstract In this aer, we derive a roof of Dirichlet s theorem on rimes in arithmetic rogressions.
More informationKeywords: Vocal Tract; Lattice model; Reflection coefficients; Linear Prediction; Levinson algorithm.
Volume 3, Issue 6, June 213 ISSN: 2277 128X International Journal of Advanced Research in Comuter Science and Software Engineering Research Paer Available online at: www.ijarcsse.com Lattice Filter Model
More informationWAVELETS, PROPERTIES OF THE SCALAR FUNCTIONS
U.P.B. Sci. Bull. Series A, Vol. 68, No. 4, 006 WAVELETS, PROPERTIES OF THE SCALAR FUNCTIONS C. PANĂ * Pentru a contrui o undină convenabilă Ψ este necesară şi suficientă o analiză multirezoluţie. Analiza
More informationSymmetry and Bonding Interactions in [Cu 2 Cl 6 ] Complexes
hys. stat. sol. (a) 913, No. 3, 913 918 (2002) Symmetry and Bonding Interactions in [Cu 2 Cl 6 ] Comlexes F. E. Atalay 1 ) Science and Art Faculty, Deartment of Physics, İnönü University, 44069, Malatya,
More informationShadow Computing: An Energy-Aware Fault Tolerant Computing Model
Shadow Comuting: An Energy-Aware Fault Tolerant Comuting Model Bryan Mills, Taieb Znati, Rami Melhem Deartment of Comuter Science University of Pittsburgh (bmills, znati, melhem)@cs.itt.edu Index Terms
More information