Recognition of Noisy Subsequences Using Constrained Edit Distances
IEEE Transactions on Pattern Analysis and Machine Intelligence
Information Sciences: an International Journal
Tree graphs of RNA secondary structures and their comparisons
Computers and Biomedical Research
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
On the editing distance between unordered labeled trees
Information Processing Letters
Some MAX SNP-hard results concerning unordered labeled trees
Information Processing Letters
Information Sciences—Intelligent Systems: An International Journal
Numerical Similarity and Dissimilarity Measures Between Two Trees
IEEE Transactions on Computers
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Mapping the Growing Neural Gas to Situation Calculus
ICANN '02 Proceedings of the International Conference on Artificial Neural Networks
PDCS-a product definition and customisation system for product concept development
Expert Systems with Applications: An International Journal
A new dissimilarity measure between trees by decomposition of unit-cost edit distance
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
Hi-index | 0.15 |
In this paper, we consider the problem of recognizing ordered labeled trees by processing their noisy subsequence-trees which are “patched-up” noisy portions of their fragments. We assume that we are given H, a finite dictionary of ordered labeled trees. $\rm X^*$ is an unknown element of H, and U is any arbitrary subsequence-tree of $\rm X^*$. We consider the problem of estimating $\rm X^*$ by processing Y, which is a noisy version of U. The solution which we present is, to our knowledge, the first reported solution to the problem. We solve the problem by sequentially comparing Y with every element X of H, the basis of comparison being a new dissimilarity measure between two trees, which implicitly captures the properties of the corrupting mechanism (“channel”) which noisily garbles U into Y. The algorithm which incorporates this constraint has been used to test our pattern recognition system yielding a remarkable accuracy. Experimental results which involve manually constructed trees of sizes between 25 and 35 nodes, and which contain an average of 21.8 errors per tree demonstrate that the scheme has about 92.8 percent accuracy. Similar experiments for randomly generated trees yielded an accuracy of 86.4 percent.