Results 81 to 90 of about 75,062 (184)

RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules

BMC Bioinformatics, 2007
Background In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular functions.
Michaeli Shulamit, Doniger Tirza, Horesh Yair, Unger Ron   +3 more
doaj   +1 more source

GESim: ultrafast graph-based molecular similarity calculation via von Neumann graph entropy

Journal of Cheminformatics
Representing molecules as graphs is a natural approach for capturing their structural information, with atoms depicted as nodes and bonds as edges.
Hiroaki Shiokawa, Shoichi Ishida, Kei Terayama   +2 more
doaj   +1 more source

NetLSD: Hearing the Shape of a Graph

, 2018
Comparison among graphs is ubiquitous in graph analytics. However, it is a hard task in terms of the expressiveness of the employed similarity measure and the efficiency of its computation.
Bronstein, Alex, Karras, Panagiotis, Mottin, Davide, Müller, Emmanuel, Tsitsulin, Anton   +4 more
core   +1 more source

An edit distance between quotiented trees [PDF]

, 2003
International audienceIn this paper we propose a dynamic programming algorithm to compare two quotiented trees using a constrained edit distance. A quotiented tree is a tree defined with an additional equivalent relation on vertices and such that the ...
Ferraro, Pascal, Godin, Christophe
core   +2 more sources

RNAmute: RNA secondary structure mutation analysis tool

BMC Bioinformatics, 2006
Background RNAMute is an interactive Java application that calculates the secondary structure of all single point mutations, given an RNA sequence, and organizes them into categories according to their similarity with respect to the wild type predicted ...
Barash Danny, Churkin Alexander
doaj   +1 more source

An edge-based approach for virtual network embedding based on the graph edit distance. [PDF]

PLoS One, 2023
Xu Z, Zhuang L, He M, Yang S, Song Y, Guo J, Li W.   +6 more
europepmc   +1 more source

An Edit Distance Between Graph Correspondences [PDF]

, 2017
The Hamming Distance has been largely used to calculate the dissimilarity of a pair of correspondences (also known as labellings or matchings) between two structures (i.e. sets of points, strings or graphs). Although it has the advantage of being simple in computation, it does not consider the structures that the correspondences relate.
Carlos Francisco Moreno-García, Francesc Serratosa, Xiaoyi Jiang   +2 more
openaire   +1 more source

Visualization of Topological Pharmacophore Space with Graph Edit Distance. [PDF]

ACS Omega, 2022
Nakano H, Miyao T.
europepmc   +1 more source

Ligand-Based Virtual Screening Based on the Graph Edit Distance. [PDF]

Int J Mol Sci, 2021
Rica E, Álvarez S, Serratosa F.
europepmc   +1 more source

Exploiting Multimedia Content: A Machine Learning Based Aproach

ELCVIA Electronic Letters on Computer Vision and Image Analysis, 2014
This thesis explores use of machine learning for multimedia content management involving single/multiple features, modalities and concepts. We introduce shape based feature for binary patterns and apply it for recognition and retrieval application in ...
Ehtesham Hassan
doaj   +1 more source