Tag
IntervalTree Centers
Tag to select a specific way to compute the center of an interval tree node.
Include Headers
seqan/misc/misc_interval_tree.h
Tags
ComputeCenter
For intervals that are more or less uniformly distributed in the value range, using the ComputeCenter tag may result in a more balanced tree compared to using the RandomCenter tag.
Remarks: center = minbegin + (maxend-minbegin)/2
RandomCenter
The RandomCenter tag guarantees that each node contains at least one interval, therefore the size of the tree is limited by the nummer of intervals. This may lead to an unbalanced tree, but is the most space-efficient and in practice the fastest method.
Remarks: center = center of random interval
See Also
SeqAn - Sequence Analysis Library - www.seqan.de
 

Page built @2012/10/02 11:10:38