564 search results - page 5 / 113 » Error-tolerant Tree Matching |
CC
2003
Springer
14 years 18 days ago
2003
Springer
Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations...
PVLDB
2010
13 years 5 months ago
2010
Multi-pattern matching involves matching a data item against a large database of “signature” patterns. Existing algorithms for multipattern matching do not scale well as the s...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computat...
IPMI
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. Vascular systems are segmented from CT...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...