807 search results - page 7 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
108
click to vote
BMCBI
2004
14 years 11 months ago
2004
Background: Eukaryotic whole genome sequences are accumulating at an impressive rate. Effective methods for comparing multiple whole eukaryotic genomes on a large scale are needed...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
83
Voted
DAC
1999
ACM
15 years 4 months ago
1999
ACM
ENOR is an innovative way to produce provablypassive, reciprocal, and compact representations of RLC circuits. Beginning with the nodal equations, ENOR formulates recurrence relat...
78
Voted
JDA
2007
14 years 11 months ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
TKDE
2008
14 years 11 months ago
2008
In this paper, we present a new tree mining algorithm, DRYADEPARENT, based on the hooking principle first introduced in DRYADE. In the experiments, we demonstrate that the branchin...