... also be included in the CAZy CBM2 0 classification. Proposal for a new clan of CBM Based on the bioinformatics analysis of SBD modules from CBM2 0 and CBM2 1 families, the hypothesis is A new clan ... clan of CBM families FEBS Journal 272 (2005) 54975513 ê 2005 FEBS 5499 A new clan of CBM families based on bioinformatics of starch-b...
Ngày tải lên: 07/03/2014, 21:20
... phylo- genetic analyses revealed that the intein sequence is clos- est to extremophilic archaeal inteins. The intriguing association of an extremophilic archaeal-type intein with a mesophilic eukaryotic-like ... Hirata R, Ohsumk Y, Nakano A, Kawasaki H, Suzuki K, Anraku Y: Molecular structure of a gene, VMA1, encoding the catalytic subunit of H(+)-translocating adenosine tripho...
Ngày tải lên: 18/06/2014, 22:20
báo cáo hóa học: " A new definition of burnout syndrome based on Farber''''s proposal" pptx
... 3 Department of Psychology, University of Zaragoza, Spain Email: Jesús Montero-Marín - jmontero@unizar.es; Javier Garc a- Campayo* - jgarcamp@arrakis.es; Domingo Mosquera Mera - kexava@gmail.com; Yolanda ... Toxicology Open Access Hypothesis A new definition of burnout syndrome based on Farber's proposal Jesús Montero-Marín 1 , Javier Garc a- Campayo* 1 , Domingo Mo...
Ngày tải lên: 20/06/2014, 00:20
báo cáo hóa học:" A new example of viral intein in Mimivirus" potx
... Variola virus, Asfarvirus, eukaryotic DNA polymerase α and δ catalytic subunits, and archaeal DNA polymerase I. Intein containing genes are indicated by bold letters in the figure. Numbers in ... Hirata R, Ohsumk Y, Nakano A, Kawasaki H, Suzuki K, Anraku Y: Molecular structure of a gene, VMA1, encoding the catalytic subunit of H(+)-translocating adenosine triphosphatase from vac...
Ngày tải lên: 20/06/2014, 04:20
Báo cáo toán học: " A phenomenological model of seizure initiation suggests network structure may explain seizure frequency in idiopathic generalised epilepsy" potx
... doi:10.1186/2190-8567-2-1 Oscar Benjamin (oscar.benjamin@bristol.ac.uk) Thomas H.B. Fitzgerald (thbfitz@gmail.com) Peter Ashwin (p.ashwin@exeter.ac.uk) Krasimira Tsaneva-Atanasova (k.tsaneva-atanasova@bristol.ac.uk) Fahmida ... net- work structure may explain seizure frequency in idiopathic generalised epilepsy Oscar Benjamin 1 , Thomas H. B. Fitzgerald 2 , Peter Ashwin 3 , Kr...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: "A new proof of the Szegö limit theorem and new results for Toeplitz operators with discontinuous symbol " pptx
... alt =""
Ngày tải lên: 05/08/2014, 09:46
Báo cáo toán học: "A new property of the determinant of a perturbation of a weak contraction. (Russian) " ppsx
... class="bi x0 y0 w1 h 1" alt =""
Ngày tải lên: 05/08/2014, 15:20
Báo cáo toán học: " A NEW CONSTRUCTION FOR CANCELLATIVE FAMILIES OF SETS" doc
... the union of any element of F 1 with any element of F 2 . It is easy to see that the product of two cancellative families is also a cancellative family ( (A 1 ,A 2 ) ∪(B 1 ,B 2 )= (A 1 ,A 2 ) ∪(C 1 ,C 2 ) ... ask how large cancellative families can be. We define f(n) to be the size of the largest possible cancellative family of subsets of a n-set and f(k,n)...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "A new class of q-Fibonacci polynomials" pot
... illuminating combinatorial proof of (3.1 ), which is an adapta- tion of Franklin’s proof of the pentagonal number theorem to this case (cf. [1] or [4]). Let u beawordoflengthn − 1,u= a n−1 . Then ... last letter is b we need the following result of [6]: the electronic journal of combinatorics 10 (2003), #R19 3 The above proof or the original proof of Franklin lets i k + k invari...
Ngày tải lên: 07/08/2014, 07:21
Báo cáo toán học: "A New Table of Constant Weight Codes of Length Greater than 28." docx
... 94B60 Abstract Existing tables of constant weight codes are mainly confined to codes of length n ≤ 28. This paper presents tables of codes of lengths 29 ≤ n ≤ 63. The mo- tivation for creating these tables was ... 1024 2352 8505 Y Table 9: Comparison of Results d =10,w =8. the electronic journal of combinat orics 13 (2006), #A2 14 A New Table of Constant Wei...
Ngày tải lên: 07/08/2014, 13:21
Báo cáo toán học: "A new upper bound on the total domination number of a graph" pdf
... u and v. the electronic journal of combinatorics 14 (2007), #R65 7 A new upper bound on the total domination number of a graph 1 Michael A. Henning ∗ and 2 Anders Yeo 1 School of Mathematical ... 223–240. [12] S. Thomass´e and A. Yeo, Total domination of graphs and small transversals of hy- pergraphs. To appear in Combinatorica. [13] Z. Tuza, Covering al...
Ngày tải lên: 07/08/2014, 15:23
Báo cáo toán học: "A New Family of Somos-like Recurrences" pptx
... journal of combinatorics 15 (2008), #R54 5 A New Family of Somos-like Recurrences Paul Heideman University of Wisconsin Madison, WI 53705 ppheideman@wisc.edu Emilie Hogan Department of Mathematics Rutgers, ... has been helpful in producing a combinatorial proof of integrality in some cases, many people pre- fer proofs of Laurentness versus other proofs of integrality. In...
Ngày tải lên: 07/08/2014, 15:23
Báo cáo toán hoc:"A New Lower Bound on the Density of Vertex Identifying Codes for the Infinit" doc
... more vertices). Proposition 1. The density of every vertex identifying code for the infinite hexagonal grid is at least 2/5. Proof: Our proof is by the discharging method. Thus, D must contain at least 2/5 of the ... elsewhere. Theorem 1. The density of every vertex identifying code for the infinite hexagonal grid is at least 12/29. Proof: Our proof is by disch...
Ngày tải lên: 08/08/2014, 01:20
Báo cáo toán học: "A new determinant expression of the zeta function for a hypergraph" ppt
... of the usu al Laplacian of a graph . We present a new determinant expression for th e Ihara-Selberg zeta function of a hyp ergraph, and give a linear algebraic proof of Storm’s Theorem. Furthermore, ... defined zeta functions of graphs, and showed that the reciprocals of zeta functions of regular graphs are explicit polynomials. A zeta function...
Ngày tải lên: 08/08/2014, 01:20
Báo cáo toán học: "A new bound on the domination number of graphs with minimum degree two" docx
... X u )-DS of G. Hence, γ(G u ; X u ) ≤ |D v | + 1 = γ(G v ; X v ) + 1. ✷ the electronic journal of combinatorics 18 (2011), #P12 34 A new bound on the domination number of graphs with minimum degree ... is of interest to determine upper bounds on the domination number of a graph. In 1989, McCuaig and Shepherd [12] presented the beautiful result that...
Ngày tải lên: 08/08/2014, 12:23