807 search results - page 32 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
138
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
144
Voted
AAAI
2004
15 years 5 months ago
2004
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...
159
click to vote
JACM
2006
15 years 4 months ago
2006
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
143
click to vote
EGH
2009
Springer
15 years 1 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
155
click to vote
JCDL
2006
ACM
15 years 10 months ago
2006
ACM
Document clustering has been used for better document retrieval, document browsing, and text mining in digital library. In this paper, we perform a comprehensive comparison study ...