Skip Navigation


Bioinformatics Advance Access originally published online on October 11, 2006
Bioinformatics 2007 23(1):119-121; doi:10.1093/bioinformatics/btl519
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrowOA All Versions of this Article:
23/1/119    most recent
btl519v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Google Scholar
Right arrow Articles by Achaz, G.
Right arrow Articles by Coissac, E.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Achaz, G.
Right arrow Articles by Coissac, E.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2006 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/ by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

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

Guillaume Achaz 1,2,*, Frédéric Boyer 3, Eduardo P. C. Rocha 1,4, Alain Viari 3 and Eric Coissac 3,5

1 Atelier de Bioinformatique, Université Pierre et Marie Curie-Paris 6 12, rue Cuvier, 75005 Paris, France
2 UMR 7138 Systématique, Adaptation, Evolution, Université Pierre et Marie Curie-Paris 6, Bâtiment A 7, quai St Bernard, 75252 Paris Cedex 05, France
3 INRIA-Rhône Alpes projet HELIX, 655, avenue de l'Europe, Montbonnot 38334 Saint Ismier Cedex, France
4 Unité Génétique des Génomes Bactériens, Institut Pasteur 28, rue du Dr Roux, 75724 Paris Cedex 15, France
5 UMR 5163 LAPM, Université Joseph Fourier, BP 53 38041 Grenoble Cedex 9, France

*To whom correspondence should be addressed.

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{at}abi.snv.jussieu.fr http://www.repetmasker.org

Received on July 20, 2006; revised on September 12, 2006; accepted on October 6, 2006

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
A.-L. Abraham, E. P. C. Rocha, and J. Pothier
Swelfe: a detector of internal repeats in sequences and structures
Bioinformatics, July 1, 2008; 24(13): 1536 - 1537.
[Abstract] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.