Skip Navigation



Bioinformatics Advance Access published online on July 12, 2006
Bioinformatics, doi:10.1093/bioinformatics/btl368
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
22/18/2232    most recent
btl368v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 Malde, K.
Right arrow Articles by Jonassen, I.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Malde, K.
Right arrow Articles by Jonassen, I.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2006). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
Received April 19, 2006
Revised June 29, 2006
Accepted July 3, 2006

Article

RBR: library-less repeat detection for ESTs

Ketil Malde 1 *, Korbinian Schneeberger 2, Eivind Coward 3, and Inge Jonassen 4

1 Computational Biology Unit, Bergen Centre for Computational Sciences, University of Bergen
2 Genome-Oriented Bioinformatics, Wissenschaftszentrum Weihenstephan, Technische Universität München
3 Department of Informatics, University of Bergen
4 Computational Biology Unit, Bergen Centre for Computational Sciences, University of Bergen; Department of Informatics, University of Bergen

* To whom correspondence should be addressed.
Ketil Malde, E-mail: ketil.malde{at}bccs.uib.no


  Abstract

Motivation: Repeat sequences in ESTs are a source of problems, in particular for clustering. ESTs are therefore commonly masked against a library of known repeats. High quality repeat libraries are available for the widely studied organisms, but for most other organisms the lack of such libraries is likely to compromise the quality of EST analysis.

Results: We present a fast, flexible, and library-less method for masking repeats in EST sequences, based on match statistics within the EST collection. The method is not linked to a particular clustering algorithm. Extensive testing on data sets using different clustering methods and a genomic mapping as reference shows that this method gives results that are better than or as good as those obtained using RepeatMasker with a repeat library.

Availability: The implementation of RBR is available under the terms of the GPL from http://www.ii.uib.no/~ketil/bioinformatics.

Associate Editor: Alex Bateman
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
L. M. Bragg and G. Stone
k-link EST clustering: evaluating error introduced by chimeric sequences under different degrees of linkage
Bioinformatics, September 15, 2009; 25(18): 2302 - 2308.
[Abstract] [Full Text] [PDF]


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.