Efficient seeding techniques for protein similarity search

Details Efficient seeding techniques for protein similarity search Efficient seeding techniques for protein similarity search

2008-10-30

arxiv.org/abs/0810.5434v1

BIRD - ALBIO 13 (2008)

Biology

Quantitative Biology

Quantitative Methods

Scientific paper

10.1007/978-3-540-70600-7

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.

Affiliated with

Also associated with

No associations

Rating

Efficient seeding techniques for protein similarity search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient seeding techniques for protein similarity search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient seeding techniques for protein similarity search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-278566