Compressing and indexing labeled trees, with applications

doi:10.1145/1613676.1613680

Compressing and indexing labeled trees, with applications

Full Text:

PDF

Buy this Article

Authors:	Paolo Ferragina	Università di Pisa, Italy
	Fabrizio Luccio	Università di Pisa, Italy
	Giovanni Manzini	Università del Piemonte Orientale, Alessandria, Italy
	S. Muthukrishnan	Rutgers University, Piscataway, New Jersey

	2009 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 12 · Downloads (12 Months): 94 · Downloads (cumulative): 791 · Citation Count: 16

Published in:

	· Journal
	Journal of the ACM (JACM) JACM Homepage archive
	Volume 57 Issue 1, November 2009 Article No. 4 ACM New York, NY, USA table of contents doi>10.1145/1613676.1613680

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms burrows-wheeler transform design experimentation labeled tree compression labeled tree indexing path searching pattern matching theory tree navigation xml compression xml indexing

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

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