
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Louxin Zhang, "Superiority of Spaced Seeds for Homology Search," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 4, no. 3, pp. 496505, JulySeptember, 2007.  
BibTex  x  
@article{ 10.1109/tcbb.2007.1013, author = {Louxin Zhang}, title = {Superiority of Spaced Seeds for Homology Search}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {4}, number = {3}, issn = {15455963}, year = {2007}, pages = {496505}, doi = {http://doi.ieeecomputersociety.org/10.1109/tcbb.2007.1013}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  Superiority of Spaced Seeds for Homology Search IS  3 SN  15455963 SP496 EP505 EPD  496505 A1  Louxin Zhang, PY  2007 KW  Homology search KW  pattern matching KW  sequence alignment KW  spaced seeds KW  renewal theory KW  run statistics VL  4 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] S.F. Altschul et al., “Basic Local Alignment Search Tool,” J.Molecular Biology, vol. 215, pp. 403410, 1990.
[2] S.F. Altschul et al., “Gapped Blast and PsiBlast: A New Generation of Protein Database Search Programs,” Nucleic Acids Research, vol. 25, pp. 33893402, 1997.
[3] N. Balakrishnan and M.V. Koutras, Runs and Scans with Applications. John Wiley & Sons, 2002.
[4] S. Batzoglou, “The Many Faces of Sequence Alignment,” Briefings in Bioinformatics, vol. 6, pp. 622, 2005.
[5] B. Brejovà, D. Brown, and T. Vinař, “Optimal Spaced Seeds for Homologous Coding Regions,” J. Bioinformatics and Computational Biology, vol. 1, pp. 595610, 2004.
[6] J. Buhler, “Efficient LargeScale Sequence Comparison by LocalSensitive Hashing,” Bioinformatics, vol. 17, pp. 419428, 2001.
[7] J. Buhler, U. Keich, and Y. Sun, “Designing Seeds for Similarity Search in Genomic DNA,” Proc. Seventh Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB '03), pp. 6775, 2003.
[8] S. Burkhardt and J. Karkkainen, “Better Filtering with Gapped qGrams,” Fundamenta Informaticae XXIII, pp. 10011018, 2003.
[9] A. Califano and I. Rigoutsos, “FLASH: Fast LookUp Algorithm for String Homology,” technical report, IBM T.J. Watson Research Center, 1995.
[10] K.P. Choi and L. Zhang, “Sensitivity Analysis and Efficient Method for Identifying Optimal Spaced Seeds,” J. Computer and System Sciences, vol. 68, pp. 2240, 2004.
[11] K.P. Choi and L. Zhang, “Analysis of Spaced Seed Technique in Sequence Alignment,” Cosmos, vol. 1, pp. 5773, 2005.
[12] K.P. Choi, F. Zeng, and L. Zhang, “Good Spaced Seeds for Homology Search,” Bioinformatics, vol. 20, pp. 10531059, 2004.
[13] W. Feller, An Introduction to Probability Theory and Its Applications, third ed. Wiley, 1968.
[14] V. Gotea, V. Veeramachaneni, and W. Makalowski, “Mastering Seeds for Genomic Size Nucleotide BLAST Searches,” Nucleic Acids Research, vol. 31, pp. 69356941, 2003.
[15] L.J. Guibas and A.M. Odlyzko, “String Overlaps, Pattern Matching, and Nontransitive Games,” J. Combinational Theory, vol. 30, pp. 183208, 1981.
[16] G.H. Hardy, J.E. Littlewood, and G. Pólya, Inequalities, second ed. Cambridge Univ. Press, 1952.
[17] P. Jacquet and W. Szpankowski, “Analytic Approach to Pattern Matching,” Applied Combinatorics on Words, M. Lothaire, ed., Cambridge Press, 2005.
[18] U. Keich, M. Li, B. Ma, and J. Tromp, “On Spaced Seeds for Similarity Search,” Discrete Applied Math., vol. 3, pp. 253263, 2004.
[19] W.J. Kent, “BLAT—The BLASTLike Alignment Tool,” Genome Research, vol. 12, pp. 656664, 2002.
[20] W.J. Kent and A.M. Zahler, “Conservation, Regulation, Synteny, and Introns in a LargeScale C. briggsaeC. elegans Genomic Alignment,” Genome Research, vol. 10, pp. 11151125, 2000.
[21] Y. Kong, “Methods to Find Optimal Multiple Spaced Seeds for Homology Search Using Generalized Correlations,” manuscript, 2005.
[22] L. Noé and G. Kucherov, “YASS: Enhancing the Sensitivity of DNA Similarity Search,” Nucleic Acids Research, vol. 33, pp. W540W543, 2005.
[23] G. Kucherov, L. Noé, and M. Roytberg, “A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds,” Proc. Fifth Workshop Algorithms in Bioinformatics (WABI '05), 2005.
[24] S.Y. Li, “A Martingale Approach to the Study of Occurrence of Sequence Patterns in Repeated Experiments,” Annals of Applied Probability, vol. 8, pp. 11711176, 1980.
[25] M. Li and B. Ma, “On the Complexity of Computing the Sensitivity of Spaced Seeds,” manuscript, 2005.
[26] M. Li, B. Ma, D. Kisman, and J. Tromp, “PatternHunterII: Highly Sensitive and Fast Homology Search,” J. Bioinformatics and Computational Biology, vol. 2, pp. 417440, 2004.
[27] B. Ma, J. Tromp, and M. Li, “PatternHunterFaster and More Sensitive Homology Search,” Bioinformatics, vol. 18, pp. 440445, 2002.
[28] P. Nicodéme, B. Salvy, and P. Flajolet, “Motif Statistics,” Lecture Notes in Computer Sciences, vol. 1643, pp. 194211, 1999.
[29] F.P. Preparata, L. Zhang, and K.P. Choi, “Quick, Practical Selection of Effective Seeds for Homology Search,” J. Computational Biology, vol. 12, pp. 11371152, 2005.
[30] G. Reinert, S. Schbath, and M. Waterman, “Probabilistic and Statistical Properties of Words: An Overview,” J. Computational Biology, vol. 7, pp. 146, 2000.
[31] S.J. Schwager, “Run Probabilities in Sequences of MarkovDependent Trials,” J. Am. Statistics Assoc., vol. 78, pp. 168175, 1983.
[32] S. Schwartz et al., “HumanMouse Alignment with BLASTZ,” Genome Research, vol. 13, pp. 103107, 2003.
[33] A.D. Solov'ev, “A Combinatorial Identity and Its Application to the Problem Concerning the First Occurences of a Rare Event,” Theory of Probability and Application, vol. 11, pp. 276282, 1966.
[34] Y. Sun and J. Buhler, “Designing Multiple Simultaneous Seeds for DNA Similarity Search,” Proc. ACMSIAM Int'l Conf. Research in Computational Molecular Biology (RECOMB '04), pp. 7685, 2004.
[35] I.H. Yang, S.H. Wang, Y.H. Chen, P.H. Huang, L. Ye, X. Huang, and K.M. Chao, “Efficient Methods for Generating Optimal Single and Multiple Spaced Seeds,” Proc. Fourth IEEE Symp. Bioinformatics and Bioeng., pp. 411418, 2004.