title: Repseek, a tool to retrieve approximate repeats from large DNA sequences.
abstract: Chromosomes or other long DNA sequences contain many highly similar repeated sub-sequences. While there are efficient methods for detecting strict repeats or detecting already characterized repeats, there is no software available for detecting approximate repeats in large DNA sequences allowing for weighted substitutions and indels in a coherent statistical framework. Here, we present an implementation of a two-steps method (seed detection followed by their extension) that detects those approximate repeats. Our method is computationally efficient enough to handle large sequences and is flexible enough to account for influencing factors, such as sequence-composition biases both at the seed detection and alignment levels.
  
  
  BACKGROUND
  http://wwwabi.snv.jussieu.fr/public/RepSeek/
authors.affiliation: Atelier de Bioinformatique, Université Pierre et Marie Curie-Paris 6 12, rue Cuvier, 75005 Paris, France. achaz@abi.snv.jussieu.fr
authors.forename: Guillaume
authors.initials: G
authors.lastname: Achaz
authors.forename: Frédéric
authors.initials: F
authors.lastname: Boyer
authors.forename: Eduardo P C
authors.initials: EP
authors.lastname: Rocha
authors.forename: Alain
authors.initials: A
authors.lastname: Viari
authors.forename: Eric
authors.initials: E
authors.lastname: Coissac
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D004247:DNA / Q000737:chemistry; D016247:Information Storage and Retrieval / Q000379:methods*; D007256:Information Systems; D017422:Sequence Analysis, DNA; D012984:Software; D020080:Tandem Repeat Sequences
chemical_list: D004247:DNA