Rapid homology search with two-stage extension and daughter seeds

6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Using a seed to rapidly "hit" possible homologies for further examination is a common practice to speed up homology search in molecular sequences. It has been shown that a collection of higher weight seeds have better sensitivity than a single lower weight seed at the same speed. However, huge memory requirements diminish the advantages of high weight seeds. This paper describes a two-stage extension method, which simulates high weight seeds with modest memory requirements. The paper also proposes the use of so-called daughter seeds, which is an extension of the previously studied vector seed idea. Daughter seeds, especially when combined with the two-stage extension, provide the flexibility to maximize the independence between the seeds, which is a well-known criterion for maximizing sensitivity. Some other practical techniques to reduce memory usage are also discussed in the paper. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Csurös, M., & Ma, B. (2005). Rapid homology search with two-stage extension and daughter seeds. In Lecture Notes in Computer Science (Vol. 3595, pp. 104–114). Springer Verlag. https://doi.org/10.1007/11533719_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free