Experts has a new look! Let us know what you think of the updates.

Provide feedback
Home
Scholarly Works
Fast Computation of Good Multiple Spaced Seeds
Conference

Fast Computation of Good Multiple Spaced Seeds

Abstract

Homology search finds similar segments between two biological sequences, such as DNA or protein sequences. A significant fraction of computing power in the world is dedicated to performing such tasks. The introduction of optimal spaced seeds by Ma et al. 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 …

Authors

Ilie L; Ilie S

Series

Lecture Notes in Computer Science

Volume

4645

Pagination

pp. 346-358

Publisher

Springer Nature

Publication Date

2007

DOI

10.1007/978-3-540-74126-8_32

Conference proceedings

Lecture Notes in Computer Science

ISSN

0302-9743

Labels