mreps: a program for exhaustive search for tandem repeats in DNA sequences
Identifieur interne : 005721 ( Hal/Checkpoint ); précédent : 005720; suivant : 005722mreps: a program for exhaustive search for tandem repeats in DNA sequences
Auteurs : Ghizlane Bana [France] ; Roman Kolpakov ; Mathieu Giraud [France] ; Ralph Rabbat ; Gregory Kucherov [France]Source :
Descripteurs français
- mix :
Abstract
Poster abstract -- Introduction ==The availability of complete genome sequences from many species allows to apply new approaches to characterizing particular genetic patterns. Thanks to bioinformatic tools, the whole genome sequences can be used to study the biology of pathogenic bacteria or genetic human diseases. Tandem repeats are contiguously repeated copies of the same nucleotide pattern. The increasing variety of such repeats that have been found through genome projects reveals that repeated DNA is by no means "junk DNA" but clearly involved in regulating gene expression. Minisatellites, a class of tandem repeats, have been shown to cause diseases by influencing gene expression, modifying coding sequences within genes or generating fragile sites. This is thought to happen in the case of triplet repeat diseases, such as Huntington's disease, which are caused by a bigger number of pattern copies in repeats located within specific genes. Many prokaryotic genomes contain various types of repeated DNA occurring in genes, in intergenic sequences, or in transposable elements. Repeats, such as long repeats, are representative of important evolutionary mechanisms that allow bacteria to quickly adapt to environmental changes. Indeed, many pathogens have developed the ability to alter surface-exposed molecules, most often in response to selective pressure associated with the host immune system. Thus, bacteria present very diverse evolutionary strategies linked to pathogenesis. One of these genetic mechanisms involves a change in the number of repeated patterns, which causes phenotype variation. The polymorphic character of repeats make them useful as DNA markers for mapping genomes that is an important approach for linkage analysis, which can be used to search for genes involved in a wide range of disorders. This shows the relative precision with which genome sequences can be used to investigate genetic diseases. Results ======= mreps is a computer program for exhaustively characterizing all tandem repeats in a given DNA sequence. The distribution, some documentation, references, and other related information are available at http://www.loria.fr/~kucherov/SOFTWARE/mreps/. mreps implements combinatorial algorithms: it finds all repetitions which verify the user specification and does not refer to any statistical model or an heuristics. As a consequence, mreps does not associate any score to a repetition found. All repetitions which verify the user specification are considered a priori "equally good". mreps lets judge which repetitions are interesting :it finds them all and than the user cann sort them to any appropriate criterium. To simplify this job, mreps can output the result in xml format sa that they can be easily processed by other tools. mreps finds exact and approximate repetitions depending on the error parameter specified by the user. The current version of mreps treats only substitution errors and does not treat indels. Example ======= Applying mreps to whole genomes can readily reveal interesting repeats. As an example, we applied mreps to Neisseria meningitidis MC58 organism, which is a causative agent of meningitidis and septicaemia. The size of its genome is 2.24 Mband mreps revealed an exact tandem repeat of 32 Kb pattern, located in a coding region. An exact biological meaning of this repeat is still inknown. Here is the corresponding mreps output. Processing sequence 'gb|AE002098|AE002098 Neisseria meningitidis serogroup B strain MC58 complete gen' * Processing window [1 : 2272351] * from -> to: size "per." [exp.] repetition --- 1135353 -> 1199546 : 64194 "32036" [2.00] --- In practice, mreps is able to process genome sequences ofsize up to 30 Mb and to detect repetitions of unbounded pattern size. On a regular 400 MHz PC run under Linux, the program replies instantaneously on sequences of up to 1 Mb. A typicalrun takes about 1 second on a 2 Mb sequence, 30 seconds on a 8 Mb sequence, and 1.5 minutes on genomes reaching 30 Mb.
Url:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Hal:inria-00100869Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">mreps: a program for exhaustive search for tandem repeats in DNA sequences</title>
<author><name sortKey="Bana, Ghizlane" sort="Bana, Ghizlane" uniqKey="Bana G" first="Ghizlane" last="Bana">Ghizlane Bana</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2345" status="OLD"><idno type="RNSR">200221405M</idno>
<orgName>Applying discrete algorithms to genomics</orgName>
<orgName type="acronym">ADAGE</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/adage</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Kolpakov, Roman" sort="Kolpakov, Roman" uniqKey="Kolpakov R" first="Roman" last="Kolpakov">Roman Kolpakov</name>
</author>
<author><name sortKey="Giraud, Mathieu" sort="Giraud, Mathieu" uniqKey="Giraud M" first="Mathieu" last="Giraud">Mathieu Giraud</name>
<affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-6818" status="VALID"><idno type="IdRef">149154992</idno>
<orgName>École normale supérieure - Lyon</orgName>
<orgName type="acronym">ENS Lyon</orgName>
<desc><address><addrLine>15 parvis René Descartes - BP 7000 - 69342 Lyon Cedex 07</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.ens-lyon.eu/</ref>
</desc>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Rabbat, Ralph" sort="Rabbat, Ralph" uniqKey="Rabbat R" first="Ralph" last="Rabbat">Ralph Rabbat</name>
</author>
<author><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2345" status="OLD"><idno type="RNSR">200221405M</idno>
<orgName>Applying discrete algorithms to genomics</orgName>
<orgName type="acronym">ADAGE</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/adage</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00100869</idno>
<idno type="halId">inria-00100869</idno>
<idno type="halUri">https://hal.inria.fr/inria-00100869</idno>
<idno type="url">https://hal.inria.fr/inria-00100869</idno>
<date when="2002-04">2002-04</date>
<idno type="wicri:Area/Hal/Corpus">005459</idno>
<idno type="wicri:Area/Hal/Curation">005459</idno>
<idno type="wicri:Area/Hal/Checkpoint">005721</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">005721</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">mreps: a program for exhaustive search for tandem repeats in DNA sequences</title>
<author><name sortKey="Bana, Ghizlane" sort="Bana, Ghizlane" uniqKey="Bana G" first="Ghizlane" last="Bana">Ghizlane Bana</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2345" status="OLD"><idno type="RNSR">200221405M</idno>
<orgName>Applying discrete algorithms to genomics</orgName>
<orgName type="acronym">ADAGE</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/adage</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Kolpakov, Roman" sort="Kolpakov, Roman" uniqKey="Kolpakov R" first="Roman" last="Kolpakov">Roman Kolpakov</name>
</author>
<author><name sortKey="Giraud, Mathieu" sort="Giraud, Mathieu" uniqKey="Giraud M" first="Mathieu" last="Giraud">Mathieu Giraud</name>
<affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-6818" status="VALID"><idno type="IdRef">149154992</idno>
<orgName>École normale supérieure - Lyon</orgName>
<orgName type="acronym">ENS Lyon</orgName>
<desc><address><addrLine>15 parvis René Descartes - BP 7000 - 69342 Lyon Cedex 07</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.ens-lyon.eu/</ref>
</desc>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Rabbat, Ralph" sort="Rabbat, Ralph" uniqKey="Rabbat R" first="Ralph" last="Rabbat">Ralph Rabbat</name>
</author>
<author><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2345" status="OLD"><idno type="RNSR">200221405M</idno>
<orgName>Applying discrete algorithms to genomics</orgName>
<orgName type="acronym">ADAGE</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/adage</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="fr"><term>dna sequences</term>
<term>recherche de répétitions en tandem</term>
<term>satellites</term>
<term>searching tandem repeats</term>
<term>séquences d'adn</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Poster abstract -- Introduction ==The availability of complete genome sequences from many species allows to apply new approaches to characterizing particular genetic patterns. Thanks to bioinformatic tools, the whole genome sequences can be used to study the biology of pathogenic bacteria or genetic human diseases. Tandem repeats are contiguously repeated copies of the same nucleotide pattern. The increasing variety of such repeats that have been found through genome projects reveals that repeated DNA is by no means "junk DNA" but clearly involved in regulating gene expression. Minisatellites, a class of tandem repeats, have been shown to cause diseases by influencing gene expression, modifying coding sequences within genes or generating fragile sites. This is thought to happen in the case of triplet repeat diseases, such as Huntington's disease, which are caused by a bigger number of pattern copies in repeats located within specific genes. Many prokaryotic genomes contain various types of repeated DNA occurring in genes, in intergenic sequences, or in transposable elements. Repeats, such as long repeats, are representative of important evolutionary mechanisms that allow bacteria to quickly adapt to environmental changes. Indeed, many pathogens have developed the ability to alter surface-exposed molecules, most often in response to selective pressure associated with the host immune system. Thus, bacteria present very diverse evolutionary strategies linked to pathogenesis. One of these genetic mechanisms involves a change in the number of repeated patterns, which causes phenotype variation. The polymorphic character of repeats make them useful as DNA markers for mapping genomes that is an important approach for linkage analysis, which can be used to search for genes involved in a wide range of disorders. This shows the relative precision with which genome sequences can be used to investigate genetic diseases. Results ======= mreps is a computer program for exhaustively characterizing all tandem repeats in a given DNA sequence. The distribution, some documentation, references, and other related information are available at http://www.loria.fr/~kucherov/SOFTWARE/mreps/. mreps implements combinatorial algorithms: it finds all repetitions which verify the user specification and does not refer to any statistical model or an heuristics. As a consequence, mreps does not associate any score to a repetition found. All repetitions which verify the user specification are considered a priori "equally good". mreps lets judge which repetitions are interesting :it finds them all and than the user cann sort them to any appropriate criterium. To simplify this job, mreps can output the result in xml format sa that they can be easily processed by other tools. mreps finds exact and approximate repetitions depending on the error parameter specified by the user. The current version of mreps treats only substitution errors and does not treat indels. Example ======= Applying mreps to whole genomes can readily reveal interesting repeats. As an example, we applied mreps to Neisseria meningitidis MC58 organism, which is a causative agent of meningitidis and septicaemia. The size of its genome is 2.24 Mband mreps revealed an exact tandem repeat of 32 Kb pattern, located in a coding region. An exact biological meaning of this repeat is still inknown. Here is the corresponding mreps output. Processing sequence 'gb|AE002098|AE002098 Neisseria meningitidis serogroup B strain MC58 complete gen' * Processing window [1 : 2272351] * from -> to: size "per." [exp.] repetition --- 1135353 -> 1199546 : 64194 "32036" [2.00] --- In practice, mreps is able to process genome sequences ofsize up to 30 Mb and to detect repetitions of unbounded pattern size. On a regular 400 MHz PC run under Linux, the program replies instantaneously on sequences of up to 1 Mb. A typicalrun takes about 1 second on a 2 Mb sequence, 30 seconds on a 8 Mb sequence, and 1.5 minutes on genomes reaching 30 Mb.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">mreps: a program for exhaustive search for tandem repeats in DNA sequences</title>
<author role="aut"><persName><forename type="first">Ghizlane</forename>
<surname>Bana</surname>
</persName>
<email></email>
<idno type="halauthor">130812</idno>
<orgName ref="#struct-300009"></orgName>
<affiliation ref="#struct-2345"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Roman</forename>
<surname>Kolpakov</surname>
</persName>
<email></email>
<idno type="halauthor">130003</idno>
<orgName ref="#struct-364566"></orgName>
</author>
<author role="aut"><persName><forename type="first">Mathieu</forename>
<surname>Giraud</surname>
</persName>
<email>mathieu.giraud@lifl.fr</email>
<idno type="idhal">magiraud</idno>
<idno type="halauthor">132079</idno>
<idno type="ORCID">http://orcid.org/0000-0003-2741-8047</idno>
<orgName ref="#struct-6818"></orgName>
<affiliation ref="#struct-6818"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Ralph</forename>
<surname>Rabbat</surname>
</persName>
<email></email>
<idno type="halauthor">132080</idno>
<orgName ref="#struct-365209"></orgName>
</author>
<author role="aut"><persName><forename type="first">Gregory</forename>
<surname>Kucherov</surname>
</persName>
<email>kucherov@loria.fr</email>
<idno type="halauthor">129851</idno>
<orgName ref="#struct-300009"></orgName>
<affiliation ref="#struct-2345"></affiliation>
</author>
<editor role="depositor"><persName><forename>Publications</forename>
<surname>Loria</surname>
</persName>
<email>publications@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2006-09-26 14:52:33</date>
<date type="whenModified">2016-05-19 01:09:08</date>
<date type="whenReleased">2006-09-28 15:22:47</date>
<date type="whenProduced">2002-04</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="108626"><persName><forename>Publications</forename>
<surname>Loria</surname>
</persName>
<email>publications@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00100869</idno>
<idno type="halUri">https://hal.inria.fr/inria-00100869</idno>
<idno type="halBibtex">bana:inria-00100869</idno>
<idno type="halRefHtml">Sixth Annual International Conference on Research in Computational Biology - RECOMB 2002, Apr 2002, Washington, DC, US, 2002</idno>
<idno type="halRef">Sixth Annual International Conference on Research in Computational Biology - RECOMB 2002, Apr 2002, Washington, DC, US, 2002</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="PRUNEL">Ecole Normale Supérieure de Lyon</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="ENS-LYON">École Normale Supérieure de Lyon</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
</seriesStmt>
<notesStmt><note type="commentary">Poster. Colloque avec actes et comité de lecture. internationale.</note>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">mreps: a program for exhaustive search for tandem repeats in DNA sequences</title>
<author role="aut"><persName><forename type="first">Ghizlane</forename>
<surname>Bana</surname>
</persName>
<idno type="halAuthorId">130812</idno>
<orgName ref="#struct-300009"></orgName>
<affiliation ref="#struct-2345"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Roman</forename>
<surname>Kolpakov</surname>
</persName>
<idno type="halAuthorId">130003</idno>
<orgName ref="#struct-364566"></orgName>
</author>
<author role="aut"><persName><forename type="first">Mathieu</forename>
<surname>Giraud</surname>
</persName>
<email>mathieu.giraud@lifl.fr</email>
<idno type="idHal">magiraud</idno>
<idno type="halAuthorId">132079</idno>
<idno type="ORCID">http://orcid.org/0000-0003-2741-8047</idno>
<orgName ref="#struct-6818"></orgName>
<affiliation ref="#struct-6818"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Ralph</forename>
<surname>Rabbat</surname>
</persName>
<idno type="halAuthorId">132080</idno>
<orgName ref="#struct-365209"></orgName>
</author>
<author role="aut"><persName><forename type="first">Gregory</forename>
<surname>Kucherov</surname>
</persName>
<email>kucherov@loria.fr</email>
<idno type="halAuthorId">129851</idno>
<orgName ref="#struct-300009"></orgName>
<affiliation ref="#struct-2345"></affiliation>
</author>
</analytic>
<monogr><idno type="localRef">A02-R-295 || bana02a</idno>
<meeting><title>Sixth Annual International Conference on Research in Computational Biology - RECOMB 2002</title>
<date type="start">2002-04</date>
<settlement>Washington, DC, US</settlement>
</meeting>
<imprint><date type="datePub">2002-04</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="fr">dna sequences</term>
<term xml:lang="fr">searching tandem repeats</term>
<term xml:lang="fr">satellites</term>
<term xml:lang="fr">séquences d'adn</term>
<term xml:lang="fr">recherche de répétitions en tandem</term>
</keywords>
<classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Poster abstract -- Introduction ==The availability of complete genome sequences from many species allows to apply new approaches to characterizing particular genetic patterns. Thanks to bioinformatic tools, the whole genome sequences can be used to study the biology of pathogenic bacteria or genetic human diseases. Tandem repeats are contiguously repeated copies of the same nucleotide pattern. The increasing variety of such repeats that have been found through genome projects reveals that repeated DNA is by no means "junk DNA" but clearly involved in regulating gene expression. Minisatellites, a class of tandem repeats, have been shown to cause diseases by influencing gene expression, modifying coding sequences within genes or generating fragile sites. This is thought to happen in the case of triplet repeat diseases, such as Huntington's disease, which are caused by a bigger number of pattern copies in repeats located within specific genes. Many prokaryotic genomes contain various types of repeated DNA occurring in genes, in intergenic sequences, or in transposable elements. Repeats, such as long repeats, are representative of important evolutionary mechanisms that allow bacteria to quickly adapt to environmental changes. Indeed, many pathogens have developed the ability to alter surface-exposed molecules, most often in response to selective pressure associated with the host immune system. Thus, bacteria present very diverse evolutionary strategies linked to pathogenesis. One of these genetic mechanisms involves a change in the number of repeated patterns, which causes phenotype variation. The polymorphic character of repeats make them useful as DNA markers for mapping genomes that is an important approach for linkage analysis, which can be used to search for genes involved in a wide range of disorders. This shows the relative precision with which genome sequences can be used to investigate genetic diseases. Results ======= mreps is a computer program for exhaustively characterizing all tandem repeats in a given DNA sequence. The distribution, some documentation, references, and other related information are available at http://www.loria.fr/~kucherov/SOFTWARE/mreps/. mreps implements combinatorial algorithms: it finds all repetitions which verify the user specification and does not refer to any statistical model or an heuristics. As a consequence, mreps does not associate any score to a repetition found. All repetitions which verify the user specification are considered a priori "equally good". mreps lets judge which repetitions are interesting :it finds them all and than the user cann sort them to any appropriate criterium. To simplify this job, mreps can output the result in xml format sa that they can be easily processed by other tools. mreps finds exact and approximate repetitions depending on the error parameter specified by the user. The current version of mreps treats only substitution errors and does not treat indels. Example ======= Applying mreps to whole genomes can readily reveal interesting repeats. As an example, we applied mreps to Neisseria meningitidis MC58 organism, which is a causative agent of meningitidis and septicaemia. The size of its genome is 2.24 Mband mreps revealed an exact tandem repeat of 32 Kb pattern, located in a coding region. An exact biological meaning of this repeat is still inknown. Here is the corresponding mreps output. Processing sequence 'gb|AE002098|AE002098 Neisseria meningitidis serogroup B strain MC58 complete gen' * Processing window [1 : 2272351] * from -> to: size "per." [exp.] repetition --- 1135353 -> 1199546 : 64194 "32036" [2.00] --- In practice, mreps is able to process genome sequences ofsize up to 30 Mb and to detect repetitions of unbounded pattern size. On a regular 400 MHz PC run under Linux, the program replies instantaneously on sequences of up to 1 Mb. A typicalrun takes about 1 second on a 2 Mb sequence, 30 seconds on a 8 Mb sequence, and 1.5 minutes on genomes reaching 30 Mb.</abstract>
</profileDesc>
</hal>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005721 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 005721 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Hal |étape= Checkpoint |type= RBID |clé= Hal:inria-00100869 |texte= mreps: a program for exhaustive search for tandem repeats in DNA sequences }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |