G. Valiente. String Processing and Information Retrieval, 2001. SPIRE 2001. Proceedings.Eighth International Symposium on, page 212-219. (November 2001)
DOI: 10.1109/SPIRE.2001.989761
Abstract
Not Available
Description
IEEE Xplore Abstract - An efficient bottom-up distance between trees
%0 Conference Paper
%1 valiente2001efficient
%A Valiente, G.
%B String Processing and Information Retrieval, 2001. SPIRE 2001. Proceedings.Eighth International Symposium on
%D 2001
%K 2013 bottom-up distance efficient graph trees
%P 212-219
%R 10.1109/SPIRE.2001.989761
%T An efficient bottom-up distance between trees
%U http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=989761
%X Not Available
@inproceedings{valiente2001efficient,
abstract = {Not Available},
added-at = {2014-03-08T15:05:17.000+0100},
author = {Valiente, G.},
biburl = {https://www.bibsonomy.org/bibtex/285e84d49f0a6b78d9b61cf69d4ecbf41/s_nkeha},
booktitle = {String Processing and Information Retrieval, 2001. SPIRE 2001. Proceedings.Eighth International Symposium on},
description = {IEEE Xplore Abstract - An efficient bottom-up distance between trees},
doi = {10.1109/SPIRE.2001.989761},
interhash = {1f8bb86a40581d9cde98b24345bbd6f2},
intrahash = {85e84d49f0a6b78d9b61cf69d4ecbf41},
keywords = {2013 bottom-up distance efficient graph trees},
month = nov,
pages = {212-219},
timestamp = {2014-03-08T15:05:17.000+0100},
title = {An efficient bottom-up distance between trees},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=989761},
year = 2001
}