Results 41 to 50 of about 34,882 (289)
Bayesian graph edit distance [PDF]
This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability distribution for structural errors in the graph-matching problem.
Myers, R., Hancock, E.R., Wilson, R.C.
openaire +2 more sources
Japanese medical device adverse events terminology, published by the Japan Federation of Medical Devices Associations (JFMDA terminology), contains entries for 89 terminology items, with each of the terminology entries created independently.
Ayako Yagahara +2 more
doaj +1 more source
Convolutional Embedding for Edit Distance [PDF]
Edit-distance-based string similarity search has many applications such as spell correction, data de-duplication, and sequence alignment. However, computing edit distance is known to have high complexity, which makes string similarity search challenging for large datasets.
Xinyan Dai +5 more
openaire +2 more sources
Parameter-Free Extended Edit Distance [PDF]
The edit distance is the most famous distance to compute the similarity between two strings of characters. The main drawback of the edit distance is that it is based on local procedures which reflect only a local view of similarity.
Muhammad Marwan Muhammad Fuad +1 more
core +1 more source
Needleman-Wunsch Attention: A Framework for Enhancing DNA Sequence Embedding
In many biological research studies that rely on DNA sequence data, calculating the edit distance between two sequences is a vital component. However, computing the edit distance involves dynamic programming, which can be computationally intensive.
Kyelim Lee, Albert No
doaj +1 more source
Penilaian Kesamaan Entity Relationship Diagram dengan Algoritme Tree Edit Distance
Main competency in database learning is ability to design Entity Relationship Diagram (ERD). Generally, lecturer gives task to students to design an ERD with some requirements. These ERDs are then assessed by comparing them with the answers. In practice,
Humasak Simanjuntak +5 more
doaj +1 more source
Graph Edit Distance or Graph Edit Pseudo-Distance? [PDF]
Graph Edit Distance has been intensively used since its appearance in 1983. This distance is very appropriate if we want to compare a pair of attributed graphs from any domain and obtain not only a distance, but also the best correspondence between nodes of the involved graphs.
Francesc Serratosa +2 more
openaire +1 more source
On the edit distance of powers of cycles
21 pages, 1 ...
Zhanar Berikkyzy +2 more
openaire +4 more sources
In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Efficient top-k string similarity query algorithms
Computing top-k similar strings based on edit distance,i.e.,given a query string σ and string set S,finding k similar strings to σ based on edit distance from S.Firstly,two adaptive filter strategies based on length-skip index are proposed,such that to ...
Zi-yang CHEN +3 more
doaj +2 more sources

