An optimal decomposition algorithm for tree edit distance

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Erik D. Demaine Massachusetts Institute of Technology, Cambridge, MA
Shay Mozes Brown University, Providence, RI
Benjamin Rossman Massachusetts Institute of Technology, Cambridge, MA
Oren Weimann Massachusetts Institute of Technology, Cambridge, MA
An optimal decomposition algorithm for tree edit distance Published by ACM 2009 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 94
· Downloads (cumulative): 397
· Citation Count: 10

Published in:
Cover Image
 
· Journal
ACM Transactions on Algorithms (TALG) TALG Homepage archive
Volume 6 Issue 1, December 2009
Article No. 2
ACM New York, NY, USA
table of contents doi>10.1145/1644015.1644017

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder