Journal Article

Fast computation of neighbor seeds

Lucian Ilie and Silvana Ilie

in Bioinformatics

Volume 25, issue 6, pages 822-823
Published in print March 2009 | ISSN: 1367-4803
Published online January 2009 | e-ISSN: 1460-2059 | DOI: http://dx.doi.org/10.1093/bioinformatics/btp054
Fast computation of neighbor seeds

Show Summary Details

Preview

Motivation: Alignment of biological sequences is one of the most frequently performed computer tasks. The current state of the art involves the use of (multiple) spaced seeds for producing high quality alignments. A particular important class is that of neighbor seeds which combine high sensitivity with reduced space requirements. Current algorithms for computing good neighbor seeds are very slow (exponential).

Results: We give a polynomial-time heuristic algorithm that computes better neighbor seeds than previous ones while being several orders of magnitude faster.

Contact: ilie@csd.uwo.ca

Journal Article.  1396 words.  Illustrated.

Subjects: Bioinformatics and Computational Biology

Full text: subscription required

How to subscribe Recommend to my Librarian

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.