On subset seeds for protein alignment

Details On subset seeds for protein alignment On subset seeds for protein alignment

2009-01-21

arxiv.org/abs/0901.3198v1

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6 (3) : 483-494, 2009

Biology

Quantitative Biology

Quantitative Methods

IEEE/ACM Transactions on Computational Biology and Bioinformatics (2009)

Scientific paper

10.1109/TCBB.2009.4

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 a comparative analysis of seeds built over those alphabets 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 seeds is less expressive (but less costly to implement) than the cumulative 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. Finally, we perform a large-scale benchmarking of our seeds against several main databases of protein alignments. Here again, the results show a comparable or better performance of our seeds vs. BLASTP.

Affiliated with

Also associated with

No associations

Rating

On subset seeds for protein alignment 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 On subset seeds for protein alignment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On subset seeds for protein alignment will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-684156