Efficient seeding techniques for protein similarity search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Efficient seeding techniques for protein similarity search


We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to construct seeds with optimal sensitivity/selectivity trade-offs. We propose several different design methods and use them to construct several alphabets.We then perform an analysis of seeds built over those alphabet and compare them with the standard Blastp seeding method [2,3], as well as with the family of vector seeds proposed in [4]. While the formalism of subset seed is less expressive (but less costly to implement) than the accumulative principle used in Blastp and vector seeds, our seeds show a similar or even better performance than Blastp on Bernoulli models of proteins compatible with the common BLOSUM62 matrix.
Fichier principal
Vignette du fichier
paper.pdf (244.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00335564 , version 1 (29-10-2008)



Mihkail Roytberg, Anna Gambin, Laurent Noé, Slawomir Lasota, Eugenia Furletova, et al.. Efficient seeding techniques for protein similarity search. Proceedings of the 2nd International Conference BIRD, Jul 2008, Vienna, Austria. pp.466-478, ⟨10.1007/978-3-540-70600-7⟩. ⟨inria-00335564⟩
120 View
276 Download



Gmail Facebook X LinkedIn More