Sciweavers

38 search results - page 2 / 8
» Tree Signatures and Unordered XML Pattern Matching
Sort
View
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
14 years 6 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
14 years 6 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...
WABI
2007
Springer
121views Bioinformatics» more  WABI 2007»
13 years 11 months ago
Seeded Tree Alignment and Planar Tanglegram Layout
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...
Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabr...
ATVA
2008
Springer
90views Hardware» more  ATVA 2008»
13 years 7 months ago
Tree Pattern Rewriting Systems
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...
Blaise Genest, Anca Muscholl, Olivier Serre, Marc ...
PVLDB
2010
136views more  PVLDB 2010»
13 years 3 months ago
SigMatch: Fast and Scalable Multi-Pattern Matching
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...
Ramakrishnan Kandhan, Nikhil Teletia, Jignesh M. P...