Présentation
While there were efficient methods for detecting strict repeats or detecting already characterised repeats, there was no software available for detecting approximate repeats in large DNA sequences allowing for weighted substitutions and indels in a coherent statistical framework. We have therefore implemented a two–steps method (seed detection followed by their extension) to detect approximate DNA 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.
Authors: Guillaume Achaz (UPMC), Frédéric Boyer (UJF), Alain Viari (INRIA), Eduardo Rocha, Eric Coissac (U Joseph Fourier).
Availability: http://wwwabi.snv.jussieu.fr/public/RepSeek/