Fast and sensitive probe selection for DNA chips using jumps in matching statistics

The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accuracy in the estimation of probe quality. We present an approach based on jumps in matching statistics that combines the best of both worlds. This article consists of two parts. The first part is theoretical. We introduce the notion of jumps in matching statistics between two strings and derive their properties. We estimate the frequency of jumps for random strings in a nonuniform Bernoulli model and present a new heuristic argument to find the center of the length distribution of the longest substring that two random strings have in common. The results are generalized to near-perfect matches with a small number of mismatches. In the second part, we use the concept of jumps to improve the accuracy of the longest common factor approach for probe selection by moving from a string-based to an energy-based specificity measure, while only slightly more than doubling the selection time.

[1]  Gary D. Stormo,et al.  Selection of optimal DNA oligos for gene expression arrays , 2001, Bioinform..

[2]  Sven Rahmann,et al.  On the Distribution of the Number of Missing Words in Random Texts , 2003, Combinatorics, Probability and Computing.

[3]  Enno Ohlebusch,et al.  The Enhanced Suffix Array and Its Applications to Genome Analysis , 2002, WABI.

[4]  Eugene L. Lawler,et al.  Sublinear Expected Time Approximate String Matching and Biological , 1991 .

[5]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[6]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[7]  Sven Rahmann,et al.  Rapid large-scale oligonucleotide selection for microarrays , 2002, Proceedings. IEEE Computer Society Bioinformatics Conference.

[8]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[9]  Eugene L. Lawler,et al.  Sublinear approximate string matching and biological applications , 1994, Algorithmica.

[10]  Craig A. Stewart,et al.  Introduction to computational biology , 2005 .

[11]  Dan Gusfield,et al.  Algorithms on strings , 1997 .

[12]  Alexander Schliep,et al.  Selecting signature oligonucleotides to identify organisms using DNA arrays , 2002, Bioinform..

[13]  J. SantaLucia,et al.  A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Sarmad Abbasi.  Longest Common Consecutive Substring in Two Random Strings , 1997 .

[15]  Sven Rahmann,et al.  Combinatorics of periods in strings , 2001, J. Comb. Theory A.