Estimating seed sensitivity on homogeneous alignments

Computer Science – Other Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1109/BIBE.2004.1317369

We address the problem of estimating the sensitivity of seed-based similarity search algorithms. In contrast to approaches based on Markov models [18, 6, 3, 4, 10], we study the estimation based on homogeneous alignments. We describe an algorithm for counting and random generation of those alignments and an algorithm for exact computation of the sensitivity for a broad class of seed strategies. We provide experimental results demonstrating a bias introduced by ignoring the homogeneousness condition.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Estimating seed sensitivity on homogeneous alignments 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 Estimating seed sensitivity on homogeneous alignments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimating seed sensitivity on homogeneous alignments will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-413396

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.