Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/pami/WangSSZC98
%A Wang, Jason Tsong-Li
%A Shapiro, Bruce A.
%A Shasha, Dennis E.
%A Zhang, Kaizhong
%A Currey, Kathleen M.
%D 1998
%J IEEE Trans. Pattern Anal. Mach. Intell.
%K dblp
%N 8
%P 889-895
%T An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees.
%U http://dblp.uni-trier.de/db/journals/pami/pami20.html#WangSSZC98
%V 20
@article{journals/pami/WangSSZC98,
added-at = {2016-08-11T00:00:00.000+0200},
author = {Wang, Jason Tsong-Li and Shapiro, Bruce A. and Shasha, Dennis E. and Zhang, Kaizhong and Currey, Kathleen M.},
biburl = {https://www.bibsonomy.org/bibtex/2813f49eb2c7f8a2672617c1da76dadbf/dblp},
ee = {http://doi.ieeecomputersociety.org/10.1109/34.709622},
interhash = {ee8d15526e626dbbee7e3a137d451ae4},
intrahash = {813f49eb2c7f8a2672617c1da76dadbf},
journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
keywords = {dblp},
number = 8,
pages = {889-895},
timestamp = {2016-08-12T11:39:32.000+0200},
title = {An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees.},
url = {http://dblp.uni-trier.de/db/journals/pami/pami20.html#WangSSZC98},
volume = 20,
year = 1998
}