The Community for Technology Leaders
13th IEEE International Conference on BioInformatics and BioEngineering (2004)
Taichung, Taiwan, ROC
May 19, 2004 to May 21, 2004
ISBN: 0-7695-2173-8
pp: 387
Laurent Noé , LORIA/INRIA-Lorraine, France
Gregory Kucherov , LORIA/INRIA-Lorraine, France
Yann Ponty , LRI, France
We address the problem of estimating the sensitivity of seed-based similarity search algorithms. In contrast to approaches based on Markov models [Faster and more sensitive homology search, Designing seeds for similarity search in genomic DNA, Optimal spaced seeds for Hidden Markov Models, with application to homologous coding regions, Vector seeds: an extension to spaced seeds allows substantial improvements in sensitivity and specificity, Sensitivity analysis and efficient method for identifying optimal spaced seeds], 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.
Laurent Noé, Gregory Kucherov, Yann Ponty, "Estimating Seed Sensitivity on Homogeneous Alignments", 13th IEEE International Conference on BioInformatics and BioEngineering, vol. 00, no. , pp. 387, 2004, doi:10.1109/BIBE.2004.1317369
95 ms
(Ver 3.3 (11022016))