title: RepMaestro: scalable repeat detection on disk-based genome sequences.
abstract: BACKGROUND
  We investigate the problem of exact repeat detection on large genomic sequences. Most existing approaches based on suffix trees and suffix arrays (SAs) are limited either to small sequences or those that are memory resident. We introduce RepMaestro, a software that adapts existing in-memory-enhanced SA algorithms to enable them to scale efficiently to large sequences that are disk resident. Supermaximal repeats, maximal unique matches (MuMs) and pairwise branching tandem repeats have been used to demonstrate the practicality of our approach; the first such study to use an enhanced SA to detect these repeats in large genome sequences.
  
  
  RESULTS
  The detection of supermaximal repeats was observed to be up to two times faster than Vmatch, but more importantly, was shown to scale efficiently to large genome sequences that Vmatch could not process due to memory constraints (4 GB). Similar results were observed for the detection of MuMs, with RepMaestro shown to scale well and also perform up to six times faster than Vmatch. For tandem repeats, RepMaestro was found to be slower but could nonetheless scale to large disk-resident sequences. These results are a significant advance in the quest of scalable repeat detection. Software availability: RepMaestro is available at http://www.naskitis.com.
authors.affiliation: Department of Computer Science and Software Engineering, University of Melbourne, Australia. askitisn@gmail.com
authors.forename: Nikolas
authors.initials: N
authors.lastname: Askitis
authors.forename: Ranjan
authors.initials: R
authors.lastname: Sinha
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D030541:Databases, Genetic; D016678:Genome; D023281:Genomics / Q000379:methods; D012984:Software