title: Masking repeats while clustering ESTs.
abstract: 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.
authors.affiliation: Computational Biology Unit, University of Bergen Bergen, Norway.
authors.forename: Korbinian
authors.initials: K
authors.lastname: Schneeberger
authors.forename: Ketil
authors.initials: K
authors.lastname: Malde
authors.forename: Eivind
authors.initials: E
authors.lastname: Coward
authors.forename: Inge
authors.initials: I
authors.lastname: Jonassen
mesh_terms: D016000:Cluster Analysis; D020224:Expressed Sequence Tags / Q000737:chemistry*; D006801:Humans; D012091:Repetitive Sequences, Nucleic Acid; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software