Table 1 |
|||||||||||||||||
|
Binning: illustration of how a DAS source may implement binning. |
|||||||||||||||||
|
Positions |
11 |
12 |
13 |
14 |
15 |
16 |
17 |
18 |
19 |
20 |
21 |
22 |
23 |
24 |
25 |
||
|
|
|||||||||||||||||
|
Available bins |
Bin 1 |
Bin 2 |
Bin 3 |
||||||||||||||
|
|
|
|
|||||||||||||||
|
Annotation score |
8 |
3 |
9 |
1 |
4 |
7 |
6 |
7 |
2 |
0 |
2 |
4 |
4 |
3 |
5 |
||
|
Features returned |
9 |
7 |
5 |
||||||||||||||
|
|
|||||||||||||||||
|
In this contrived example a client requests feature annotations for a segment of sequence between bases 11 and 25, with a maxbins parameter of 3. The DAS source has an annotation for every base but, after sorting each into its appropriate bin, returns only those features with the highest scores. |
|||||||||||||||||
|
Jenkinson et al. BMC Bioinformatics 2008 9(Suppl 8):S3 doi:10.1186/1471-2105-9-S8-S3 |
|||||||||||||||||