Repseek, a tool to retrieve approximate repeats from large DNA sequences

  • Authors:
  • Guillaume Achaz;Frédéric Boyer;Eduardo P. C. Rocha;Alain Viari;Eric Coissac

  • Affiliations:
  • Atelier de Bioinformatique, Université Pierre et Marie Curie-Paris 6 12, rue Cuvier, 75005 Paris, France;INRIA-Rhône Alpes projet HELIX, 655, avenue de l'Europe, Montbonnot 38334 Saint Ismier Cedex, France;Atelier de Bioinformatique, Université Pierre et Marie Curie-Paris 6 12, rue Cuvier, 75005 Paris, France;INRIA-Rhône Alpes projet HELIX, 655, avenue de l'Europe, Montbonnot 38334 Saint Ismier Cedex, France;INRIA-Rhône Alpes projet HELIX, 655, avenue de l'Europe, Montbonnot 38334 Saint Ismier Cedex, France

  • Venue:
  • Bioinformatics
  • Year:
  • 2007

Quantified Score

Hi-index 3.84

Visualization

Abstract

Summary: 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. Availability: http://wwwabi.snv.jussieu.fr/public/RepSeek/ Contact: achaz@abi.snv.jussieu.fr http://www.repetmasker.org