807 search results - page 15 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
106
Voted
ICDAR
2003
IEEE
15 years 5 months ago
2003
IEEE
Classifier subset selection (CSS) from a large ensemble is an effective way to design multiple classifier systems (MCSs). Given a validation dataset and a selection criterion, the...
BMCBI
2008
14 years 11 months ago
2008
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
ER
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
119
click to vote
ISCI
2007
14 years 11 months ago
2007
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...