Results 21 to 30 of about 7,310 (242)
Path histogram distance and complete subtree histogram distance for rooted labelled caterpillars
Journal of Information and Telecommunication, 2020 A rooted labelled caterpillar (a caterpillar, for short) is a rooted labelled unordered tree transformed to a path after removing all the leaves in it. In this paper, we discuss two histogram distance between caterpillars.
Taiga Kawaguchi +2 more
doaj +1 more source
A Tree Similarity Computation Method Based on Structrue Feature [PDF]
Jisuanji gongcheng, 2018 In order to efficiently compute the similarity of tree,a method of computing the tree similarity based on structure feature is proposed.Firstly,all non-isomorphic sub-trees of K nodes are constructed,then the number of the isomorphic sub-tree from tree ...
CHEN Yanhua,LI Jian
doaj +1 more source
Clustering of Synthetic Routes Using Tree Edit Distance [PDF]
Journal of Chemical Information and Modeling, 2020 We present a novel algorithm to compute the distance between synthesis routes based on a tree edit distance calculation. Such distances can be used to cluster synthesis routes from a retrosynthesis prediction tool. We show that the clustering of routes from a retrosynthesis analysis is performed in less than ten seconds on average, and only constitutes
Samuel Genheden +2 more
openaire +2 more sources
Penilaian Kesamaan Entity Relationship Diagram dengan Algoritme Tree Edit Distance
Jurnal Nasional Teknik Elektro dan Teknologi Informasi, 2017 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
Authenticating q-Gram-Based Similarity Search Results for Outsourced String Databases
Mathematics, 2023 Approximate string searches have been widely applied in many fields, such as bioinformatics, text retrieval, search engines, and location-based services (LBS).
Liangyong Yang +4 more
doaj +1 more source
PLoS Computational Biology, 2023 High throughput experimental approaches are increasingly allowing for the quantitative description of cellular and organismal phenotypes. Distilling these large volumes of complex data into meaningful measures that can drive biological insight remains a ...
Gunalan Natesan +3 more
doaj +1 more source
Learning Stochastic Tree Edit Distance [PDF]
, 2006 Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured documents. In this context, many applications require the calculation of similarities between tree pairs. The most studied distance is likely the tree edit distance (ED) for
Bernard, Marc +2 more
openaire +2 more sources
Optimized Signature Selection for Efficient String Similarity Search
IEEE Access, 2020 In this paper, we study the problem of string similarity search to retrieve in a database all strings similar to a query string within a given threshold. To measure the similarity between strings, we use edit distance.
Taegyoung Lee, Tae-Sun Chung, Jongik Kim
doaj +1 more source
Weighted Edit Distance Computation: Strings, Trees, and Dyck
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023 Given two strings of length $n$ over alphabet $Σ$, and an upper bound $k$ on their edit distance, the algorithm of Myers (Algorithmica'86) and Landau and Vishkin (JCSS'88) computes the unweighted string edit distance in $\mathcal{O}(n+k^2)$ time. Till date, it remains the fastest algorithm for exact edit distance computation, and it is optimal under ...
Das, D. +4 more
openaire +3 more sources
Generating Trees for Comparison
Computers, 2020 Tree comparisons are used in various areas with various statistical or dissimilarity measures. Given that data in various domains are diverse, and a particular comparison approach could be more appropriate for specific applications, there is a need to ...
Danijel Mlinarić +2 more
doaj +1 more source