Academic literature on the topic 'Structural edit'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Structural edit.'
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 "Structural edit"
Garcia-Hernandez, Carlos, Alberto Fernández, and Francesc Serratosa. "Learning the Edit Costs of Graph Edit Distance Applied to Ligand-Based Virtual Screening." Current Topics in Medicinal Chemistry 20, no. 18 (August 24, 2020): 1582–92. http://dx.doi.org/10.2174/1568026620666200603122000.
Full textAkande, Olanrewaju, Andrés Barrientos, and Jerome P. Reiter. "Simultaneous Edit and Imputation For Household Data with Structural Zeros." Journal of Survey Statistics and Methodology 7, no. 4 (December 24, 2018): 498–519. http://dx.doi.org/10.1093/jssam/smy022.
Full textNeuhaus, Michel, and Horst Bunke. "Edit distance-based kernel functions for structural pattern classification." Pattern Recognition 39, no. 10 (October 2006): 1852–63. http://dx.doi.org/10.1016/j.patcog.2006.04.012.
Full textHIDOVIĆ, DŽENA, and MARCELLO PELILLO. "METRICS FOR ATTRIBUTED GRAPHS BASED ON THE MAXIMAL SIMILARITY COMMON SUBGRAPH." International Journal of Pattern Recognition and Artificial Intelligence 18, no. 03 (May 2004): 299–313. http://dx.doi.org/10.1142/s0218001404003216.
Full textRico-Juan, Juan R., Jose J. Valero-Mas, and José M. Iñesta. "Bounding Edit Distance for similarity-based sequence classification on Structural Pattern Recognition." Applied Soft Computing 97 (December 2020): 106778. http://dx.doi.org/10.1016/j.asoc.2020.106778.
Full textRica, Elena, Susana Álvarez, and Francesc Serratosa. "Ligand-Based Virtual Screening Based on the Graph Edit Distance." International Journal of Molecular Sciences 22, no. 23 (November 25, 2021): 12751. http://dx.doi.org/10.3390/ijms222312751.
Full textPinhas, Tamar, Shay Zakov, Dekel Tsur, and Michal Ziv-Ukelson. "Efficient edit distance with duplications and contractions." Algorithms for Molecular Biology 8, no. 1 (2013): 27. http://dx.doi.org/10.1186/1748-7188-8-27.
Full textRiesen, Kaspar, Andreas Fischer, and Horst Bunke. "Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations." International Journal of Pattern Recognition and Artificial Intelligence 29, no. 02 (February 27, 2015): 1550011. http://dx.doi.org/10.1142/s0218001415500111.
Full textStrug, Joanna, and Barbara Strug. "Using Structural Similarity to Classify Tests in Mutation Testing." Applied Mechanics and Materials 378 (August 2013): 546–51. http://dx.doi.org/10.4028/www.scientific.net/amm.378.546.
Full textYAMAMOTO, YOSHIYUKI, KOUICHI HIRATA, and TETSUJI KUBOYAMA. "TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE." International Journal of Foundations of Computer Science 25, no. 03 (April 2014): 307–29. http://dx.doi.org/10.1142/s0129054114500154.
Full textDissertations / Theses on the topic "Structural edit"
García, Hernández Carlos Jesús. "Structural Pattern Recognition for Chemical-Compound Virtual Screening." Doctoral thesis, Universitat Rovira i Virgili, 2021. http://hdl.handle.net/10803/673441.
Full textLas moléculas tienen la forma natural de redes, lo que las hace ideales para estudiar mediante el empleo de sus representaciones gráficas, donde los nodos representan los átomos y los bordes representan los enlaces químicos. Una alternativa para esta representación sencilla es el gráfico reducido extendido, que resume las estructuras químicas utilizando descripciones de nodos de tipo farmacóforo para codificar las propiedades moleculares relevantes. Una vez que tenemos una forma adecuada de representar moléculas como gráficos, debemos elegir la herramienta adecuada para compararlas y analizarlas. La distancia de edición de gráficos se utiliza para resolver la coincidencia de gráficos tolerante a errores; esta metodología estima una distancia entre dos gráficos determinando el número mínimo de modificaciones necesarias para transformar un gráfico en el otro. Estas modificaciones (conocidas como operaciones de edición) tienen un costo de edición (también conocido como costo de transformación) asociado, que debe determinarse en función del problema. Este estudio investiga la efectividad de una comparación molecular basada solo en gráficos que emplea gráficos reducidos extendidos y distancia de edición de gráficos como una herramienta para aplicaciones de detección virtual basadas en ligandos. Estas aplicaciones estiman la bioactividad de una sustancia química empleando la bioactividad de compuestos similares. Una parte esencial de este estudio se centra en el uso de técnicas de procesamiento de lenguaje natural y aprendizaje automático para optimizar los costos de transformación utilizados en las comparaciones moleculares con la distancia de edición de gráficos.
Molecules are naturally shaped as networks, making them ideal for studying by employing their graph representations, where nodes represent atoms and edges represent the chemical bonds. An alternative for this straightforward representation is the extended reduced graph, which summarizes the chemical structures using pharmacophore-type node descriptions to encode the relevant molecular properties. Once we have a suitable way to represent molecules as graphs, we need to choose the right tool to compare and analyze them. Graph edit distance is used to solve the error-tolerant graph matching; this methodology estimates a distance between two graphs by determining the minimum number of modifications required to transform one graph into the other. These modifications (known as edit operations) have an edit cost (also known as transformation cost) associated, which must be determined depending on the problem. This study investigates the effectiveness of a graph-only driven molecular comparison employing extended reduced graphs and graph edit distance as a tool for ligand-based virtual screening applications. Those applications estimate the bioactivity of a chemical employing the bioactivity of similar compounds. An essential part of this study focuses on using machine learning and natural language processing techniques to optimize the transformation costs used in the molecular comparisons with the graph edit distance. Overall, this work shows a framework that combines graph reduction and comparison with optimization tools and natural language processing to identify bioactivity similarities in a structurally diverse group of molecules. We confirm the efficiency of this framework with several chemoinformatic tests applied to regression and classification problems over different publicly available datasets.
Holmquist, Johan. "Formalisation of edit operations for structure editors." Thesis, Linköping University, Department of Computer and Information Science, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5946.
Full textAlthough several systems with structure editors have been built, no model exist to formally describe the edit operations used in such editors. This thesis introduces such a model --- a formalism to describe general structure edit operations for text oriented documents. The model allows free bottom-up editing for any tree-based structural document with a textual content. It can also handle attribute and erroneous structures. Some classes of common structures have been identified and structure editor specifications constructed for them, which can be used and combined in the creation of other structure editors.
Darwiche, Mostafa. "When operations research meets structural pattern recognition : on the solution of error-tolerant graph matching problems." Thesis, Tours, 2018. http://www.theses.fr/2018TOUR4022/document.
Full textThis thesis is focused on Graph Matching (GM) problems and in particular the Graph Edit Distance (GED) problems. There is a growing interest in these problems due to their numerous applications in different research domains, e.g. biology, chemistry, computer vision, etc. However, these problems are known to be complex and hard to solve, as the GED is a NP-hard problem. The main objectives sought in this thesis, are to develop methods for solving GED problems to optimality and/or heuristically. Operations Research (OR) field offers a wide range of exact and heuristic algorithms that have accomplished very good results when solving optimization problems. So, basically all the contributions presented in thesis are methods inspired from OR field. The exact methods are designed based on deep analysis and understanding of the problem, and are presented as Mixed Integer Linear Program (MILP) formulations. The proposed heuristic approaches are adapted versions of existing MILP-based heuristics (also known as matheuristics), by considering problem-dependent information to improve their performances and accuracy
Ma, Yanhang. "Structural study of nano-structured materials: electron crystallography approaches." Doctoral thesis, Stockholms universitet, Institutionen för material- och miljökemi (MMK), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-129233.
Full textMamand, Heman. "The assessment of deteriorated concrete structures using extended digital image correlation (EDIC)." Thesis, University of Portsmouth, 2015. https://researchportal.port.ac.uk/portal/en/theses/the-assessment-of-deteriorated-concrete-structures-using-extended-digital-image-correlation-edic(91a6f1a9-6c0b-4b5c-8715-8edb4194ccac).html.
Full textMori, Tomoya. "Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology." 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/202741.
Full textStansberry, Tonya Faye. "Imprisoned and Empowered: The Women of Edith Wharton's Supernatural Fiction." [Johnson City, Tenn. : East Tennessee State University], 2003. http://etd-submit.etsu.edu/etd/theses/available/etd-0712103-091758/unrestricted/StansberryT072203f.pdf.
Full textTitle from electronic submission form. ETSU ETD database URN: etd-0712103-091758. Includes bibliographical references. Also available via Internet at the UMI web site.
Cheong, Elizabeth R. "The agricultural co-operative business structure in context a Western Australian study /." Connect to thesis, 2006. http://portal.ecu.edu.au/adt-public/adt-ECU2007.0022.html.
Full textKolli, Lakshmi Priya. "Mining for Frequent Community Structures using Approximate Graph Matching." University of Cincinnati / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1623166375110273.
Full textSwarts, Derek Juan. "Soil community structure and litter decomposition under irrigated Eucalyptus Globulus in South Western Australia." Connect to thesis, 2006. http://portal.ecu.edu.au/adt-public/adt-ECU2006.0051.html.
Full textBooks on the topic "Structural edit"
Riesen, Kaspar. Structural Pattern Recognition with Graph Edit Distance. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8.
Full textFelicitous space: The imaginative structures of Edith Wharton and Willa Cather. Chapel Hill: University of North Carolina Press, 1986.
Find full textFryer, Judith. Felicitous space: The imaginative structures of Edith Wharton and Willa Cather. Chapel Hill: University of North Carolina Press, 1986.
Find full textMiccichè, Calogero. Girgenti: Le pietre della meraviglia-- cadute : osservazioni, note autentiche, documenti editi e inediti, per il recupero del centro storico di Agrigento. [Italy: s. n., 2006.
Find full textMiccichè, Calogero. Girgenti: Le pietre della meraviglia-- cadute : osservazioni, note autentiche, documenti editi e inediti, per il recupero del centro storico di Agrigento. [Italy: s. n., 2006.
Find full textPolymorphous domesticities: Pets, bodies, and desire in four modern writers. Berkeley: University of California Press, 2012.
Find full textRiesen, Kaspar. Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications. Springer International Publishing AG, 2018.
Find full textRiesen, Kaspar. Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications. Springer, 2016.
Find full textRiesen, Kaspar. Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications. Springer London, Limited, 2016.
Find full textBurns. Design of Prestressed Concrete Structures 4th Edit Ion. John Wiley & Sons Inc, 2005.
Find full textBook chapters on the topic "Structural edit"
Riesen, Kaspar. "Graph Edit Distance." In Structural Pattern Recognition with Graph Edit Distance, 29–44. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_2.
Full textRiesen, Kaspar. "Bipartite Graph Edit Distance." In Structural Pattern Recognition with Graph Edit Distance, 45–65. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_3.
Full textRiesen, Kaspar. "Learning Exact Graph Edit Distance." In Structural Pattern Recognition with Graph Edit Distance, 101–19. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_5.
Full textRiesen, Kaspar. "Speeding Up Bipartite Graph Edit Distance." In Structural Pattern Recognition with Graph Edit Distance, 121–34. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_6.
Full textRiesen, Kaspar. "Introduction and Basic Concepts." In Structural Pattern Recognition with Graph Edit Distance, 3–28. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_1.
Full textRiesen, Kaspar. "Improving the Distance Accuracy of Bipartite Graph Edit Distance." In Structural Pattern Recognition with Graph Edit Distance, 69–99. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_4.
Full textRiesen, Kaspar. "Conclusions and Future Work." In Structural Pattern Recognition with Graph Edit Distance, 135–37. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_7.
Full textRiesen, Kaspar. "Appendix A: Experimental Evaluation of Sorted Beam Search." In Structural Pattern Recognition with Graph Edit Distance, 139–48. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_8.
Full textRiesen, Kaspar. "Appendix B: Data Sets." In Structural Pattern Recognition with Graph Edit Distance, 149–56. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_9.
Full textFischer, Andreas, Seiichi Uchida, Volkmar Frinken, Kaspar Riesen, and Horst Bunke. "Improving Hausdorff Edit Distance Using Structural Node Context." In Graph-Based Representations in Pattern Recognition, 148–57. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18224-7_15.
Full textConference papers on the topic "Structural edit"
Maergner, Paul, Kaspar Riesen, Rolf Ingold, and Andreas Fischer. "A Structural Approach to Offline Signature Verification Using Graph Edit Distance." In 2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR). IEEE, 2017. http://dx.doi.org/10.1109/icdar.2017.201.
Full textMunawaroh, Hidayatul, Daniel Oranova Siahaan, Reza Fauzan, and Evi Triandini. "Structural Similarity Measurement using Graph Edit Distance-Greedy on State chart Diagrams." In 2020 2nd International Conference on Cybernetics and Intelligent System (ICORIS). IEEE, 2020. http://dx.doi.org/10.1109/icoris50180.2020.9320764.
Full textMaergner, Paul, Nicholas Howe, Kaspar Riesen, Rolf Ingold, and Andreas Fischer. "Offline Signature Verification Via Structural Methods: Graph Edit Distance and Inkball Models." In 2018 16th International Conference on Frontiers in Handwriting Recognition (ICFHR). IEEE, 2018. http://dx.doi.org/10.1109/icfhr-2018.2018.00037.
Full textRay, Valery, Josef V. Oboňa, Sharang Sharang, Lolita Rotkina, Eddie Chang, and Kevin Tolua. "Optimizing Gas-Assisted Processes for Ga and Xe FIB Circuit Edit Application." In ISTFA 2016. ASM International, 2016. http://dx.doi.org/10.31399/asm.cp.istfa2016p0397.
Full textSantoso, Gagok-Imam, Jean-Michel Denichou, Wael Al-Alqum, Motaz Zeidan, and Mohammed Satti. "Collaborative Web Based Platform for 3D Reservoir Characterization and Geosteering Planning on the Cloud." In International Petroleum Technology Conference. IPTC, 2022. http://dx.doi.org/10.2523/iptc-22203-ea.
Full textHerschbein, Steven B., Kyle M. Winter, Carmelo F. Scrudato, Brian L. Yates, Edward S. Hermann, and John Carulli. "FinFET Transistor Output Drive Performance Modification by Focused Ion Beam (FIB) Chip Circuit Editing." In ISTFA 2020. ASM International, 2020. http://dx.doi.org/10.31399/asm.cp.istfa2020p0122.
Full textSevini, F., L. Debarberis, R. Gerard, and M. Brumovsky. "The European Network AMES for Reactor Component Ageing in the 6th EURATOM Framework Programme." In ASME 2003 Pressure Vessels and Piping Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/pvp2003-2158.
Full textLibovický, Jindřich, and Alexander Fraser. "Neural String Edit Distance." In Proceedings of the Sixth Workshop on Structured Prediction for NLP. Stroudsburg, PA, USA: Association for Computational Linguistics, 2022. http://dx.doi.org/10.18653/v1/2022.spnlp-1.6.
Full textLin, Guo-Hui, Bin Ma, and Kaizhong Zhang. "Edit distance between two RNA structures." In the fifth annual international conference. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/369133.369214.
Full textTinati, Ramine, Markus Luczak-Roesch, and Wendy Hall. "Finding Structure in Wikipedia Edit Activity." In the 25th International Conference Companion. New York, New York, USA: ACM Press, 2016. http://dx.doi.org/10.1145/2872518.2891110.
Full text