906 search results - page 40 / 182 » Matching Subsequences in Trees |
GD
2009
Springer
14 years 9 days ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
DASFAA
2003
IEEE
14 years 1 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
ISBI
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a general framework for image discrimination based on identifying small, localized differences between images. Our novel matching scheme is based on an alternate inform...