Results 31 to 40 of about 34,882 (289)
Similar Supergraph Search Based on Graph Edit Distance
Algorithms, 2021 Subgraph and supergraph search methods are promising techniques for the development of new drugs. For example, the chemical structure of favipiravir—an antiviral treatment for influenza—resembles the structure of some components of RNA.
Masataka Yamada, Akihiro Inokuchi
doaj +1 more source
BinSlayer: Accurate Comparison of Binary Executables [PDF]
, 2013 As the volume of malware inexorably rises, comparison of binary code is of increasing importance to security analysts as a method of automatically classifying new malware samples; purportedly new examples of malware are frequently a simple evolution of ...
Martial Bourquin +5 more
core +1 more source
The Edit Distance as a Measure of Perceived Rhythmic Similarity
Empirical Musicology Review, 2012 The ‘edit distance’ (or ‘Levenshtein distance’) measure of distance between two data sets is defined as the minimum number of editing operations – insertions, deletions, and substitutions – that are required to transform one data set to the other (Orpen ...
Olaf Post, Godfried Toussaint
doaj +1 more source
Edit distance with move operations
Journal of Discrete Algorithms, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dana Shapira, James A. Storer
openaire +1 more source
Redefining the Graph Edit Distance [PDF]
SN Computer Science, 2021 AbstractGraph edit distance has been used since 1983 to compare objects in machine learning when these objects are represented by attributed graphs instead of vectors. In these cases, the graph edit distance is usually applied to deduce a distance between attributed graphs.
openaire +1 more source
Computing Edit Distance (Invited Talk)
, 2021 The edit distance (or Levenshtein distance) between two strings x, y is the minimum number of character insertions, deletions, and substitutions needed to convert x into y.
Koucký, Michal
core +1 more source
Enhanced Levenshtein Edit Distance Method functioning as a String-to-String Similarity Measure
Iraqi Journal for Computers and Informatics, 2016 Levenshtein is a Minimum Edit Distance method; it is usually used in spell checking applications for generating candidates. The method computes the number of the required edit operations to transform one string to another and it can recognize three types
Abbas Al-Bakry, Marwa Al-Rikaby
doaj +1 more source
A Secure Multi-Party Computation Protocol for Graph Editing Distance against Malicious Attacks
Mathematics, 2023 The secure computation of the graph structure is an important element in the field of secure calculation of graphs, which is important in querying data in graphs, since there are no algorithms for the graph edit distance problem that can resist attacks ...
Xin Liu +6 more
doaj +1 more source
Accel-Align: a fast sequence mapper and aligner based on the seed–embed–extend method
BMC Bioinformatics, 2021 Background Improvements in sequencing technology continue to drive sequencing cost towards $100 per genome. However, mapping sequenced data to a reference genome remains a computationally-intensive task due to the dependence on edit distance for dealing ...
Yiqing Yan +2 more
doaj +1 more source
Discovering Lexical Similarity Using Articulatory Feature-Based Phonetic Edit Distance
IEEE Access, 2022 Lexical Similarity (LS) between two languages uncovers many interesting linguistic insights such as phylogenetic relationship, mutual intelligibility, common etymology, and loan words. There are various methods through which LS is evaluated.
Tafseer Ahmed +3 more
doaj +1 more source