Skip Navigation

Nucleic Acids Research 2005 33(7):2176-2180; doi:10.1093/nar/gki511
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (84K) Freely available
Right arrow Screen PDF (78K) Freely available
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 ISI Web of Science
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 arrow Search for citing articles in:
ISI Web of Science (2)
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Schneeberger, K.
Right arrow Articles by Jonassen, I.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Schneeberger, K.
Right arrow Articles by Jonassen, I.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Published online 14 April 2005

© The Author 2005. Published by Oxford University Press. All rights reserved
The online version of this article has been published under an open access model. Users are entitled to use, reproduce, disseminate, or display the open access version of this article for non-commercial purposes provided that: the original authorship is properly and fully attributed; the Journal and Oxford University Press are attributed as the original place of publication with the correct citation details given; if an article is subsequently reproduced or disseminated not in its entirety but only in part or as a derivative work this must be clearly indicated. For commercial re-use, please contact journals.permissions{at}oupjournals.org

Article

Masking repeats while clustering ESTs

Korbinian Schneeberger1, Ketil Malde2, Eivind Coward2,* and Inge Jonassen1,2

1Computational Biology Unit, University of Bergen Bergen, Norway 2Department of Informatics, University of Bergen Bergen, Norway

*To whom correspondence should be addressed. Tel: +47 55584068; Fax: +47 55584199; Email: coward{at}ii.uib.no

Received December 20, 2004. Revised March 10, 2005. Accepted March 28, 2005.

A problem in EST clustering is the presence of repeat sequences. To avoid false matches, repeats have to be masked. This can be a time-consuming process, and it depends on available repeat libraries. We present a fast and effective method that aims to eliminate the problems repeats cause in the process of clustering. Unlike traditional methods, repeats are inferred directly from the EST data, we do not rely on any external library of known repeats. This makes the method especially suitable for analysing the ESTs from organisms without good repeat libraries. We demonstrate that the result is very similar to performing standard repeat masking before clustering.


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
 Plant Physiol.Home page
A. Masoudi-Nejad, S. Goto, R. Jauregui, M. Ito, S. Kawashima, Y. Moriya, T. R. Endo, and M. Kanehisa
EGENES: Transcriptome-Based Plant Database of Genes with Metabolic Pathway Information and Expressed Sequence Tag Indices in KEGG
Plant Physiology, June 1, 2007; 144(2): 857 - 866.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
K. Malde, K. Schneeberger, E. Coward, and I. Jonassen
RBR: library-less repeat detection for ESTs
Bioinformatics, September 15, 2006; 22(18): 2232 - 2236.
[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.