93 search results - page 19 / 19 » Fast and Efficient Total Exchange on Two Clusters |
119
click to vote
EGH
2010
Springer
14 years 9 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
BMCBI
2006
14 years 11 months ago
2006
Background: Genome sequences vary strongly in their repetitiveness and the causes for this are still debated. Here we propose a novel measure of genome repetitiveness, the index o...
BMCBI
2006
14 years 11 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...