Skip Navigation



Bioinformatics Advance Access published online on September 5, 2007
Bioinformatics, doi:10.1093/bioinformatics/btm422
This Article
Right arrow Advance Access manuscript (PDF)
Right arrow All Versions of this Article:
23/22/2969    most recent
btm422v2
btm422v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ilie, L.
Right arrow Articles by Ilie, S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Ilie, L.
Right arrow Articles by Ilie, S.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2007). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Multiple spaced seeds for homology search

Lucian Ilie a and Silvana Ilie b

aDepartment of Computer Science, University of Western Ontario, N6A 5B7, London, Ontario, CANADA, bNumerical Analysis, Centre for Mathematical Sciences, Lund University, Box 118, SE-221 00 Lund, SWEDEN

*To whom correspondence should be addressed. Dr. Silvana Ilie, E-mail: ilie{at}csd.uwo.ca


  Abstract

Motivation: Homology search finds similar segments between two biological sequences, such as DNA or protein sequences. The introduction of optimal spaced seeds in PatternHunter, (Ma et al., 2002), has increased both the sensitivity and the speed of homology search and it has been adopted by many alignment programs such as BLAST. With the further improvement provided by multiple spaced seeds in PatternHunterII, (Li et al., 2004), Smith-Waterman sensitivity is approached at BLASTn speed. However, computing optimal multiple spaced seeds was proved to be NP-hard and current heuristic algorithms are all very slow (exponential).

Results: We give a simple algorithm which computes good multiple seeds in polynomial time. Due to a completely different approach, the difference with respect to the previous methods is dramatic. The multiple spaced seed of PatternHunterII, with 16 weight 11 seeds, (Li et al., 2004), was computed in 12 days. It takes us 17 seconds to find a better one. Our approach changes the way of looking at multiple spaced seeds.

Contact: ilie{at}csd.uwo.ca

Associate Editor: Prof. John Quackenbush

Received on May 14, 2007; revised on July 19, 2007; accepted on August 11, 2007

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.