A parallel tree difference algorithm

Author: Skillicorn D.B.

Source: Information Processing Letters, Volume 60, Number 5, 9 December 1996 , pp. 231-235(5)

Publisher: Elsevier

Buy & download fulltext article:

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Keywords: Tree difference; Tree edit; Tree contraction; Structured text; Universal hashing; Accumulations

Language: English

Document Type: Research article

DOI: http://dx.doi.org/10.1016/S0020-0190(96)00171-8

Affiliations: 1: Department of Computing and Information Science, Goodwin Hall, Queen's University, Kingston K7L 3N6, Canada

Publication date: 1996-12-09

Related content

Tools

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page