ModuleOrganizer: detecting modules in families of transposable elements

Background Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome sequence. They have been subject to many mutations and other genomic events (copies, deletions, captures) during transposition....

Full description

Saved in:
Bibliographic Details
Published inBMC bioinformatics Vol. 11; no. 1; p. 474
Main Authors Tempel, Sebastien, Rousseau, Christine, Tahi, Fariza, Nicolas, Jacques
Format Journal Article
LanguageEnglish
Published London BioMed Central 22.09.2010
BioMed Central Ltd
Springer Nature B.V
BMC
Subjects
Online AccessGet full text
ISSN1471-2105
1471-2105
DOI10.1186/1471-2105-11-474

Cover

Abstract Background Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome sequence. They have been subject to many mutations and other genomic events (copies, deletions, captures) during transposition. The identification of these transformations remains a difficult issue. The study of families of transposable elements is generally founded on a multiple alignment of their sequences, a critical step that is adapted to transposons containing mostly localized nucleotide mutations. Many transposons that have lost their protein-coding capacity have undergone more complex rearrangements, needing the development of more complex methods in order to characterize the architecture of sequence variations. Results In this study, we introduce the concept of a transposable element module , a flexible motif present in at least two sequences of a family of transposable elements and built on a succession of maximal repeats. The paper proposes an assembly method working on a set of exact maximal repeats of a set of sequences to create such modules. It results in a graphical view of sequences segmented into modules, a representation that allows a flexible analysis of the transformations that have occurred between them. We have chosen as a demonstration data set in depth analysis of the transposable element Foldback in Drosophila melanogaster . Comparison with multiple alignment methods shows that our method is more sensitive for highly variable sequences. The study of this family and the two other families AtREP21 and SIDER2 reveals new copies of very different sizes and various combinations of modules which show the potential of our method. Conclusions ModuleOrganizer is available on the Genouest bioinformatics center at http://moduleorganizer.genouest.org
AbstractList Background Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome sequence. They have been subject to many mutations and other genomic events (copies, deletions, captures) during transposition. The identification of these transformations remains a difficult issue. The study of families of transposable elements is generally founded on a multiple alignment of their sequences, a critical step that is adapted to transposons containing mostly localized nucleotide mutations. Many transposons that have lost their protein-coding capacity have undergone more complex rearrangements, needing the development of more complex methods in order to characterize the architecture of sequence variations. Results In this study, we introduce the concept of a transposable element module, a flexible motif present in at least two sequences of a family of transposable elements and built on a succession of maximal repeats. The paper proposes an assembly method working on a set of exact maximal repeats of a set of sequences to create such modules. It results in a graphical view of sequences segmented into modules, a representation that allows a flexible analysis of the transformations that have occurred between them. We have chosen as a demonstration data set in depth analysis of the transposable element Foldback in Drosophila melanogaster. Comparison with multiple alignment methods shows that our method is more sensitive for highly variable sequences. The study of this family and the two other families AtREP21 and SIDER2 reveals new copies of very different sizes and various combinations of modules which show the potential of our method. Conclusions ModuleOrganizer is available on the Genouest bioinformatics center at
BACKGROUND: Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome sequence. They have been subject to many mutations and other genomic events (copies, deletions, captures) during transposition. The identification of these transformations remains a difficult issue. The study of families of transposable elements is generally founded on a multiple alignment of their sequences, a critical step that is adapted to transposons containing mostly localized nucleotide mutations. Many transposons that have lost their protein-coding capacity have undergone more complex rearrangements, needing the development of more complex methods in order to characterize the architecture of sequence variations. RESULTS: In this study, we introduce the concept of a transposable element module, a flexible motif present in at least two sequences of a family of transposable elements and built on a succession of maximal repeats. The paper proposes an assembly method working on a set of exact maximal repeats of a set of sequences to create such modules. It results in a graphical view of sequences segmented into modules, a representation that allows a flexible analysis of the transformations that have occurred between them. We have chosen as a demonstration data set in depth analysis of the transposable element Foldback in Drosophila melanogaster. Comparison with multiple alignment methods shows that our method is more sensitive for highly variable sequences. The study of this family and the two other families AtREP21 and SIDER2 reveals new copies of very different sizes and various combinations of modules which show the potential of our method. CONCLUSIONS: ModuleOrganizer is available on the Genouest bioinformatics center at moduleorganizer.genouest.org.
Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome sequence. They have been subject to many mutations and other genomic events (copies, deletions, captures) during transposition. The identification of these transformations remains a difficult issue. The study of families of transposable elements is generally founded on a multiple alignment of their sequences, a critical step that is adapted to transposons containing mostly localized nucleotide mutations. Many transposons that have lost their protein-coding capacity have undergone more complex rearrangements, needing the development of more complex methods in order to characterize the architecture of sequence variations. In this study, we introduce the concept of a transposable element module, a flexible motif present in at least two sequences of a family of transposable elements and built on a succession of maximal repeats. The paper proposes an assembly method working on a set of exact maximal repeats of a set of sequences to create such modules. It results in a graphical view of sequences segmented into modules, a representation that allows a flexible analysis of the transformations that have occurred between them. We have chosen as a demonstration data set in depth analysis of the transposable element Foldback in Drosophila melanogaster. Comparison with multiple alignment methods shows that our method is more sensitive for highly variable sequences. The study of this family and the two other families AtREP21 and SIDER2 reveals new copies of very different sizes and various combinations of modules which show the potential of our method. ModuleOrganizer is available on the Genouest bioinformatics center at http://moduleorganizer.genouest.org.
Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome sequence. They have been subject to many mutations and other genomic events (copies, deletions, captures) during transposition. The identification of these transformations remains a difficult issue. The study of families of transposable elements is generally founded on a multiple alignment of their sequences, a critical step that is adapted to transposons containing mostly localized nucleotide mutations. Many transposons that have lost their protein-coding capacity have undergone more complex rearrangements, needing the development of more complex methods in order to characterize the architecture of sequence variations. In this study, we introduce the concept of a transposable element module, a flexible motif present in at least two sequences of a family of transposable elements and built on a succession of maximal repeats. The paper proposes an assembly method working on a set of exact maximal repeats of a set of sequences to create such modules. It results in a graphical view of sequences segmented into modules, a representation that allows a flexible analysis of the transformations that have occurred between them. We have chosen as a demonstration data set in depth analysis of the transposable element Foldback in Drosophila melanogaster. Comparison with multiple alignment methods shows that our method is more sensitive for highly variable sequences. The study of this family and the two other families AtREP21 and SIDER2 reveals new copies of very different sizes and various combinations of modules which show the potential of our method. ModuleOrganizer is available on the Genouest bioinformatics center at http://moduleorganizer.genouest.org
Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome sequence. They have been subject to many mutations and other genomic events (copies, deletions, captures) during transposition. The identification of these transformations remains a difficult issue. The study of families of transposable elements is generally founded on a multiple alignment of their sequences, a critical step that is adapted to transposons containing mostly localized nucleotide mutations. Many transposons that have lost their protein-coding capacity have undergone more complex rearrangements, needing the development of more complex methods in order to characterize the architecture of sequence variations.BACKGROUNDMost known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome sequence. They have been subject to many mutations and other genomic events (copies, deletions, captures) during transposition. The identification of these transformations remains a difficult issue. The study of families of transposable elements is generally founded on a multiple alignment of their sequences, a critical step that is adapted to transposons containing mostly localized nucleotide mutations. Many transposons that have lost their protein-coding capacity have undergone more complex rearrangements, needing the development of more complex methods in order to characterize the architecture of sequence variations.In this study, we introduce the concept of a transposable element module, a flexible motif present in at least two sequences of a family of transposable elements and built on a succession of maximal repeats. The paper proposes an assembly method working on a set of exact maximal repeats of a set of sequences to create such modules. It results in a graphical view of sequences segmented into modules, a representation that allows a flexible analysis of the transformations that have occurred between them. We have chosen as a demonstration data set in depth analysis of the transposable element Foldback in Drosophila melanogaster. Comparison with multiple alignment methods shows that our method is more sensitive for highly variable sequences. The study of this family and the two other families AtREP21 and SIDER2 reveals new copies of very different sizes and various combinations of modules which show the potential of our method.RESULTSIn this study, we introduce the concept of a transposable element module, a flexible motif present in at least two sequences of a family of transposable elements and built on a succession of maximal repeats. The paper proposes an assembly method working on a set of exact maximal repeats of a set of sequences to create such modules. It results in a graphical view of sequences segmented into modules, a representation that allows a flexible analysis of the transformations that have occurred between them. We have chosen as a demonstration data set in depth analysis of the transposable element Foldback in Drosophila melanogaster. Comparison with multiple alignment methods shows that our method is more sensitive for highly variable sequences. The study of this family and the two other families AtREP21 and SIDER2 reveals new copies of very different sizes and various combinations of modules which show the potential of our method.ModuleOrganizer is available on the Genouest bioinformatics center at http://moduleorganizer.genouest.org.CONCLUSIONSModuleOrganizer is available on the Genouest bioinformatics center at http://moduleorganizer.genouest.org.
Abstract Background: Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome sequence. They have been subject to many mutations and other genomic events (copies, deletions, captures) during transposition. The identification of these transformations remains a difficult issue. The study of families of transposable elements is generally founded on a multiple alignment of their sequences, a critical step that is adapted to transposons containing mostly localized nucleotide mutations. Many transposons that have lost their protein-coding capacity have undergone more complex rearrangements, needing the development of more complex methods in order to characterize the architecture of sequence variations. Results: In this study, we introduce the concept of a transposable element module , a flexible motif present in at least two sequences of a family of transposable elements and built on a succession of maximal repeats. The paper proposes an assembly method working on a set of exact maximal repeats of a set of sequences to create such modules. It results in a graphical view of sequences segmented into modules, a representation that allows a flexible analysis of the transformations that have occurred between them. We have chosen as a demonstration data set in depth analysis of the transposable element Foldback in Drosophila melanogaster . Comparison with multiple alignment methods shows that our method is more sensitive for highly variable sequences. The study of this family and the two other families AtREP21 and SIDER2 reveals new copies of very different sizes and various combinations of modules which show the potential of our method. Conclusions: ModuleOrganizer is available on the Genouest bioinformatics center at http://moduleorganizer.genouest.org
Background Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome sequence. They have been subject to many mutations and other genomic events (copies, deletions, captures) during transposition. The identification of these transformations remains a difficult issue. The study of families of transposable elements is generally founded on a multiple alignment of their sequences, a critical step that is adapted to transposons containing mostly localized nucleotide mutations. Many transposons that have lost their protein-coding capacity have undergone more complex rearrangements, needing the development of more complex methods in order to characterize the architecture of sequence variations. Results In this study, we introduce the concept of a transposable element module , a flexible motif present in at least two sequences of a family of transposable elements and built on a succession of maximal repeats. The paper proposes an assembly method working on a set of exact maximal repeats of a set of sequences to create such modules. It results in a graphical view of sequences segmented into modules, a representation that allows a flexible analysis of the transformations that have occurred between them. We have chosen as a demonstration data set in depth analysis of the transposable element Foldback in Drosophila melanogaster . Comparison with multiple alignment methods shows that our method is more sensitive for highly variable sequences. The study of this family and the two other families AtREP21 and SIDER2 reveals new copies of very different sizes and various combinations of modules which show the potential of our method. Conclusions ModuleOrganizer is available on the Genouest bioinformatics center at http://moduleorganizer.genouest.org
ArticleNumber 474
Audience Academic
Author Tempel, Sebastien
Nicolas, Jacques
Rousseau, Christine
Tahi, Fariza
AuthorAffiliation 2 INP-ENSAT, Avenue de l'agrobiopole 31326 Castanet tolosan, France
1 IBISC, Tour Evry 2, 523, place des terrasses del'agora, 91000 Evry, France
3 IRISA-INRIA, Campus de Beaulieu, bât 12, 35042 Rennes cedex, France
AuthorAffiliation_xml – name: 1 IBISC, Tour Evry 2, 523, place des terrasses del'agora, 91000 Evry, France
– name: 2 INP-ENSAT, Avenue de l'agrobiopole 31326 Castanet tolosan, France
– name: 3 IRISA-INRIA, Campus de Beaulieu, bât 12, 35042 Rennes cedex, France
Author_xml – sequence: 1
  givenname: Sebastien
  surname: Tempel
  fullname: Tempel, Sebastien
  organization: IBISC
– sequence: 2
  givenname: Christine
  surname: Rousseau
  fullname: Rousseau, Christine
  organization: INP-ENSAT
– sequence: 3
  givenname: Fariza
  surname: Tahi
  fullname: Tahi, Fariza
  organization: IBISC
– sequence: 4
  givenname: Jacques
  surname: Nicolas
  fullname: Nicolas, Jacques
  email: jacques.nicolas@irisa.fr
  organization: IRISA-INRIA
BackLink https://www.ncbi.nlm.nih.gov/pubmed/20860790$$D View this record in MEDLINE/PubMed
https://inria.hal.science/inria-00536742$$DView record in HAL
BookMark eNqNktuL1DAUxousuBd990mKPohI1yTTNokPwrDo7sDKgpfnkObSzZAmY9Kurn-96XQcdwZvtNA0-b6vPb9zjrMD553KsscQnEJI6lewxLBAEFQFhEWJy3vZ0Xbr4M76MDuOcQkAxARUD7JDBEgNMAVH2fl7LwerrkLLnfmuwutcql6J3rg279ZHMTcu17wz1qS113kfuIsrH3ljVa6s6pTr48PsvuY2qkeb50n2-d3bT2cXxeXV-eJsflmImtK-0HqGBEKaa9BQqCTUQACiMCKyqaGsgVCK4lLjupYy3YBiUlKQjpFoKKhmJ9liypWeL9kqmI6HW-a5YesNH1rGQ2-EVUwQqDESteANLAltuJCSEqQoAKUUZZ2y4JQ1uBW__cqt3QZCwEbAbCTIRoLplSXAyfNm8qyGplNSpNoDtzs_snvizDVr_Q1DtKpABVPAyynges92Mb9kxgXDGUh11rhEN6P6-eZzwX8ZVOxZZ6JQ1nKn_BAZrcqKJHrlP5W4wqn7GI-ZT_eUSz8El7rGKEhFg9ma87NJ1PKE0jjtUzVijGRzNCMEk8Q0qU5_o0qXVJ0RaVa1Sfs7hhc7hqTp1be-5UOMbPHxw672yV3UW1g_hzcJ6kkggo8xKM2E6Xlv_Eje2L81EewZ_6Pvm1mJSepaFX5B-6PnB5WZHWA
CitedBy_id crossref_primary_10_1111_tpj_14567
crossref_primary_10_1186_1759_8753_5_9
crossref_primary_10_1186_1759_8753_3_18
crossref_primary_10_1007_s10577_011_9230_7
crossref_primary_10_1093_nar_gks146
Cites_doi 10.1093/bioinformatics/bti1018
10.1089/106652700750050826
10.1093/oxfordjournals.molbev.a026351
10.1016/j.gde.2007.08.010
10.1016/j.tig.2007.08.004
10.1093/nar/25.17.3389
10.1093/nar/gkm279
10.1186/1471-2105-6-9
10.1159/000084979
10.1016/0959-437X(95)80016-X
10.1017/CBO9780511574931
10.1016/S0169-5347(99)01817-0
10.1093/molbev/msi064
10.1186/1471-2164-10-240
10.1093/bioinformatics/bti710
10.1093/nar/28.8.1808
10.1073/pnas.0702080104
10.1073/pnas.0601161103
10.1128/9781555817954
10.1146/annurev.genet.40.110405.090448
10.1126/science.1175688
10.1016/j.gene.2006.10.012
10.1007/BF01206331
10.1186/1748-7188-1-22
10.1016/j.jmb.2005.05.006
10.1016/j.plasmid.2008.09.008
10.1093/bioinformatics/btl337
10.1105/tpc.108.063206
10.1089/cmb.2005.12.1065
10.1111/j.1574-6968.1999.tb13575.x
10.1101/gr.88502
10.1080/01621459.1963.10500845
10.1093/genetics/156.4.1983
10.1007/978-3-540-70600-7_5
10.1186/1471-2105-8-21
10.1038/297201a0
10.1371/journal.pone.0005761
10.1073/pnas.0908008106
10.1534/genetics.104.035048
ContentType Journal Article
Copyright Tempel et al; licensee BioMed Central Ltd. 2010 This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
COPYRIGHT 2010 BioMed Central Ltd.
2010 Tempel et al; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Distributed under a Creative Commons Attribution 4.0 International License
Copyright ©2010 Tempel et al; licensee BioMed Central Ltd. 2010 Tempel et al; licensee BioMed Central Ltd.
Copyright_xml – notice: Tempel et al; licensee BioMed Central Ltd. 2010 This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
– notice: COPYRIGHT 2010 BioMed Central Ltd.
– notice: 2010 Tempel et al; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
– notice: Distributed under a Creative Commons Attribution 4.0 International License
– notice: Copyright ©2010 Tempel et al; licensee BioMed Central Ltd. 2010 Tempel et al; licensee BioMed Central Ltd.
DBID C6C
AAYXX
CITATION
CGR
CUY
CVF
ECM
EIF
NPM
ISR
3V.
7QO
7SC
7X7
7XB
88E
8AL
8AO
8FD
8FE
8FG
8FH
8FI
8FJ
8FK
ABUWG
AEUYN
AFKRA
ARAPS
AZQEC
BBNVY
BENPR
BGLVJ
BHPHI
CCPQU
DWQXO
FR3
FYUFA
GHDGH
GNUQQ
HCIFZ
JQ2
K7-
K9.
L7M
LK8
L~C
L~D
M0N
M0S
M1P
M7P
P5Z
P62
P64
PHGZM
PHGZT
PIMPY
PJZUB
PKEHL
PPXIY
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
7X8
1XC
5PM
ADTOC
UNPAY
DOA
DOI 10.1186/1471-2105-11-474
DatabaseName Springer Nature OA Free Journals
CrossRef
Medline
MEDLINE
MEDLINE (Ovid)
MEDLINE
MEDLINE
PubMed
Gale In Context: Science
ProQuest Central (Corporate)
Biotechnology Research Abstracts
Computer and Information Systems Abstracts
Health & Medical Collection
ProQuest Central (purchase pre-March 2016)
Medical Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Natural Science Journals
ProQuest Hospital Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest One Sustainability
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
Biological Science Collection
ProQuest Central
Technology Collection
Natural Science Collection
ProQuest One Community College
ProQuest Central
Engineering Research Database
Health Research Premium Collection
Health Research Premium Collection (Alumni)
ProQuest Central Student
SciTech Premium Collection (via ProQuest)
ProQuest Computer Science Collection
Computer Science Database
ProQuest Health & Medical Complete (Alumni)
Advanced Technologies Database with Aerospace
Biological Sciences
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
ProQuest Health & Medical Collection
Medical Database
Biological Science Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Biotechnology and BioEngineering Abstracts
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
ProQuest One Health & Nursing
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
MEDLINE - Academic
Hyper Article en Ligne (HAL)
PubMed Central (Full Participant titles)
Unpaywall for CDI: Periodical Content
Unpaywall
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
MEDLINE
Medline Complete
MEDLINE with Full Text
PubMed
MEDLINE (Ovid)
Publicly Available Content Database
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest Central China
ProQuest One Applied & Life Sciences
ProQuest One Sustainability
Health Research Premium Collection
Natural Science Collection
Health & Medical Research Collection
Biological Science Collection
ProQuest Central (New)
ProQuest Medical Library (Alumni)
Advanced Technologies & Aerospace Collection
ProQuest Biological Science Collection
ProQuest One Academic Eastern Edition
ProQuest Hospital Collection
ProQuest Technology Collection
Health Research Premium Collection (Alumni)
Biological Science Database
ProQuest Hospital Collection (Alumni)
Biotechnology and BioEngineering Abstracts
ProQuest Health & Medical Complete
ProQuest One Academic UKI Edition
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Health & Medical Complete (Alumni)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest One Health & Nursing
ProQuest Natural Science Collection
ProQuest Pharma Collection
ProQuest Central
ProQuest Health & Medical Research Collection
Biotechnology Research Abstracts
Health and Medicine Complete (Alumni Edition)
ProQuest Central Korea
Advanced Technologies Database with Aerospace
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest Medical Library
ProQuest Central (Alumni)
MEDLINE - Academic
DatabaseTitleList

MEDLINE


MEDLINE - Academic
Publicly Available Content Database


Engineering Research Database
Database_xml – sequence: 1
  dbid: C6C
  name: Springer Nature OA Free Journals
  url: http://www.springeropen.com/
  sourceTypes: Publisher
– sequence: 2
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 3
  dbid: NPM
  name: PubMed
  url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 4
  dbid: EIF
  name: MEDLINE
  url: https://proxy.k.utb.cz/login?url=https://www.webofscience.com/wos/medline/basic-search
  sourceTypes: Index Database
– sequence: 5
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
– sequence: 6
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Biology
Computer Science
EISSN 1471-2105
EndPage 474
ExternalDocumentID oai_doaj_org_article_c81f72c6cab1489bacdd982e9004dc46
10.1186/1471-2105-11-474
PMC2955051
oai:HAL:inria-00536742v1
2501705301
A238878148
20860790
10_1186_1471_2105_11_474
Genre Research Support, Non-U.S. Gov't
Journal Article
GeographicLocations France
GeographicLocations_xml – name: France
GroupedDBID ---
0R~
23N
2VQ
2WC
4.4
53G
5VS
6J9
7X7
88E
8AO
8FE
8FG
8FH
8FI
8FJ
AAFWJ
AAJSJ
AAKPC
AASML
ABDBF
ABUWG
ACGFO
ACGFS
ACIHN
ACIWK
ACPRK
ACUHS
ADBBV
ADMLS
ADRAZ
ADUKV
AEAQA
AENEX
AEUYN
AFKRA
AFPKN
AFRAH
AHBYD
AHMBA
AHSBF
AHYZX
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMTXH
AOIJS
ARAPS
AZQEC
BAPOH
BAWUL
BBNVY
BCNDV
BENPR
BFQNJ
BGLVJ
BHPHI
BMC
BPHCQ
BVXVI
C1A
C6C
CCPQU
CS3
DIK
DU5
DWQXO
E3Z
EAD
EAP
EAS
EBD
EBLON
EBS
EJD
EMB
EMK
EMOBN
ESX
F5P
FYUFA
GNUQQ
GROUPED_DOAJ
GX1
H13
HCIFZ
HMCUK
HYE
IAO
ICD
IHR
INH
INR
IPNFZ
ISR
ITC
K6V
K7-
KQ8
LK8
M1P
M48
M7P
MK~
ML0
M~E
O5R
O5S
OK1
OVT
P2P
P62
PGMZT
PHGZM
PHGZT
PIMPY
PJZUB
PPXIY
PQGLB
PQQKQ
PROAC
PSQYO
PUEGO
RBZ
RIG
RNS
ROL
RPM
RSV
SBL
SOJ
SV3
TR2
TUS
UKHRP
W2D
WOQ
WOW
XH6
XSB
AAYXX
CITATION
ALIPV
CGR
CUY
CVF
ECM
EIF
NPM
3V.
7QO
7SC
7XB
8AL
8FD
8FK
FR3
JQ2
K9.
L7M
L~C
L~D
M0N
P64
PKEHL
PQEST
PQUKI
PRINS
Q9U
7X8
123
1XC
5PM
ADTOC
AFFHD
UNPAY
ID FETCH-LOGICAL-c699t-ff32c22faf0b91ed1f0c08e728db61d60cee974f766dd6dd097849028d2cb9053
IEDL.DBID UNPAY
ISSN 1471-2105
IngestDate Fri Oct 03 12:50:36 EDT 2025
Wed Oct 29 12:16:10 EDT 2025
Tue Sep 30 15:30:24 EDT 2025
Tue Oct 14 20:32:25 EDT 2025
Mon Oct 06 18:02:58 EDT 2025
Thu Sep 04 18:30:17 EDT 2025
Mon Oct 06 18:36:37 EDT 2025
Mon Oct 20 22:18:42 EDT 2025
Mon Oct 20 16:27:32 EDT 2025
Thu Oct 16 15:05:46 EDT 2025
Mon Jul 21 06:05:28 EDT 2025
Wed Oct 01 04:15:18 EDT 2025
Thu Apr 24 23:00:21 EDT 2025
Sat Sep 06 07:27:15 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Transposable Element
Maximal Repeat
Edit Distance
Multiple Alignment
Autonomous Element
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
cc-by
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c699t-ff32c22faf0b91ed1f0c08e728db61d60cee974f766dd6dd097849028d2cb9053
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
PMCID: PMC2955051
ORCID 0000-0002-3975-5668
0000-0003-0747-0665
OpenAccessLink https://proxy.k.utb.cz/login?url=https://bmcbioinformatics.biomedcentral.com/counter/pdf/10.1186/1471-2105-11-474
PMID 20860790
PQID 901860305
PQPubID 44065
ParticipantIDs doaj_primary_oai_doaj_org_article_c81f72c6cab1489bacdd982e9004dc46
unpaywall_primary_10_1186_1471_2105_11_474
pubmedcentral_primary_oai_pubmedcentral_nih_gov_2955051
hal_primary_oai_HAL_inria_00536742v1
proquest_miscellaneous_954587284
proquest_miscellaneous_757178771
proquest_journals_901860305
gale_infotracmisc_A238878148
gale_infotracacademiconefile_A238878148
gale_incontextgauss_ISR_A238878148
pubmed_primary_20860790
crossref_citationtrail_10_1186_1471_2105_11_474
crossref_primary_10_1186_1471_2105_11_474
springer_journals_10_1186_1471_2105_11_474
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2010-09-22
PublicationDateYYYYMMDD 2010-09-22
PublicationDate_xml – month: 09
  year: 2010
  text: 2010-09-22
  day: 22
PublicationDecade 2010
PublicationPlace London
PublicationPlace_xml – name: London
– name: England
PublicationTitle BMC bioinformatics
PublicationTitleAbbrev BMC Bioinformatics
PublicationTitleAlternate BMC Bioinformatics
PublicationYear 2010
Publisher BioMed Central
BioMed Central Ltd
Springer Nature B.V
BMC
Publisher_xml – name: BioMed Central
– name: BioMed Central Ltd
– name: Springer Nature B.V
– name: BMC
References J Nicolas (3931_CR35) 2005; 21
AJ Windsor (3931_CR28) 2000; 156
L Marsan (3931_CR30) 2000; 7
Y Zhang (3931_CR42) 2006; 1
KH Choi (3931_CR20) 2009; 19
C Feschotte (3931_CR5) 2007; 41
G Yang (3931_CR26) 2009; 325
MT Romanish (3931_CR3) 2009; 4
TA Tatusova (3931_CR45) 1999; 174
AL Price (3931_CR12) 2005
G Yang (3931_CR25) 2007; 104
H Quesneville (3931_CR6) 2005; 22
JM Thomas (3931_CR44) 2007; 8
LM Almeida (3931_CR7) 2007; 390
AR Parks (3931_CR21) 2009; 61
Z Bao (3931_CR37) 2002; 12
SF Altschul (3931_CR31) 1997; 25
L Yang (3931_CR24) 2009; 106
S Tempel (3931_CR13) 2006; 22
JH Ward (3931_CR34) 1963; 58
C Feschotte (3931_CR9) 2000; 17
P Bieganski (3931_CR18) 1994
DA Nix (3931_CR11) 2005; 6
K Hanada (3931_CR23) 2009; 21
M Smith (3931_CR15) 2009; 10
V Kapitonov (3931_CR22) 2007; 23
HK Dooner (3931_CR29) 2007; 17
E Ukkonen (3931_CR17) 1995; 14
N Pisanti (3931_CR39) 2006
Z Ivics (3931_CR32) 2004; 6
Y Bigot (3931_CR33) 2005; 351
MG Kidwell (3931_CR1) 2001; 15
D Gusfield (3931_CR19) 1997
NL Craig (3931_CR2) 2002
Jv Helden (3931_CR38) 2000; 28
M Brudno (3931_CR10) 2007; 35
M Halachev (3931_CR43) 2008
SR Wessler (3931_CR8) 1995; 5
J Jurka (3931_CR16) 2005; 110
G Mehldau (3931_CR40) 1993; 9
R Cordaux (3931_CR4) 2006; 103
3931_CR36
M Morgante (3931_CR41) 2005; 12
SS Potter (3931_CR14) 1982; 297
F Casals (3931_CR27) 2005; 169
10779533 - Mol Biol Evol. 2000 May;17(5):730-7
11102389 - Genetics. 2000 Dec;156(4):1983-95
19463167 - BMC Genomics. 2009;10:240
16672366 - Proc Natl Acad Sci U S A. 2006 May 23;103(21):8101-6
17488840 - Nucleic Acids Res. 2007 Jul;35(Web Server issue):W669-74
15961478 - Bioinformatics. 2005 Jun;21 Suppl 1:i351-8
17244370 - BMC Bioinformatics. 2007;8:21
8745082 - Curr Opin Genet Dev. 1995 Dec;5(6):814-21
10675923 - Trends Ecol Evol. 2000 Mar;15(3):95-99
16809391 - Bioinformatics. 2006 Aug 15;22(16):1948-54
19926865 - Proc Natl Acad Sci U S A. 2009 Nov 24;106(47):19922-7
17157447 - Gene. 2007 Apr 1;390(1-2):180-9
16223791 - Bioinformatics. 2005 Dec 15;21(24):4408-10
17578919 - Proc Natl Acad Sci U S A. 2007 Jun 26;104(26):10962-7
15655071 - BMC Bioinformatics. 2005;6:9
18076328 - Annu Rev Genet. 2007;41:331-68
19488400 - PLoS One. 2009;4(6):e5761
15695364 - Genetics. 2005 Apr;169(4):2047-59
16093699 - Cytogenet Genome Res. 2005;110(1-4):462-7
17118189 - Algorithms Mol Biol. 2006 Nov 21;1:22
9254694 - Nucleic Acids Res. 1997 Sep 1;25(17):3389-402
11108467 - J Comput Biol. 2000;7(3-4):345-62
19136648 - Plant Cell. 2009 Jan;21(1):25-38
14632258 - Curr Issues Mol Biol. 2004 Jan;6(1):43-55
8324630 - Comput Appl Biosci. 1993 Jun;9(3):299-314
19349746 - J Microbiol Biotechnol. 2009 Mar;19(3):217-28
19745152 - Science. 2009 Sep 11;325(5946):1391-4
17919898 - Curr Opin Genet Dev. 2007 Dec;17(6):486-92
10339815 - FEMS Microbiol Lett. 1999 May 15;174(2):247-50
18951916 - Plasmid. 2009 Jan;61(1):1-14
17850916 - Trends Genet. 2007 Oct;23(10):521-9
15574804 - Mol Biol Evol. 2005 Mar;22(3):741-6
6176872 - Nature. 1982 May 20;297(5863):201-4
15946679 - J Mol Biol. 2005 Aug 5;351(1):108-16
12176934 - Genome Res. 2002 Aug;12(8):1269-76
16241898 - J Comput Biol. 2005 Oct;12(8):1065-82
10734201 - Nucleic Acids Res. 2000 Apr 15;28(8):1808-18
References_xml – start-page: i351
  volume-title: Bioinformatics
  year: 2005
  ident: 3931_CR12
  doi: 10.1093/bioinformatics/bti1018
– volume: 7
  start-page: 345
  issue: 3-4
  year: 2000
  ident: 3931_CR30
  publication-title: Journal of Computational Biology
  doi: 10.1089/106652700750050826
– start-page: 757
  volume-title: LATIN, Lecture Notes in Computer Science
  year: 2006
  ident: 3931_CR39
– volume: 17
  start-page: 730
  year: 2000
  ident: 3931_CR9
  publication-title: Mol Biol Evol
  doi: 10.1093/oxfordjournals.molbev.a026351
– volume: 17
  start-page: 486
  year: 2007
  ident: 3931_CR29
  publication-title: Curr Opin Genet Dev
  doi: 10.1016/j.gde.2007.08.010
– volume: 23
  start-page: 521
  year: 2007
  ident: 3931_CR22
  publication-title: Trends Genet
  doi: 10.1016/j.tig.2007.08.004
– volume: 25
  start-page: 3389
  year: 1997
  ident: 3931_CR31
  publication-title: Nucleic Acids Res
  doi: 10.1093/nar/25.17.3389
– volume: 35
  start-page: W669
  year: 2007
  ident: 3931_CR10
  publication-title: Nucleic Acids Res
  doi: 10.1093/nar/gkm279
– volume: 6
  start-page: 9
  year: 2005
  ident: 3931_CR11
  publication-title: BMC Bioinformatics
  doi: 10.1186/1471-2105-6-9
– volume: 19
  start-page: 217
  year: 2009
  ident: 3931_CR20
  publication-title: J Microbiol Biotechnol
– volume: 9
  start-page: 299
  issue: 3
  year: 1993
  ident: 3931_CR40
  publication-title: Computer Applications in the Biosciences (Bioinformatics)
– volume: 110
  start-page: 462
  year: 2005
  ident: 3931_CR16
  publication-title: Cytogentic and Genome Research
  doi: 10.1159/000084979
– volume: 6
  start-page: 43
  year: 2004
  ident: 3931_CR32
  publication-title: Curr Issues Mol Biol
– volume: 5
  start-page: 814
  year: 1995
  ident: 3931_CR8
  publication-title: Genet Dev
  doi: 10.1016/0959-437X(95)80016-X
– volume-title: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
  year: 1997
  ident: 3931_CR19
  doi: 10.1017/CBO9780511574931
– volume: 15
  start-page: 95
  year: 2001
  ident: 3931_CR1
  publication-title: Trends Ecol Evol
  doi: 10.1016/S0169-5347(99)01817-0
– volume: 22
  start-page: 741
  year: 2005
  ident: 3931_CR6
  publication-title: Mol Biol Evol
  doi: 10.1093/molbev/msi064
– volume: 10
  start-page: 240
  year: 2009
  ident: 3931_CR15
  publication-title: BMC Genomics
  doi: 10.1186/1471-2164-10-240
– volume: 21
  start-page: 4408
  year: 2005
  ident: 3931_CR35
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/bti710
– volume: 28
  start-page: 1808
  issue: 8
  year: 2000
  ident: 3931_CR38
  publication-title: Nucl Acids Res
  doi: 10.1093/nar/28.8.1808
– volume: 104
  start-page: 10962
  year: 2007
  ident: 3931_CR25
  publication-title: Proc Natl Acad Sci USA
  doi: 10.1073/pnas.0702080104
– volume: 103
  start-page: 8101
  year: 2006
  ident: 3931_CR4
  publication-title: Proc Natl Acad Sci USA
  doi: 10.1073/pnas.0601161103
– volume-title: Mobile DNA II
  year: 2002
  ident: 3931_CR2
  doi: 10.1128/9781555817954
– volume: 41
  start-page: 331
  year: 2007
  ident: 3931_CR5
  publication-title: Annu Rev Genet
  doi: 10.1146/annurev.genet.40.110405.090448
– ident: 3931_CR36
– volume: 325
  start-page: 1391
  year: 2009
  ident: 3931_CR26
  publication-title: Science
  doi: 10.1126/science.1175688
– volume: 390
  start-page: 180
  year: 2007
  ident: 3931_CR7
  publication-title: Gene
  doi: 10.1016/j.gene.2006.10.012
– volume: 14
  start-page: 249
  year: 1995
  ident: 3931_CR17
  publication-title: Algorithmica
  doi: 10.1007/BF01206331
– volume: 1
  start-page: 22
  year: 2006
  ident: 3931_CR42
  publication-title: Algorithms for Molecular Biology
  doi: 10.1186/1748-7188-1-22
– volume: 351
  start-page: 108
  year: 2005
  ident: 3931_CR33
  publication-title: J Mol Biol
  doi: 10.1016/j.jmb.2005.05.006
– volume: 61
  start-page: 1
  year: 2009
  ident: 3931_CR21
  publication-title: Plasmid
  doi: 10.1016/j.plasmid.2008.09.008
– volume: 22
  start-page: 1948
  year: 2006
  ident: 3931_CR13
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/btl337
– volume: 21
  start-page: 25
  year: 2009
  ident: 3931_CR23
  publication-title: Plant Cell
  doi: 10.1105/tpc.108.063206
– volume: 12
  start-page: 1065
  issue: 8
  year: 2005
  ident: 3931_CR41
  publication-title: Journal of Computational Biology
  doi: 10.1089/cmb.2005.12.1065
– volume: 174
  start-page: 247
  year: 1999
  ident: 3931_CR45
  publication-title: FEMS Microbiol Lett
  doi: 10.1111/j.1574-6968.1999.tb13575.x
– volume: 12
  start-page: 1269
  year: 2002
  ident: 3931_CR37
  publication-title: Genome Res
  doi: 10.1101/gr.88502
– start-page: 35
  volume-title: Biotechnology Computing, Proceedings of the Twenty-Seventh Hawaii International Conference
  year: 1994
  ident: 3931_CR18
– volume: 58
  start-page: 236
  year: 1963
  ident: 3931_CR34
  publication-title: Journal of the American Statistical Association
  doi: 10.1080/01621459.1963.10500845
– volume: 156
  start-page: 1983
  year: 2000
  ident: 3931_CR28
  publication-title: Genetics
  doi: 10.1093/genetics/156.4.1983
– start-page: 58
  volume-title: Bioinformatics Research and Development, 2nd Int. Conference, BIRD 2008, Vienna, Austria, July 7-9, 2008
  year: 2008
  ident: 3931_CR43
  doi: 10.1007/978-3-540-70600-7_5
– volume: 8
  start-page: 21
  year: 2007
  ident: 3931_CR44
  publication-title: BMC Bioinformatics
  doi: 10.1186/1471-2105-8-21
– volume: 297
  start-page: 201
  year: 1982
  ident: 3931_CR14
  publication-title: Nature
  doi: 10.1038/297201a0
– volume: 4
  start-page: e5761
  year: 2009
  ident: 3931_CR3
  publication-title: PLoS One
  doi: 10.1371/journal.pone.0005761
– volume: 106
  start-page: 19922
  year: 2009
  ident: 3931_CR24
  publication-title: Proc Natl Acad Sci USA
  doi: 10.1073/pnas.0908008106
– volume: 169
  start-page: 2047
  year: 2005
  ident: 3931_CR27
  publication-title: Genetics
  doi: 10.1534/genetics.104.035048
– reference: 18076328 - Annu Rev Genet. 2007;41:331-68
– reference: 10339815 - FEMS Microbiol Lett. 1999 May 15;174(2):247-50
– reference: 19745152 - Science. 2009 Sep 11;325(5946):1391-4
– reference: 8324630 - Comput Appl Biosci. 1993 Jun;9(3):299-314
– reference: 10675923 - Trends Ecol Evol. 2000 Mar;15(3):95-99
– reference: 6176872 - Nature. 1982 May 20;297(5863):201-4
– reference: 17157447 - Gene. 2007 Apr 1;390(1-2):180-9
– reference: 17919898 - Curr Opin Genet Dev. 2007 Dec;17(6):486-92
– reference: 19926865 - Proc Natl Acad Sci U S A. 2009 Nov 24;106(47):19922-7
– reference: 19136648 - Plant Cell. 2009 Jan;21(1):25-38
– reference: 15961478 - Bioinformatics. 2005 Jun;21 Suppl 1:i351-8
– reference: 19488400 - PLoS One. 2009;4(6):e5761
– reference: 14632258 - Curr Issues Mol Biol. 2004 Jan;6(1):43-55
– reference: 19463167 - BMC Genomics. 2009;10:240
– reference: 17488840 - Nucleic Acids Res. 2007 Jul;35(Web Server issue):W669-74
– reference: 16809391 - Bioinformatics. 2006 Aug 15;22(16):1948-54
– reference: 16241898 - J Comput Biol. 2005 Oct;12(8):1065-82
– reference: 17244370 - BMC Bioinformatics. 2007;8:21
– reference: 8745082 - Curr Opin Genet Dev. 1995 Dec;5(6):814-21
– reference: 15946679 - J Mol Biol. 2005 Aug 5;351(1):108-16
– reference: 17118189 - Algorithms Mol Biol. 2006 Nov 21;1:22
– reference: 11108467 - J Comput Biol. 2000;7(3-4):345-62
– reference: 16672366 - Proc Natl Acad Sci U S A. 2006 May 23;103(21):8101-6
– reference: 11102389 - Genetics. 2000 Dec;156(4):1983-95
– reference: 16093699 - Cytogenet Genome Res. 2005;110(1-4):462-7
– reference: 15655071 - BMC Bioinformatics. 2005;6:9
– reference: 17578919 - Proc Natl Acad Sci U S A. 2007 Jun 26;104(26):10962-7
– reference: 17850916 - Trends Genet. 2007 Oct;23(10):521-9
– reference: 10779533 - Mol Biol Evol. 2000 May;17(5):730-7
– reference: 12176934 - Genome Res. 2002 Aug;12(8):1269-76
– reference: 9254694 - Nucleic Acids Res. 1997 Sep 1;25(17):3389-402
– reference: 16223791 - Bioinformatics. 2005 Dec 15;21(24):4408-10
– reference: 18951916 - Plasmid. 2009 Jan;61(1):1-14
– reference: 15574804 - Mol Biol Evol. 2005 Mar;22(3):741-6
– reference: 10734201 - Nucleic Acids Res. 2000 Apr 15;28(8):1808-18
– reference: 19349746 - J Microbiol Biotechnol. 2009 Mar;19(3):217-28
– reference: 15695364 - Genetics. 2005 Apr;169(4):2047-59
SSID ssj0017805
Score 2.000552
Snippet Background Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority...
Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the...
Background Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority...
Abstract Background: Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the...
BACKGROUND: Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority...
Abstract Background Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the...
SourceID doaj
unpaywall
pubmedcentral
hal
proquest
gale
pubmed
crossref
springer
SourceType Open Website
Open Access Repository
Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 474
SubjectTerms Algorithms
Animals
Base Sequence
Bioinformatics
Biomedical and Life Sciences
Comparative genomics
Computational biology
Computational Biology/Bioinformatics
Computer Appl. in Life Sciences
Computer Science
Deoxyribonucleic acid
DNA
DNA Transposable Elements - genetics
Drosophila melanogaster
Drosophila melanogaster - genetics
Eukaryotes
Evolution
Genes
Genetic aspects
Genetic Variation
Genetics
Genome
Genomes
Genomics
Life Sciences
Microarrays
Mutation
Physiological aspects
Quantitative Methods
Research Article
Sequence Alignment
Software
Transposons
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3da9RAEF-0IOqD-G3aKkEKYiHc7l6yH76dYj3F-qAW-rYk-9EWzqQ0l0r_e2fyZUOpffEx2blkbmd2diYz81tCdpjIQW20T5hUNEnnTiUqy32iPURDGeblOPYO738Ty4P0y2F2eOmoL6wJ6-CBu4mbWcWC5FbYvADPXRe5dU4r7jVI19m0BdumSg_BVJ8_QKT-tq9IsgSCmmxIUCoxG-9hR1kq08mG1OL2j9b59jEWR171PK8WUI5Z1PvkblOe5he_89Xq0ka195A86D3MeNH9s0fkli8fkzvdmZMXT8in_co1K9_3YPqzd7HzmEiA58a_2qE6Pinj9sMHRNFxFeJ1B4BeY5dV7Lt68_opOdj7-PPDMulPU0is0HqdhDDnlvOQB1po5h0L1FLlJVeuEMwJCtslBBdBCoGnTDls8EgR28VxW2hYq8_IRlmV_gWJBfWiYIE5Rlt8tiJTLsy98Kl14P_yiMyGKTW2hxrHEy9Wpg05lDAoBINCgEsDQojI2_EXpx3Mxj9o36OURjoEyG5vgNqYXm3MTWoTkdcoY4MQGCXW2BzlTV2bzz--mwV4MQqRwFRE3vREoQL-bd63LMAsIGrWhHJ7Qglr1E6Gd0CVJhwvF1-BGoyMQTsoZMrPWUS2Bl0zvSmpDThsSqBZjkg8juLzsTqu9FVTG5lBUK6kZNeTaEyQgqxh9p53ujtyA8tHUKlpROREqyfsTkfKk-MWiZxrDHDhtbuD_v_l-3rx7Y4r5EZZb_4PWW-Re13Nh0443yYb67PGvwRXcl28aq3GH4MTaT4
  priority: 102
  providerName: Directory of Open Access Journals
– databaseName: ProQuest Central
  dbid: BENPR
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwhV3ra9RAEF_aK6J-EN_GVglSEAvhsnvJZlcQuUrrKV6RaqHflmQfbeFMzstF6X_vTF4aSuvHu53LDTuP3cnM_IaQXcpTUBtpA5qIMIgmRgQiTm0gLURDMeblGPYOz4_47CT6fBqfbpB51wuDZZWdT6wdtSk0viMfw7klOGrn--XPAIdGYXK1m6CRtpMVzLsaYWyTbDEExhqRrf2Do6_HfVoBAfy7XKXgYwqeOQC6GJvLoiQanE01hH_vqDfPsU7y6iX0ai1ln1C9S25X-TK9_J0uFv-cWYf3yb32sulPG-14QDZs_pDcasZPXj4iH-eFqRa2bce0q7e-sZhTgOf6P-ql0r_I_fodCATUfuH8dYOFXmLDlW-b0vPyMTk5PPj-YRa0gxUCzaVcB85NmGbMpS7MJLWGulCHwiZMmIxTw0M4OSHOcAnnOHDKYK9HhDAvhulMgtk-IaO8yO0z4vPQ8ow6amhYQ7VlsTBuYrmNtIGrMPPIuNtSpVvUcRx-sVB19CG4QiEoFAJ8VCAEj7zpf7FsEDduoN1HKfV0iJVdf1GszlRrekoL6hKmuU4ziP1klmpjpGBWgn8wOuIeeYUyVoiGkWO5zVlalaX69O1YTeFCIxAUTHjkdUvkCuBfp233AuwCAmgNKHcGlGCuerC8C6o04Hg2_QLU4G8UukSeROwX9ch2p2uq9Sql6m3AI36_is_HQrncFlWpkhjic5Ek9HoSiblSkDXs3tNGd3tuGAS4YSJDjyQDrR6wO1zJL85rUHImMdaFv93r9P8v39eLb6-3kP_K-vmNO7JN7jR1HTJgbIeM1qvKvoDr4jp72TqBP1AmZBw
  priority: 102
  providerName: ProQuest
– databaseName: Scholars Portal Journals: Open Access
  dbid: M48
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwhV3rb9MwELe2IQT7gHgTNlCEJhCTssVu4thICBXEKIjyAai0b1bixzapS7qmBfrfc5fXiLaxj40vrut7-K7n-x0hO5SnIDbSBjQRYRANjAhEnNpAWoiGYszLMawdHn_jo0n05TA-XCNtdUmzgeWloR32k5rMp3t_zlbvQOHfVgov-D4FAxtA6BJjjViURC9nZwG2lcL0a9NjY53cgKNLYm-HcXSeZkBA_6r8qJmgzWNeMmnv3Krg_Tsjvn6MdygvOqgX71l2ydZNcmuZz9LV73Q6_ec8O7hL7jSOqD-sJeceWbP5fXKzbk25ekA-jQuznNqmVNPO3_jGYr4B5vVPq6HSP8n96v8RCLb9wvmLGie9xGIs39bX0suHZHLw8eeHUdA0XQg0l3IRODdgmjGXujCT1BrqQh0KmzBhMk4ND-FUhRjEJZxjMyqDdSARQsAYpjMJKv2IbORFbp8Qn4eWZ9RRQ8MKxi2LhXEDy22kDbjJzCP77ZYq3SCSY2OMqaoiE8EVMkEhE-CjAiZ45HX3xqxG4_gP7XvkUkeHONrVg2J-pBq1VFpQlzDNdZpBXCizVBsjBbMSbIfREffIC-SxQqSMHK_iHKXLslSff3xXQ3B2BAKGCY-8aohcAevXaVPZALuA4Fo9yu0eJaiy7g3vgCj1VjwafgVqsEUKzSVPIvaLemSrlTXVKowCv05wtN4e8btRnB8v0eW2WJYqiSF2F0lCryaRmEcFXsPuPa5lt1sNg-A3TGTokaQn1b3l9kfyk-MKsJxJjIPha3db-T9f99Xs2-005FpeP73-N2-R2_XFDxkwtk02FvOlfQb-5CJ7XtmEvy8va8Q
  priority: 102
  providerName: Scholars Portal
– databaseName: Springer Nature OA Free Journals
  dbid: C6C
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3da9RAEB9sRdQH8buxVYIUxEJodi_ZD9_OYj3F-qAW-rYk-2EL11xpLkr_e2eSXGyoVXy87GRv2JmdncnM_BZgm4kC1Ub7hEmVJtnEqUTlhU-0x2gop7wcp97hg89idph9PMqP-u8d1AtzOX_PlNhlaDwTDEty6v_KZLYGN_GIEm1aVuwN-QJC5l8lIf_w1ujQabH5Bwu8dkwFkFe9y6tFkkOm9C7cbqqz4uJnMZ9fOoz278O93ouMp53YH8ANXz2EW929kheP4P3BwjVz3_dZ-vM3sfOULMB549N2qI5Pqrj9uIGRcrwI8bIDOa-pkyr2XU15_RgO999925sl_Y0JiRVaL5MQJtxyHoqQlpp5x0JqU-UlV64UzIkUj0QMIIIUgm6SctTEkRF-i-O21Lgfn8B6taj8BsQi9aJkgTmWthhsZa5cmHjhM-vQx-UR7K6W1NgeTpxutZibNqxQwpAQDAkBfxoUQgSvhzfOOiiNv9C-JSkNdASC3T5A3TD9njJWsSC5FbYoMajTZWGd04p7jRvf2UxE8JJkbAjmoqI6mu9FU9fmw9cvZoqeiiK0LxXBq54oLJB_W_RtCbgKhIw1otwaUeI-tKPhbVSlEcez6SekRkNiyNYJmfEfLILNla6Z3lzUBp0yJcj0RhAPozQ_VcBVftHURuYYeCsp2fUkmpKgKGtcvaed7g7ccIxcU6nTCORIq0fsjkeqk-MWbZxrCmLxb3dW-v-b7-vFtzPskH_K-tn_zLwJd7r6DZ1wvgXry_PGP0e3cFm-aC3CL5y3VYo
  priority: 102
  providerName: Springer Nature
Title ModuleOrganizer: detecting modules in families of transposable elements
URI https://link.springer.com/article/10.1186/1471-2105-11-474
https://www.ncbi.nlm.nih.gov/pubmed/20860790
https://www.proquest.com/docview/901860305
https://www.proquest.com/docview/757178771
https://www.proquest.com/docview/954587284
https://inria.hal.science/inria-00536742
https://pubmed.ncbi.nlm.nih.gov/PMC2955051
https://bmcbioinformatics.biomedcentral.com/counter/pdf/10.1186/1471-2105-11-474
https://doaj.org/article/c81f72c6cab1489bacdd982e9004dc46
UnpaywallVersion publishedVersion
Volume 11
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVADU
  databaseName: BioMed Central Open Access Free
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: RBZ
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.biomedcentral.com/search/
  providerName: BioMedCentral
– providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: KQ8
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: KQ8
  dateStart: 20000701
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: DOA
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVEBS
  databaseName: Academic Search Ultimate
  customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: ABDBF
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn
  providerName: EBSCOhost
– providerCode: PRVEBS
  databaseName: Inspec with Full Text
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: ADMLS
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text
  providerName: EBSCOhost
– providerCode: PRVBFR
  databaseName: Free Medical Journals
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: DIK
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: http://www.freemedicaljournals.com
  providerName: Flying Publisher
– providerCode: PRVFQY
  databaseName: GFMER Free Medical Journals
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: GX1
  dateStart: 0
  isFulltext: true
  titleUrlDefault: http://www.gfmer.ch/Medical_journals/Free_medical.php
  providerName: Geneva Foundation for Medical Education and Research
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: M~E
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVAQN
  databaseName: PubMed Central
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: RPM
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.ncbi.nlm.nih.gov/pmc/
  providerName: National Library of Medicine
– providerCode: PRVPQU
  databaseName: Health & Medical Collection
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: 7X7
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/healthcomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: BENPR
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Technology Collection
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: 8FG
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/technologycollection1
  providerName: ProQuest
– providerCode: PRVFZP
  databaseName: Scholars Portal Journals: Open Access
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 20250131
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: M48
  dateStart: 20000701
  isFulltext: true
  titleUrlDefault: http://journals.scholarsportal.info
  providerName: Scholars Portal
– providerCode: PRVAVX
  databaseName: HAS SpringerNature Open Access 2022
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: AAJSJ
  dateStart: 20001201
  isFulltext: true
  titleUrlDefault: https://www.springernature.com
  providerName: Springer Nature
– providerCode: PRVAVX
  databaseName: Springer Nature OA Free Journals
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: C6C
  dateStart: 20000112
  isFulltext: true
  titleUrlDefault: http://www.springeropen.com/
  providerName: Springer Nature
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3rb9MwELf2EAI-8H6EjSpCkxCT0iZe4gffumkPKjZNG5O6T1ZiO1tFl4ymBY2_nrskDQtjICS-JEp8aZ3z3fkuvvuZkLWAxSA20noBF74XbhjhiSi2nrQQDUW4Lkexdnj_gO2dhINhNFwgh_NamORCJ6O8Bg1FoOLu9TL0cVXlgLso2Env0qSV0gvWC8DIehC-RFgnFvJwkSyzCLzzJbJ8cnDYPy2LjGqS-Wrlbx5rzU4liH9jqhfPMVPypht6M5uyWVK9T-7Ossv46ls8Hl-btXYeki_z962SVT53Z9Okq7__AgX5PxnyiDyoXVy3X8nkY7JgsyfkTrXp5dVTsrufm9nY1kWgdvLeNRZXMuBd3IuyqXBHmVt-eYEw3s1Td1ohsBdY5uXaKuG9eEZOdrY_be159XYOnmZSTr003aCa0jRO_UQG1gSpr31hORUmYYFhPszXEN2knDHc5spghUmI4DKG6kSCsXhOlrI8sy-Jy3zLkiANTOCXAHFJJEy6YZkNtQEHnDqkNx9GpWusc9xyY6zKmEcwhexRyB64VMAeh7xrnriscD7-QLuJktHQIUJ3eSOfnKla4ZUWQcqpZjpOIOKUSayNkYJaCVbJ6JA55A3KlUIMjgyTfM7iWVGoD8dHqg9ulEAoMuGQtzVRmkP_dVzXTAAXELarRbnaogQjoVvNayC-rR7v9T8CNVg5hYaY8ZB-DRyyMpdvVduyQoHHKBjOCw5xm1b8fUzPy2w-KxSPOOg658HtJBJXaGGsgXsvKn1pekMhrPa59B3CW5rU6m67JRudl1DoVGKEDX-7Pte5n_2-ffjWG63861i_-hfiFXKvSi6RHqWrZGk6mdnX4LNOkw5Z5EMOR7Gz2yHL_f7geADnze2DwyO4u8W2OuXXIDjuh6JTG60fL26U-Q
linkProvider Unpaywall
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELfGEBo8IL4JGxChIcSkqLGbODYSQuVjtKzbA2xS30xiO9ukkpSmZeofxf_IXb4gmjae9tj4kjq-8893uS9CtimPQWyk9WgkfC_oG-GJMLaetGANheiXY5g7vH_Ah0fBl0k4WSO_m1wYDKtsMLEEapNr_Ebeg3NLcJTOd7OfHjaNQudq00Gjkoo9uzoDi614O_oI7H3J2O6nww9Dr24q4Gku5cJL0z7TjKVx6ieSWkNTX_vCRkyYhFPDfTg1QMdOI86x2ZLBPIcAS5wYphPpY5MIQPzrQR-gBLZPNGntO3zbsPGECt6jgPseWFQhpq4FUdA5-coGAe0xcO0EozDPq7jnIzVbd-0tsrHMZvHqLJ5O_zkRd--Q27Uq6w4q2btL1mx2j9yomluu7pPP-7lZTm2d7Gnnb1xj0WMBz3V_lEOFe5q55RcWMNfdPHUXVaX1AtO5XFsFthcPyNGVrPBDsp7lmX1MXO5bntCUGuqXheCSUJi0b7kNtAFFmzmk1yyp0nVNc2ytMVWlbSO4QiYoZAL8VMAEh7xu75hV9TwuoX2PXGrpsBJ3eSGfH6t6YystaBoxzXWcgGUpk1gbIwWzEtDH6IA75AXyWGGtjQyDeY7jZVGo0bevagDqksCSY8Ihr2qiNIf567jOjYBVwPJcHcqtDiWAge4Mb4ModWY8HIyBGtBMIeDyKGC_qEM2G1lTNWYVqt1hDnHbUXw-huFlNl8WKgrB-hdRRC8mkeiJBV7D6j2qZLedDQPz2Y-k75CoI9Wd6XZHstOTsuQ5k2hJw9_uNPL_d94Xs2-n3SH_5fWTS1fkOdkYHu6P1Xh0sLdJblYRJNJjbIusL-ZL-xQU00XyrIQDl3y_avz5A1YBmyE
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3rb9MwELfYEK8PiDdhAyI0CTEpauwmjs23UigdbBMCJu2blfixTSpJ1TSg_ffc5QXRGIiPjS_uyXc-3-XufiZkh_IU1EbagCYiDKKxEYGIUxtIC9FQjHk5hr3DB4d8fhR9OI6P2w9uZVft3qUkm54GRGnK16Olcc0WF3xEwaQGEKzE2BUWJdEGuRrB2YY3GEz5tM8iIF5_l5r8w1uDo6hG7O_t8sYplkVe9Dkvlk72-dNb5EaVL9PzH-li8dsRNbtDbre-pT9plOEuuWLze-Rac9vk-X3y_qAw1cK23Zd29do3FlMIMK__rR4q_bPcrz95QPzsF85fN9DnJfZX-bapNC8fkKPZu6_TedDeoxBoLuU6cG7MNGMudWEmqTXUhToUNmHCZJwaHsJBCWGFSzjH-6UMtnZEiOpimM4k7NKHZDMvcvuY-Dy0PKOOGhrWyGxZLIwbW24jbcDzZR4ZdUuqdAsyjnddLFQdbAiuUAgKhQA_FQjBI6_6N5YNwMZfaN-glHo6hMauHxSrE9XuNKUFdQnTXKcZhHoyS7UxUjArwRwYHXGPvEAZKwS_yLG65iStylLtffmsJuC_CMQAEx552RK5AvjXadusAKuAeFkDyu0BJexOPRjeAVUacDyf7AM1mBeFFpAnEftOPbLV6ZpqjUipwFUTHA2yR_x-FOfHurjcFlWpkhjCcZEk9HISialRkDWs3qNGd3tuGMSzYSJDjyQDrR6wOxzJz05rDHImMbSFv93t9P8X35eLb7ffIf-U9ZP_mfk5uf7p7Uzt7x1-3CI3mwIPGTC2TTbXq8o-Bb9xnT2rjcNPNYJgwA
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3db9MwELe2Tgh44PsjbKAITUJMShu7iWPzVhCjIDZNQKXtyUpsZ6voktK0oPHXc5cvFsZASDw2vqSX8935Lr77mZBtymNQG2k9GgnfC4ZGeCKMrSctZEMh7ssx7B3e2-fjSfDuMDxcIwdNL0xyqpNpXoOGIlBx_3wb-qzqcsBTFOxiMDdpZfSCDyg4WQ_SlxD7xIIoWCcbPITovEc2JvsHo6OyyagmaXYrf3NbZ3UqQfxbV71-gpWSF8PQi9WU7ZbqdXJ1lc3js2_xbHZu1dq9Sb4071sVq3zur5ZJX3__BQryfwrkFrlRh7juqNLJ22TNZnfIlerQy7O75M1eblYzWzeB2sUL11jcyYB3cU_LocKdZm755QXSeDdP3WWFwF5gm5drq4L34h6Z7L7-9Grs1cc5eJpLufTSdMg0Y2mc-omk1tDU176wERMm4dRwH9ZryG7SiHM85spgh0mA4DKG6USCs7hPelme2YfE5b7lCU2poX4JEJeEwqRDy22gDQTgzCGDZhqVrrHO8ciNmSpzHsEVikeheOCnAvE45Hl7x7zC-fgD7UvUjJYOEbrLC_niWNUGr7SgacQ013ECGadMYm2MFMxK8EpGB9whT1GvFGJwZFjkcxyvikK9_fhBjSCMEghFJhzyrCZKc-Bfx3XPBEgBYbs6lFsdSnASujO8Derb4Xg8eg_U4OUUOmIeBewrdchmo9-q9mWFgohRcFwXHOK2o_h8LM_LbL4qVBRGYOtRRC8nkbhDC3MN0ntQ2UvLDYO02o-k75CoY0kddrsj2fSkhEJnEjNs-NudxuZ-8n359O20VvnXuX70L8Sb5FpVXCI9xrZIb7lY2ccQsy6TJ7Ub-gEqvI1a
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=ModuleOrganizer%3A+detecting+modules+in+families+of+transposable+elements&rft.jtitle=BMC+bioinformatics&rft.au=Tempel%2C+Sebastien&rft.au=Rousseau%2C+Christine&rft.au=Tahi%2C+Fariza&rft.au=Nicolas%2C+Jacques&rft.date=2010-09-22&rft.issn=1471-2105&rft.eissn=1471-2105&rft.volume=11&rft.spage=474&rft_id=info:doi/10.1186%2F1471-2105-11-474&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-2105&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-2105&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-2105&client=summon