Computer Science – Data Structures and Algorithms
Scientific paper
2006-01-27
Journal of Bioinformatics and Computational Biology 4 (2006) 2, pp 553--569
Computer Science
Data Structures and Algorithms
Scientific paper
10.1142/S0219720006001977
We propose a general approach to compute the seed sensitivity, that can be applied to different definitions of seeds. It treats separately three components of the seed sensitivity problem -- a set of target alignments, an associated probability distribution, and a seed model -- that are specified by distinct finite automata. The approach is then applied to a new concept of subset seeds for which we propose an efficient automaton construction. Experimental results confirm that sensitive subset seeds can be efficiently designed using our approach, and can then be used in similarity search producing better results than ordinary spaced seeds.
Kucherov Gregory
Noé Laurent
Roytberg Mihkail
No associations
LandOfFree
A unifying framework for seed sensitivity and its application to subset seeds 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 A unifying framework for seed sensitivity and its application to subset seeds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A unifying framework for seed sensitivity and its application to subset seeds will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-505984