Sciweavers

169 search results - page 3 / 34
» Local similarity between quotiented ordered trees
Sort
View
PODS
2008
ACM
211views Database» more  PODS 2008»
14 years 7 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
EUSFLAT
2001
13 years 8 months ago
Similarity measurement on leaf-labelled trees
We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unorde...
Hans De Meyer, Bernard De Baets, Saskia Janssens
WABI
2004
Springer
14 years 24 days ago
Reconstructing Ancestral Gene Orders Using Conserved Intervals
Conserved intervals were recently introduced as a measure of similarity between genomes whose genes have been shuffled during evolution by genomic rearrangements. Phylogenetic reco...
Anne Bergeron, Mathieu Blanchette, Annie Chateau, ...
SBBD
2004
89views Database» more  SBBD 2004»
13 years 8 months ago
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
Marcos R. Vieira, Caetano Traina Jr., Fabio Jun Ta...
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
13 years 2 months ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...