Results 1  10
of
126
An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1998
"... Ordered, labeled trees are trees in which each node has a label and the lefttoright order of its children (if it has any) is fixed. Such trees have many applications in vision, pattern recognition, molecular biology and natural language processing. We consider a substructure of an ordered label ..."
Abstract

Cited by 49 (5 self)
 Add to MetaCart
labeled tree T to be a connected subgraph of T . Given two ordered labeled trees T1 and T2 and an integer d, the largest approximately common substructure problem is to find a substructure U1 of T1 and a substructure U2 of T2 such that U1 is within edit distance d of U2 and where there does not exist
On the Approximation of Largest Common Subtrees and Largest Common Point Sets
 Theoretical Comp. Science
, 1994
"... . This paper considers the approximability of the largest common subtree and the largest common subgraph problems, which have applications in molecular biology. It is shown that approximating the problems within a factor of n ffl is NPcomplete, while a general search algorithm which approximates ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
. This paper considers the approximability of the largest common subtree and the largest common subgraph problems, which have applications in molecular biology. It is shown that approximating the problems within a factor of n ffl is NPcomplete, while a general search algorithm which approximates
On the Approximation of Largest Common Subtrees and Largest Common Point Sets
 Theoretical Comp. Science
, 1994
"... . This paper considers the approximability of the largest common subtree and the largest common subgraph problems, which have applications in molecular biology. It is shown that approximating the problems within a factor of n ffl is NPcomplete, while a general search algorithm which approxima ..."
Abstract
 Add to MetaCart
. This paper considers the approximability of the largest common subtree and the largest common subgraph problems, which have applications in molecular biology. It is shown that approximating the problems within a factor of n ffl is NPcomplete, while a general search algorithm which
Approximation algorithms for 3D common substructure identification in drug and protein molecules
 Workshop on Algorithms and Data Structures
, 1999
"... Identifying the common 3D substructure between two drug or protein molecules is an important problem in synthetic drug design and molecular biology. This problem can be represented as the following geometric pattern matching problem: given two point sets A and B in threedimensions, and a real num ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Identifying the common 3D substructure between two drug or protein molecules is an important problem in synthetic drug design and molecular biology. This problem can be represented as the following geometric pattern matching problem: given two point sets A and B in threedimensions, and a real
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
 The 7th International Symposium, Latin American Theoretical Informatics (LATIN 2006). Lecture
"... Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as LCP (largest common point set problem): Let P and Q be two point sets in R 3, and let ɛ ≥ 0 be a ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as LCP (largest common point set problem): Let P and Q be two point sets in R 3, and let ɛ ≥ 0 be a
Thashing: An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
, 2005
"... Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as tolerantLCP (largest common point set problem): given two point sets M and Q in R 3, and a toler ..."
Abstract
 Add to MetaCart
Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as tolerantLCP (largest common point set problem): given two point sets M and Q in R 3, and a
POSTER PRESENTATION Open Access Making the most of approximate maximum
"... The maximum common substructure (MCS) problem is of great importance in multiple aspects of chemoinformatics. It has diverse applications ranging from lead prediction to automated reaction mapping and visual alignment of similar compounds. Many different algorithms have been developed [1], both e ..."
Abstract
 Add to MetaCart
The maximum common substructure (MCS) problem is of great importance in multiple aspects of chemoinformatics. It has diverse applications ranging from lead prediction to automated reaction mapping and visual alignment of similar compounds. Many different algorithms have been developed [1], both
Finding Compact Structural Motifs in Many Proteins
"... Abstract. Multiple structural alignment is a fundamental problem in computational biology. Compared with sequence alignment, structural alignment is more powerful in detecting the evolutionary relationship of proteins. A variety of algorithms have been proposed to attack this problem, however, they ..."
Abstract
 Add to MetaCart
finding problem. For the former problem, the input consists of a set of protein structures in threedimensional space, R3. The objective is to find a setof substructures, one from each protein, that exhibit the highest degree of similarity. Roughly speaking, there are two main methods to measure
A Grouping Principle and Four Applications
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2003
"... AbstractWertheimer's theory suggests a general perception law according to which objects having a quality in common get perceptually grouped. The Helmholtz principle is a quantitative version of this general grouping law. It states that a grouping is perceptually "meaningful" if its ..."
Abstract

Cited by 59 (6 self)
 Add to MetaCart
small, say M 1; 000. We write dðP i ; P j Þ for the usual Euclidean distance between P i and P j . Computation of the Minimum Spanning Tree initialization : each point P i is a tree while there remains more than one tree find the 2 nearest trees and fuse them: When we fuse two trees A and B, they become
ative Commons Attribution NonCommercial No Derivatives licence. Researchers
"... I herewith certify that all material in this dissertation which is not my own work has been properly acknowledged. ..."
Abstract
 Add to MetaCart
I herewith certify that all material in this dissertation which is not my own work has been properly acknowledged.
Results 1  10
of
126