Quick, practical selection of effective seeds for homology search.
It has been observed that in homology search gapped seeds have better sensitivity than ungapped ones for the same cost (weight). In this paper, we propose a probability leakage model (a dissipative Markov system) to elucidate the mechanism that confers power to spaced seeds. Based on this model, we identify desirable features of gapped search seeds and formulate an extremely efficient procedure for seed design: it samples from the set of spaced seed exhibiting those features, evaluates their sensitivity, and then selects the best. The sensitivity of the constructed seeds is negligibly less than that of the corresponding known optimal seeds. While the challenging mathematical question of characterizing optimal search seeds remains open, we believe that our eminently efficient and effective approach represents a satisfactory solution from a practitioner's viewpoint.
Preparata
Franco P
FP
Computer Science Department, Brown University, Providence, RI 02912-1910, USA. franco@cs.brown.edu
Zhang
Louxin
L
Choi
Kwok Pui
KP
D000465:Algorithms; D019295:Computational Biology; D004247:DNA / Q000235:genetics; D023281:Genomics / Q000706:statistics & numerical data; D008390:Markov Chains; D008433:Mathematics; D015233:Models, Statistical; D012680:Sensitivity and Specificity; D016415:Sequence Alignment / Q000706:statistics & numerical data*
D004247:DNA