807 search results - page 12 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
106
Voted
BMCBI
2007
14 years 11 months ago
2007
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
170
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
ACL
1996
15 years 29 days ago
1996
In transformation-based parsing, a finite sequence of tree rewriting rules are checked for application to an input structure. Since in practice only a small percentage of rules ar...
93
Voted
ICSE
2004
IEEE-ACM
15 years 11 months ago
2004
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
103
click to vote
CORR
2006
Springer
14 years 11 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...