Search or add a thesis

Advanced Search (Beta)
Home > Analysis of the Virus- Encoded Genes Required for the Maintenance of Betasatellites by Geminiviruses

Analysis of the Virus- Encoded Genes Required for the Maintenance of Betasatellites by Geminiviruses

Thesis Info

Access Option

External Link

Author

Iqbal, Zafar

Program

PhD

Institute

Pakistan Institute of Engineering and Applied Sciences

City

Islamabad

Province

Islamabad

Country

Pakistan

Thesis Completing Year

2013

Thesis Completion Status

Completed

Subject

Natural Sciences

Language

English

Link

http://prr.hec.gov.pk/jspui/handle/123456789/1320

Added

2021-02-17 19:49:13

Modified

2024-03-24 20:25:49

ARI ID

1676725492429

Asian Research Index Whatsapp Chanel
Asian Research Index Whatsapp Chanel

Join our Whatsapp Channel to get regular updates.

Similar


Viruses of the family Geminiviridae are phytopathogens with circular single-stranded DNA genome encapsidated in characteristic geminate particles that are transmitted by insects. Economically the most important are the geminiviruses of the genus Begomovirus which are transmitted exclusively by the whitefly Bemisia tabaci that occur in both the Old World (OW) and New World (NW). Bipartite begomoviruses, with components known as DNA A and DNA B, are native to the NW. However, in the OW, the bipartite begomoviruses are out-numbered by the monopartite begomoviruses, with genomes consisting of a homolog of the DNA A component of the bipartite viruses. Many monopartite begomoviruses are associated with two classes of single-stranded DNA satellites, designated as alphasatellite and betasatellite. Betasatellites are, in many cases, essential for the helper begomovirus to infect, and induce typical disease symptoms in, the host from which they were isolated. For many begomovirus-betasatellite pairs the betasatellite encodes the major pathogenicity/symptom determinant of the complex. The study described here was designed to investigate the effects of mutation of selected begomovirus genes on infectivity, symptoms and the ability to maintain betasatellites. The coat protein (CP), V2, C2 and C4 genes, the products of which have in previous studies of monopartite begomoviruses been implicated in virus movement and/or pathogenicity, of two betsatellite-associated monopartite begomoviruses, Pedilanthus leaf curl virus (PedLCV) and Cotton leaf curl Kokhran virus (CLCuKoV) were mutated. Mutant viruses were inoculated to Nicotiana benthamiana in both the presence and absence of the cognate betasatellites, Tobacco leaf curl betasatellite (TbLCB) and Cotton leaf curl Multan betasatellite (CLCuMB), respectively. Mutation of the CP abolished infectivity of monopartite begomoviruses. The mutation could be complemented by transient expression of the CP at the point of inoculation-albeit without inducing symptoms. These results are consistent with previous studies, and suggest that the protein is required for virus spread/movement in plants. Also the results show for the first time that the CP is important for the maintenance of betasatellites. Mutation of the V2 genes of PedLCV and CLCuKoV lead to reduced and asymptomatic infections. Betasatellite fully restored the infectivity of CLCuKoV and partially restored the infectivity of PedLCV, although for xviiCLCuKoV infections were asymptomatic whereas PedLCV infections exhibited very mild symptoms. These findings, for the most part, agree with earlier studies indicating that the V2 is a pathogenicity determinant, has a role in virus movement and V2 plays a part in the maintenance of betasatellites by monopartite begomoviruses. Mutation of the C2 genes of both monopartite begomoviruses resulted in reduced and asymptomatic infections. Co-inoculation with betasatellite resulted in a greater number of plants in which virus spread systemically, but for the CLCuKoV/CLCuMB combination, viral DNA levels were higher than for mutant in the absence of the betasatellite. These findings agree with earlier studies, indicating that C2 is not essential for infectivity but affects symptom expression, and are consistent with C2 being a suppressor of post-transcriptional gene silencing, as well as showing that C2 plays a part in the maintenance of betasatellites. The results for the mutation of the C4 for the two viruses differed. For PedLCV mutation of C4 resulted in significantly reduced infectivity. For plants inoculated with TbLCB and the C4 mutant, fewer plants ultimately showed systemic movement of the betasatellite. For CLCuKoV mutation of the C4 had no discernible effect on infectivity of the virus or the maintenance of the betasatellite by the virus. The effects on symptoms are consistent with earlier results indicating that the C4 of monopartite begomoviruses plays a part in symptoms induced by the virus. Betasatellites are increasingly being identified in the field with bipartite begomoviruses. It was therefore of interest to examine the requirements for betasatellite maintenance by a bipartite virus such as Tomato leaf curl New Delhi virus (ToLCNDV). For the majority of bipartite begomoviruses, including ToLCNDV, both components are essential for symptomatic infection. As for the monopartite viruses, four mutants (of the CP, AV2, AC2 and AC4 genes encoded on DNA A) of ToLCNDV were produced. In the presence of the DNA B none of the mutations affected infectivity or symptoms. The betasatellite was not efficiently maintained by ToLCNDV (both in the presence and absence of the DNA B) but mutations of the AC2 and AC4 abolished the ability of the virus to maintain the satellite, indicating that these proteins are important in maintenance of the satellite by the virus. The earlier finding that betasatellites can complement DNA B functions of bipartite begomoviruses led to the suggestion that begomovirus movement is constrained by an RNAi-based resistance in plants. To investigate this hypothesis ToLCNDV DNA A was inoculated together with three well characterised suppressor xviiiproteins from heterologous RNA viruses. Transient expression of each of the three suppressors (the Tobacco etch virus [genus Potyvirus, family Potyviridae] HC-Pro, the Cymbidium ringspot virus [genus Tombusvirus, family Tombusviridae] p19 and the Turnip crinkle virus [genus Carmovirus, family Tombusviridae] coat protein) at the point of inoculation with ToLCNDV DNA A resulted in more plants in which systemic movement of the virus was evident. These findings support the contention that begomovirus movement is countered by a plant RNAi-based defence. In addition to being of academic interest, the studies described here were conducted in the belief that a better understanding of virus-satellite interactions could lead to novel means of reducing agricultural losses due to these pathogens; possibly identifying new targets for engineered resistance that interfere with virus-satellite interactions. Advances made in this regard are discussed.
Loading...
Loading...

Similar Books

Loading...

Similar Chapters

Loading...

Similar News

Loading...

Similar Articles

Loading...

Similar Article Headings

Loading...

زبان اور بولی میں فرق

موضوع 5:زبان اور بولی میں فرق
زبان:
زبان خیالات و احساسات کا ذریعہ اظہار ہے۔جذبات و احساسات کی شکل زبان ہے اس کا کام لفظوں اور فقروں کے توسط سے ان کے ذہنی مفہوم و دلائل اور ان کے عام خیالات کی ترجمانی کرنا ہے۔زبان بولیوں کے مجموعے کا نام ہے۔
بولی :
بولی کسی زبان کی وہ ذیلی شاخ ہے جس کے بولنے والوں کو زبان کے کسی اختلاف کا احساس نہیں ہوتا البتہ کسی زبان کی ایک بولی بولنے والوں کو اسی زبان کی دوسری بولی کے تلفظ کے فرق کا احساس ہوتا ہے۔ہر زبان کا ہر بولی کا مخصوص انداز ہوتا ہے زبان چشمے کی حیثیت رکھتی ہے اور بولی اس سے پھوٹنے والی نہریں۔بولی ایک ایسی زبان ہے جو کسی علاقے میں رائج ہوتی ہے اس کی کوئی ادبی حیثیت نہیں ہوتی۔ زبان جس قدر وسیع ہو گی اس کی بولیاں بھی اسی قدر وسیع ہو گی۔ بولی عام فہم زبان ہے جو ہم مقامی لوگوں سے سیکھتے ہیں ایک بولی بولنے والے عام طور پر ایک زبان استعمال کرتے ہیں ہر علاقے کی بولی کا مخصوص انداز ہوتا ہے۔
تلفظ کا اختلاف:
بولی قواعد و ضوابط سے آزاد ہوتی ہے بولیوں میں لفظ کی ادائیگی میں اختلاف پایا جاتا ہے مختلف علاقوں میں مختلف بولیاں بولی جاتی ہیں۔بعض بولیاں ترقی کرکے زبان کا منصب حاصل کر لیتی ہے اور بعض جگہوں پر صرف بولی بن کر رہ جاتی ہے۔ ہمارے ملک میں قبائلی علاقے ہیں جو غیر متمدن ہیں وہاں نقل مکانی کے مواقع کم ہوتے ہیں ان کے تلفظ میں اختلاف پایا جاتا ہے۔
زبان کا نظام:
ہر زبان اپنا نظام رکھتی ہے۔ یہ مختلف عناصر پر مشتمل ہوتا ہے۔ اس کے قواعد و ضوابط ہوتے ہیں مثلا صرف و نحو اس میں وقت کے ساتھ ساتھ تبدیلیاں آتی رہتی ہیں۔...

Moral Dichotomy: Coetzee’s Stance on Moral Dilemma in Postmodernist Society in Disgrace

Coetzee anticipates the moral dilemma of today's individuals, in order to achieve his aim torevert the current trends in moral philosophy which has marked morality with individual partialities. The morality of self/will has pervaded in the society with substantial philosophical argumentation as well. This research intends to study Dionysian morality in comparison with modern (Appolonian) principles of morality as presented by Coetzee. The research is planned to differentiate the two by presenting their roots with logical reasons; Nietzsche's conception of morality and the need of Freudian repression. In the context of Disgrace Coetzee developed his moral theory through circumstantial justice with such a force that all reasons given by Overman (Übermensch) of Nietzsche fail. The paper will unveil the relationship of power and the need for justice. Coetzee proves the importance of Freudian Repression Theory that makes everybody responsible for the concord in a society. The cultivation of Dionysian concept of life only brings disgrace to man, and such philosophies can only be supported when the individual is in power, vulnerability in the society makes man to understand the value of morality and exercise of proper judicial system. South Africal context of the novel situates the anticipation of Dionysian cult in more understanding way to the audience. To avoid social Darwinism, state institutions should come in action in order to ensure the equal power distribution among the masses. Uneven distribution of power creates only oppressors and victims in the society, which further lead society to chaos. Coetzee proves the importance of circumstantial justice over the institutional justice, as institutional justice can punish only but the transformation of transgressor only takes place with circumstantial justice and for the betterment of society, transformation provides better results than punishment because institutions do create a different power structures that also work to suppress people.

Distinguishability Parameters in Graphs

The idea of “distinguishing the vertices of a graph from one another” goes back to the work by Entringer and Gassman [36] and Sumner [81], where the authors posed a problem: which graphs have property that “there is one-to-one correspondence between vertices and their neighbourhoods”. The vertices of such graphs can be distinguished by their neighbourhoods. The idea has demonstrated its fundamental nature through a wide variety of applications associated to graphs in theory of networks, communication, robot navigation, programming a robot in manipulating objects to name a few. Later work on distinguishability parameters of graphs has used ideas different from the work of Sumner. The following approaches to the problem have found more attention than others. In the distance-based approach, each vertex of a connected graph Γ is distinguished from every other vertex of Γ by labeling a subset M of V (Γ) and using the distances between the vertices of Γ and those of M to construct a one-to-one function on V (Γ). The minimum cardinality of set M is called the metric dimension of Γ. In the symmetry breaking approach, we choose a set of vertices of Γ which has only the trivial automorphism in its stabilizer (only the trivial automorphism fixes the vertices in S). Another idea in symmetry breaking approach is that we choose a set D of vertices and color them with the minimum number of colors. In both of the ideas, the automorphism group of graph Γ is destroyed and we are assured that every vertex of graph can be distinguished. The minimum cardinality of set S is called the fixing number of Γ and the minimum number of colors required to color the vertices of set D is called the distinguishing number of Γ. In the location-domination approach, we choose a dominating set L of a graph Γ such that every vertex of Γ outside the dominating set is uniquely distinguished by its neighborhood within the dominating set. In the covering code approach, we find a set of vertices whose neighborhoods uniquely overlap at any vertex of graph Γ. The brief details of our contributions to this area are as follows: We define a new distinguishability parameter ‘fixed number’ of graphs that gives us the minimum number of vertices with random choice such that fixing those vertices destroys the automorphism group of the graph. We extend the study of weak total resolving set, weak total metric dimension and weak total resolving number of graphs. We also study well-known distinguishingability parameters locating-dominating sets for functigraphs and locating-dominating sets, identifying codes and distinguishing number for non-zero component graphs associated to finite vector space. A set of vertices S of a graph Γ is called a fixing set of Γ, if only the trivial automorphism of Γ fixes every vertex in S. The fixing number of a graph is the smallest cardinality of a fixing set. The fixed number of a graph Γ is the minimum number γ, such that every subset of vertices of Γ with cardinality γ is a fixing set of Γ. A graph Γ is called a γ-fixed graph, if its fixing number and fixed number are both γ. We study the fixed number of a graph and give a construction of a graph of higher fixed number from a graph of lower fixed number. We find bound on γ in terms of the diameter of a distance-transitive γ-fixed graph. A resolving set of vertices M ⊆ V (Γ) is called a weak total resolving set of Γ, if for each vertex σ ∈ M (symbols σ, ρ are used to represent the vertices of a graph) and for each ρ ∈ V (Γ) \ M, there is one element in M \ {σ} that resolves σ and ρ. The smallest cardinality of a weak total resolving set is called the weak total metric dimension of Γ. In this thesis, we extend the study of weak total resolving sets. We give some characterization and realization results on weak total metric dimension and weak total resolving number. We find weak total metric dimension of tree graph. We also define randomly weak total γ-dimensional graph and study its properties. We find weak total resolving sets and weak total metric dimension of functigraphs of some families of graphs. A subset L of the vertices of a graph Γ is called a locating-dominating set of Γ if for every two distinct vertices σ, ρ ∈ V (Γ) \ L, we have ∅ 6= NΓ(σ) ∩ L 6= NΓ(ρ) ∩ L 6= ∅. The location-domination number of Γ is the minimum cardinality of a locating-dominating set in Γ. Let Γ1 and Γ2 be the disjoint copies of a graph Γ and η : V (Γ1) → V (Γ2) be a function. A functigraph FΓ η consists of vertex set V (Γ1) ∪ V (Γ2) and edge set E(Γ1) ∪ E(Γ2) ∪ {σρ : ρ = η(σ)}. We study the variation of location-domination number in passing from Γ to FΓ η and find its sharp lower and upper bounds. We also study the location-domination number of functigraphs of complete graphs for all possible definitions of function η. We also obtain the location-domination number of functigraphs of a family of spanning subgraphs of complete graphs. We investigate the problem of covering the vertices of non-zero component graphs associated to finite vector spaces as introduced by Das [33], such that we can uniquely identify any vertex by examining the vertices that cover it. We use locating-dominating sets and identifying codes, which are closely related concepts for this purpose. We find the location-domination number and the identifying number of the graph and study the exchange property for locatingdominating sets and identifying codes. We extend the study of properties of automorphisms of non-zero component graphs associated to finite vector spaces. We prove that the symmetric group of basis vectors is isomorphic to the automorphism group of the graph. We find the distinguishing number of the graph for both of the cases, when number of field elements are 2 and more than 2.