Relevant bibliographies by topics / Transformation graph

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Transformation graph'

Author: Grafiati
Published: 3 June 2025
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Transformation graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Transformation graph"

1

RAFE, VAHID, and ADEL T. RAHMANI. "A NOVEL APPROACH TO VERIFY GRAPH SCHEMA-BASED SOFTWARE SYSTEMS." International Journal of Software Engineering and Knowledge Engineering 19, no. 06 (2009): 857–70. http://dx.doi.org/10.1142/s0218194009004398.

Full text
Abstract:
Graph Grammars have recently become more and more popular as a general formal modeling language. Behavioral modeling of dynamic systems and model to model transformations are a few well-known examples in which graphs have proven their usefulness in software engineering. A special type of graph transformation systems is layered graphs. Layered graphs are a suitable formalism for modeling hierarchical systems. However, most of the research so far concentrated on graph transformation systems as a modeling means, without considering the need for suitable analysis tools. In this paper we concentrat
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Haiying, Jia-Bao Liu, Shaohui Wang, et al. "Sharp Bounds for the General Sum-Connectivity Indices of Transformation Graphs." Discrete Dynamics in Nature and Society 2017 (2017): 1–7. http://dx.doi.org/10.1155/2017/2941615.

Full text
Abstract:
Given a graph G, the general sum-connectivity index is defined as χα(G)=∑uv∈E(G)dGu+dGvα, where dG(u) (or dG(v)) denotes the degree of vertex u (or v) in the graph G and α is a real number. In this paper, we obtain the sharp bounds for general sum-connectivity indices of several graph transformations, including the semitotal-point graph, semitotal-line graph, total graph, and eight distinct transformation graphs Guvw, where u,v,w∈+,-.
APA, Harvard, Vancouver, ISO, and other styles
3

Durgun, Derya, and Busra Ozen-Dortok. "Packing chromatic number of transformation graphs." Thermal Science 23, Suppl. 6 (2019): 1991–95. http://dx.doi.org/10.2298/tsci190720363d.

Full text
Abstract:
Graph coloring is an assignment of labels called colors to elements of a graph. The packing coloring was introduced by Goddard et al. [1] in 2008 which is a kind of coloring of a graph. This problem is NP-complete for general graphs. In this paper, we consider some transformation graphs and generalized their packing chromatic numbers.
APA, Harvard, Vancouver, ISO, and other styles
4

Luo, Haichang, Sakander Hayat, Yubin Zhong, Zhongyuan Peng, and Tamás Réti. "The IRC Indices of Transformation and Derived Graphs." Mathematics 10, no. 7 (2022): 1111. http://dx.doi.org/10.3390/math10071111.

Full text
Abstract:
An irregularity index IR(Γ) of a graph Γ is a nonnegative numeric quantity (i.e., IR(Γ)≥0) such that IR(Γ)=0 iff Γ is a regular graph. In this paper, we show that IRC closely correlates with the normal boiling point Tbp and the standard heat of formation ΔHfo of lower benzenoid hydrocarbons. The correlation models that fit the data efficiently for both Tbp and ΔHfo are linear. We develop further mathematical properties of IRC by calculating its exact expressions for the recently introduced transformation graphs as well as certain derived graphs, such as the total graph, semi-total point graph,
APA, Harvard, Vancouver, ISO, and other styles
5

Vidyashree H. R. "Some Derived Graphs of Ananta-Graphs." Panamerican Mathematical Journal 35, no. 3s (2025): 522–27. https://doi.org/10.52783/pmj.v35.i3s.4246.

Full text
Abstract:
Graph theory provides powerful tools for analyzing mathematical structures and sequences. The Ananta-graph, derived from the Collatz conjecture, represents integer transformations through directed edges, capturing number relationships under n→3n+1 and n→n/2 operations. This paper explores several derived graphs from the Ananta-graph, including line, middle, Mycielskian, subdivision, total, core, power, splitting and kernel graph, analyzing their structural properties and mathematical significance. By analyzing these derived graphs, we provide deeper insights into the topological, algebraic and
APA, Harvard, Vancouver, ISO, and other styles
6

Bagga, Jay. "Old and new generalizations of line graphs." International Journal of Mathematics and Mathematical Sciences 2004, no. 29 (2004): 1509–21. http://dx.doi.org/10.1155/s0161171204310094.

Full text
Abstract:
Line graphs have been studied for over seventy years. In 1932, H. Whitney showed that for connected graphs, edge-isomorphism implies isomorphism except forK3andK1,3. The line graph transformation is one of the most widely studied of all graph transformations. In its long history, the concept has been rediscovered several times, with different names such as derived graph, interchange graph, and edge-to-vertex dual. Line graphs can also be considered as intersection graphs. Several variations and generalizations of line graphs have been proposed and studied. These include the concepts of total g
APA, Harvard, Vancouver, ISO, and other styles
7

BUSATTO, GIORGIO, HANS-JÖRG KREOWSKI, and SABINE KUSKE. "Abstract hierarchical graph transformation." Mathematical Structures in Computer Science 15, no. 4 (2005): 773–819. http://dx.doi.org/10.1017/s0960129505004846.

Full text
Abstract:
In this paper we introduce a new hierarchical graph model to structure large graphs into small components by distributing the nodes (and, likewise, edges) into a hierarchy of packages. In contrast to other known approaches, we do not fix the type of underlying graphs. Moreover, our model is equipped with a rule-based transformation concept such that hierarchical graphs are not restricted to being used only for the static representation of complex system states, but can also be used to describe dynamic system behaviour.
APA, Harvard, Vancouver, ISO, and other styles
8

Basavanagoud, B., та Jaishri B. Veeragoudar. "A Criterion for (Non-)Planarity of The Block-Transformation Graph Gαβγ when αβγ = 101". Bulletin of Mathematical Sciences and Applications 10 (листопад 2014): 38–47. http://dx.doi.org/10.18052/www.scipress.com/bmsa.10.38.

Full text
Abstract:
The general concept of the block-transformation graph Gαβγ was introduced in [1]. The vertices and blocks of a graph are its members. The block-transformation graph G101 of a graph G is the graph, whose vertex set is the union of vertices and blocks of G, in which two vertices are adjacent whenever the corresponding vertices of G are adjacent or the corresponding blocks of G are nonadjacent or the corresponding members of G are incident. In this paper, we present characterizations of graphs whose block-transformation graphs G101 are planar, outerplanar or minimally nonouterplanar. Further we e
APA, Harvard, Vancouver, ISO, and other styles
9

Mirajkar, Keerthi G., and Y. B. Priyanka. "The Sum Degree Distance and the Product Degree Distance of Generalized Transformation Graphs Gab." Bulletin of Mathematical Sciences and Applications 16 (August 2016): 76–88. http://dx.doi.org/10.18052/www.scipress.com/bmsa.16.76.

Full text
Abstract:
In this contribution, we consider line splitting graph LS(G) of a graph G as transformation graph G++ of Gab. We investigate the sum degree distance DD+(G) and product degree distance DD*(G) of transformation graph Gab, which are weighted version of Wiener index. The Transformation graphs of Gab are G++, G+-, G-+ and G--.
APA, Harvard, Vancouver, ISO, and other styles
10

Imran, Muhammad, Shehnaz Akhter, and Hani Shaker. "Sharp bounds for the general Randić index of transformation graphs." Journal of Intelligent & Fuzzy Systems 39, no. 5 (2020): 7787–94. http://dx.doi.org/10.3233/jifs-201139.

Full text
Abstract:
Inequalities are a useful method to investigate and compare topological indices of graphs relatively. A large collection of graph associated numerical descriptors have been used to examine the whole structure of networks. In these analysis, degree related topological indices have a significant position in theoretical chemistry and nanotechnology. Thus, the computation of degree related indices is one of the successful topic of research. Given a molecular graph H , the general Randić connectivity index is interpreted as R α ( H ) = ∑ ℛ ∈ E ( H ) ( deg H ( a ) deg H ( b ) ) α , with α is a real
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Transformation graph"

1

Foss, Luciana. "Transactional graph transformation systems." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2008. http://hdl.handle.net/10183/14966.

Full text
Abstract:
Em contraste aos sistemas transformacionais, sistemas reativos são caracterisados por reagir continuamente a estímulos provinientes seu ambiente. Além da reatividade, se considerarmos que muitas aplicações requerem métodos de especificação que possibilitam descrever a distribuição espacial dos estados, sistemas de transformação de grafos parecem ser uma técnica de especificação bastante adequada. Algumas aplicações com essas características são sistemas móveis e vias biológicas. Além disso, diversas abordagens para especificação de sistemas reativos propõem usar linguagens assíncronas para esp
APA, Harvard, Vancouver, ISO, and other styles
2

Busatto, Giorgio. "An abstract model of hierarchical graphs and hierarchical graph transformation." Oldenburg : Univ., Fachbereich Informatik, 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=967851955.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dodds, Mike. "Graph transformation and pointer structures." Thesis, University of York, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.495871.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sarkar, Medha Shukla. "GXL, a graph transformation language with scoping and graph parameters." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0013/NQ52862.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brenas, Jon Haël. "Hoare-like verification of graph transformation." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM066/document.

Full text
Abstract:
En informatique comme dans de multiples autres domaines, les graphes peuvent être trouvés partout. Ils sont utilisés pour représenter des données dans des domaines allant de la chimie à l'architecture, en tant que structures abstraites ou que modèles des données et de leurs évolutions. Dans tous ces domaines, il est prévisible que les graphes évoluent au cours du temps suite à des réactions chimiques, une mise à jour des connaissance ou l'exécution d'un programme. Être capable de traiter ces transformations est une tâche particulièrement importante et difficile. Dans ce travail, notre objectif
APA, Harvard, Vancouver, ISO, and other styles
6

Alabdullatif, Mohammed Abdulrahman Ahmed. "Graph transformation games for negotiating features." Thesis, University of Leicester, 2017. http://hdl.handle.net/2381/39460.

Full text
Abstract:
The success of e-commerce applications and services depends on the outcomes of interactions between the provider of the products or services and its requestors. The flexibility of these agents to negotiate features of the products or services traded is an important characteristic of face-to-face business interactions, but is often missing in the online world. Flexibility is needed to discuss preferences and constraints in order to determine a solution that benefits both parties. Game theory is a natural framework in which to pose such problems. This thesis is concerned with a proposal-based ne
APA, Harvard, Vancouver, ISO, and other styles
7

Bapodra, Mayur. "Zooming out of membrane graph transformation systems." Thesis, University of Leicester, 2013. http://hdl.handle.net/2381/27791.

Full text
Abstract:
Living cells offer a rich variety of complex interactions and interesting structures to those wishing to model processes in systems biology. Of particular interest is the hierarchical nature of cell configurations, the compartmentalized reactions that can occur within individual cells, and the interaction between different levels of this hierarchy. Graph transformation systems are an intuitive and readable modelling paradigm that lends itself to representing such systems since graphs can be utilised to represent this rich structural information, while graph rewriting rules can concisely descri
APA, Harvard, Vancouver, ISO, and other styles
8

Busatto, Giorgio [Verfasser]. "An abstract model of hierarchical graphs and hierarchical graph transformation / von Giorgio Busatto." Oldenburg : Univ., Fachbereich Informatik, 2002. http://d-nb.info/967851955/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cherchago, Alexey. "Service specification and matching based on graph transformation." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980143039.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Backes, Peter [Verfasser]. "Cluster abstraction of graph transformation systems / Peter Backes." Berlin : epubli GmbH, 2015. http://d-nb.info/1079766537/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Transformation graph"

1

Gadducci, Fabio, and Timo Kehrer, eds. Graph Transformation. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-78946-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Behr, Nicolas, and Daniel Strüber, eds. Graph Transformation. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09843-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Parisi-Presicce, Francesco, and Bernhard Westfechtel, eds. Graph Transformation. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21145-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Corradini, Andrea, Hartmut Ehrig, Hans Jörg Kreowski, and Grzegorz Rozenberg, eds. Graph Transformation. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45832-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lambers, Leen, and Jens Weber, eds. Graph Transformation. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-92991-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Giese, Holger, and Barbara König, eds. Graph Transformation. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09108-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gadducci, Fabio, and Timo Kehrer, eds. Graph Transformation. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51372-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Echahed, Rachid, and Mark Minas, eds. Graph Transformation. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40530-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

de Lara, Juan, and Detlef Plump, eds. Graph Transformation. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61470-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Guerra, Esther, and Fernando Orejas, eds. Graph Transformation. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23611-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Transformation graph"

1

Corradini, Andrea, Barbara König, and Dennis Nolte. "Specifying Graph Languages with Type Graphs." In Graph Transformation. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61470-0_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Weber, Jens H. "GRAPE – A Graph Rewriting and Persistence Engine." In Graph Transformation. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61470-0_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Drewes, Frank, Berthold Hoffmann, and Mark Minas. "Graph Parsing as Graph Transformation." In Graph Transformation. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51372-6_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ismaili Alaoui, Ziad, and Detlef Plump. "Linear-Time Graph Programs for Unbounded-Degree Graphs." In Graph Transformation. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-64285-2_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brandes, Ulrik, and Christian Pich. "GraphML Transformation." In Graph Drawing. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31843-9_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Machowczyk, Adam, and Reiko Heckel. "Graph Rewriting for Graph Neural Networks." In Graph Transformation. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-36709-0_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Corradini, Andrea, Dominque Duval, Rachid Echahed, Frédéric Prost, and Leila Ribeiro. "The Pullback-Pushout Approach to Algebraic Graph Transformation." In Graph Transformation. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61470-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Maximova, Maria, Holger Giese, and Christian Krause. "Probabilistic Timed Graph Transformation Systems." In Graph Transformation. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61470-0_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Leblebici, Erhan, Anthony Anjorin, Lars Fritsche, Gergely Varró, and Andy Schürr. "Leveraging Incremental Pattern Matching Techniques for Model Synchronisation." In Graph Transformation. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61470-0_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Strüber, Daniel, Kristopher Born, Kanwal Daud Gill, et al. "Henshin: A Usability-Focused Framework for EMF Model Transformation Development." In Graph Transformation. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61470-0_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Transformation graph"

1

Wang, Ling, Yixiang Huang, and Hao Wu. "Diverse Transformation-Augmented Graph Tensor Convolutional Network for Dynamic Graph Representation Learning." In 2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, 2024. https://doi.org/10.1109/smc54092.2024.10831069.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Huang, Xupeng, Yang Yang, Chao Yang, and Yuhao Cui. "TFDTSTGCN: Time-frequency domain transformation space-time graph convolution." In 2024 WRC Symposium on Advanced Robotics and Automation (WRC SARA). IEEE, 2024. http://dx.doi.org/10.1109/wrcsara64167.2024.10685803.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhao, Huan, Xupeng Zha, and Zixing Zhang. "EmoTransKG: An Innovative Emotion Knowledge Graph to Reveal Emotion Transformation." In Findings of the Association for Computational Linguistics ACL 2024. Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.findings-acl.720.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Deli, Chunyang Ye, Hui Zhou, Shanyan Lai, and Bo Li. "Enhancing Microservice Migration Transformation from Monoliths with Graph Neural Networks." In 2025 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER). IEEE, 2025. https://doi.org/10.1109/saner64311.2025.00021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Zijian, Rong-Hua Li, Hongchao Qin, et al. "Filtration-Enhanced Graph Transformation." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/276.

Full text
Abstract:
Graph kernels and graph neural networks (GNNs) are widely used for the classification of graph data. However, many existing graph kernels and GNNs have limited expressive power, because they cannot distinguish graphs if the classic 1-dimensional Weisfeiler-Leman (1-WL) algorithm does not distinguish them. To break the 1-WL expressiveness barrier, we propose a novel method called filtration-enhanced graph transformation, which is based on a concept from the area of topological data analysis. In a nutshell, our approach first transforms each original graph into a filtration-enhanced graph based
APA, Harvard, Vancouver, ISO, and other styles
6

Matsuda, Kazutaka, and Kazuyuki Asada. "A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction." In POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages. ACM, 2017. http://dx.doi.org/10.1145/3018882.3018883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Onur, Şeyma, and Gökşen Bacak Turan. "Geodetic Domination Integrity of Transformation Graphs." In 6th International Students Science Congress. Izmir International Guest Student Association, 2022. http://dx.doi.org/10.52460/issc.2022.030.

Full text
Abstract:
The concept of domination has a wide field of research in graph theory. The dominating set of a graph G is a subset S of vertices of G such that every vertex not in S is adjacent to at least one vertex in S [1]. The concept of domination has various types defined on vertices and edges. If each vertex in a dominating set S of the graph G is also a member of the geodetic set, then the set S is called a geodetic dominating set [2]. A communication network is a connection between centers and those centers that allow them to communicate with each other it consists of lines. These network centers ca
APA, Harvard, Vancouver, ISO, and other styles
8

Fenglin Han, Surya Bahadur Kathayat, Hien Le, Rolv Brek, and Peter Herrmann. "Towards choreography model transformation via graph transformation." In 2011 IEEE 2nd International Conference on Software Engineering and Service Science (ICSESS). IEEE, 2011. http://dx.doi.org/10.1109/icsess.2011.5982365.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Aouat, Asmaa, Fatima Bendella, and El abbassia Deba. "Tools of model transformation by graph transformation." In 2012 IEEE 3rd International Conference on Software Engineering and Service Science (ICSESS). IEEE, 2012. http://dx.doi.org/10.1109/icsess.2012.6269495.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Karsai, Gabor. "Session details: Graph transformation for model transformation." In ICSE '08: International Conference on Software Engineering. ACM, 2008. http://dx.doi.org/10.1145/3247078.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Transformation graph"

1

Baden, Scott B., John H. Weare, and Eric J. Bylaska. Automatic Transformation of MPI Programs to Asynchronous, Graph-Driven Form. Office of Scientific and Technical Information (OSTI), 2013. http://dx.doi.org/10.2172/1076871.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wan, Wei. A New Approach to the Decomposition of Incompletely Specified Functions Based on Graph Coloring and Local Transformation and Its Application to FPGA Mapping. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.6582.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Trickett, Susan B., and J. G. Trafton. Spatial Transformations in Graph Comprehension. Defense Technical Information Center, 2004. http://dx.doi.org/10.21236/ada479753.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Reisch, Bruce, Avichai Perl, Julie Kikkert, Ruth Ben-Arie, and Rachel Gollop. Use of Anti-Fungal Gene Synergisms for Improved Foliar and Fruit Disease Tolerance in Transgenic Grapes. United States Department of Agriculture, 2002. http://dx.doi.org/10.32747/2002.7575292.bard.

Full text
Abstract:
Original objectives . 1. Test anti-fungal gene products for activity against Uncinula necator, Aspergillus niger, Rhizopus stolonifer and Botrytis cinerea. 2. For Agrobacterium transformation, design appropriate vectors with gene combinations. 3. Use biolistic bombardment and Agrobacterium for transformation of important cultivars. 4. Characterize gene expression in transformants, as well as level of powdery mildew and Botrytis resistance in foliage of transformed plants. Background The production of new grape cultivars by conventional breeding is a complex and time-consuming process. Transfer
APA, Harvard, Vancouver, ISO, and other styles
5

Mawassi, Munir, Baozhong Meng, and Lorne Stobbs. Development of Virus Induced Gene Silencing Tools for Functional Genomics in Grapevine. United States Department of Agriculture, 2013. http://dx.doi.org/10.32747/2013.7613887.bard.

Full text
Abstract:
Grapevine is perhaps the most widely grown fruit crop. To understand the genetic make-up so as to improve the yield and quality of grapes and grape products, researchers in Europe have recently sequenced the genomes of Pinot noir and its inbred. As expected, function of many grape genes is unknown. Functional genomics studies have become the major focus of grape researchers and breeders. Current genetic approaches for gene function studies include mutagenesis, crossing and genetic transformation. However, these approaches are difficult to apply to grapes and takes long periods of time to accom
APA, Harvard, Vancouver, ISO, and other styles
6

Perl, Avichai, Bruce I. Reisch, and Ofra Lotan. Transgenic Endochitinase Producing Grapevine for the Improvement of Resistance to Powdery Mildew (Uncinula necator). United States Department of Agriculture, 1994. http://dx.doi.org/10.32747/1994.7568766.bard.

Full text
Abstract:
The original objectives are listed below: 1. Design vectors for constitutive expression of endochitinase from Trichoderma harzianum strain P1. Design vectors with signal peptides to target gene expression. 2. Extend transformation/regeneration technology to other cultivars of importance in the U.S. and Israel. 3. Transform cultivars with the endochitinase constructs developed as part of objective 1. A. Characterize foliar powdery mildew resistance in transgenic plants. Background of the topic Conventional breeding of grapevines is a slow and imprecise process. The long generation cycle, large
APA, Harvard, Vancouver, ISO, and other styles
7

Mawassi, Munir, Adib Rowhani, Deborah A. Golino, Avichai Perl, and Edna Tanne. Rugose Wood Disease of Grapevine, Etiology and Virus Resistance in Transgenic Vines. United States Department of Agriculture, 2003. http://dx.doi.org/10.32747/2003.7586477.bard.

Full text
Abstract:
Rugose wood is a complex disease of grapevines, which occurs in all growing areas. The disease is spread in the field by vector transmission (mealybugs). At least five elongated-phloem- limited viruses are implicated in the various rugose wood disorders. The most fully characterized of these are Grapevine virus A (GV A) and GVB, members of a newly established genus, the vitivirus. GVC, a putative vitivirus, is much less well characterized than GV A or GVB. The information regarding the role of GVC in the etiology and epidemiology of rugose wood is fragmentary and no sequence data for GVC are a
APA, Harvard, Vancouver, ISO, and other styles
8

Lichter, Amnon, Gopi K. Podila, and Maria R. Davis. Identification of Genetic Determinants that Facilitate Development of B. cinerea at Low Temperature and its Postharvest Pathogenicity. United States Department of Agriculture, 2011. http://dx.doi.org/10.32747/2011.7592641.bard.

Full text
Abstract:
Botrytis cinerea is the postharvest pathogen of many agricultural produce with table grapes, strawberries and tomatoes as major targets. The high efficiency with which B. cinerea causes disease on these produce during storage is attributed in part due to its exceptional ability to develop at very low temperature. Our major goal was to understand the genetic determinants which enable it to develop at low temperature. The specific research objectives were: 1. Identify expression pattern of genes in a coldenriched cDNA library. 2. Identify B. cinerea orthologs of cold-induced genes 3. Profile pro
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Transformation graph' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography