{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T13:16:26Z","timestamp":1774790186563,"version":"3.50.1"},"reference-count":14,"publisher":"Oxford University Press (OUP)","issue":"13","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":3061,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0\/uk\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: Intragenic duplications of genetic material have important biological roles because of their protein sequence and structural consequences. We developed Swelfe to find internal repeats at three levels. Swelfe quickly identifies statistically significant internal repeats in DNA and amino acid sequences and in 3D structures using dynamic programming. The associated web server also shows the relationships between repeats at each level and facilitates visualization of the results.<\/jats:p>\n               <jats:p>Availability: \u00a0http:\/\/bioserv.rpbs.jussieu.fr\/swelfe<\/jats:p>\n               <jats:p>Contact: \u00a0annela@abi.snv.jussieu.fr<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btn234","type":"journal-article","created":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:26:02Z","timestamp":1210983962000},"page":"1536-1537","source":"Crossref","is-referenced-by-count":50,"title":["Swelfe: a detector of internal repeats in sequences and structures"],"prefix":"10.1093","volume":"24","author":[{"given":"Anne-Laure","family":"Abraham","sequence":"first","affiliation":[{"name":"1 UPMC Univ Paris 06, Atelier de BioInformatique, F75005 Paris and 2Institut Pasteur, Microbial Evolutionary Genomics; CNRS, URA2171, F75015 Paris, France"},{"name":"1 UPMC Univ Paris 06, Atelier de BioInformatique, F75005 Paris and 2Institut Pasteur, Microbial Evolutionary Genomics; CNRS, URA2171, F75015 Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo P. C.","family":"Rocha","sequence":"additional","affiliation":[{"name":"1 UPMC Univ Paris 06, Atelier de BioInformatique, F75005 Paris and 2Institut Pasteur, Microbial Evolutionary Genomics; CNRS, URA2171, F75015 Paris, France"},{"name":"1 UPMC Univ Paris 06, Atelier de BioInformatique, F75005 Paris and 2Institut Pasteur, Microbial Evolutionary Genomics; CNRS, URA2171, F75015 Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00ebl","family":"Pothier","sequence":"additional","affiliation":[{"name":"1 UPMC Univ Paris 06, Atelier de BioInformatique, F75005 Paris and 2Institut Pasteur, Microbial Evolutionary Genomics; CNRS, URA2171, F75015 Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2008,5,16]]},"reference":[{"key":"2023020210353258900_B1","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1093\/bioinformatics\/btl519","article-title":"Repseek, a tool to retrieve approximate repeats from large DNA sequences","volume":"23","author":"Achaz","year":"2007","journal-title":"Bioinformatics"},{"key":"2023020210353258900_B2","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1093\/nar\/27.2.573","article-title":"Tandem repeats finder: a program to analyze DNA sequences","volume":"27","author":"Benson","year":"1999","journal-title":"Nucleic Acids Res"},{"key":"2023020210353258900_B3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/1097-0282(20011015)59:5<305::AID-BIP1027>3.0.CO;2-6","article-title":"Universal similarity measure for comparing protein structures","volume":"59","author":"Betancourt","year":"2001","journal-title":"Biopolymers"},{"key":"2023020210353258900_B4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/prot.20517","article-title":"YAKUSA: a fast structural database scanning method","volume":"61","author":"Carpentier","year":"2005","journal-title":"Proteins"},{"key":"2023020210353258900_B5","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1002\/j.1460-2075.1986.tb04288.x","article-title":"The relation between the divergence of sequence and structure in proteins","volume":"5","author":"Chothia","year":"1986","journal-title":"Embo J."},{"key":"2023020210353258900_B6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S0959-440X(96)80058-3","article-title":"Surprising similarities in structure comparison","volume":"6","author":"Gibrat","year":"1996","journal-title":"Curr. Opin. Struct. Biol."},{"key":"2023020210353258900_B7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1006\/jmbi.1993.1489","article-title":"Protein structure comparison by alignment of distance matrices","volume":"233","author":"Holm","year":"1993","journal-title":"J. Mol. Biol."},{"key":"2023020210353258900_B8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0196-8858(91)90017-D","article-title":"A time-efficient, linear-spaced local similarity algorithm","volume":"12","author":"Huang","year":"1991","journal-title":"Adv. Appl. Math."},{"key":"2023020210353258900_B9","first-page":"373","article-title":"A space-efficient algorithm for local similarities","volume":"6","author":"Huang","year":"1990","journal-title":"Comput. Appl. Biosci."},{"key":"2023020210353258900_B10","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1093\/bioinformatics\/15.5.426","article-title":"REPuter: fast computation of maximal repeats in complete genomes","volume":"15","author":"Kurtz","year":"1999","journal-title":"Bioinformatics"},{"key":"2023020210353258900_B11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1006\/jmbi.1999.3136","article-title":"A census of protein repeats","volume":"293","author":"Marcotte","year":"1999","journal-title":"J. Mol. Biol."},{"key":"2023020210353258900_B12","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1093\/protein\/11.9.739","article-title":"Protein structure alignment by incremental combinatorial extension (CE) of the optimal path","volume":"11","author":"Shindyalov","year":"1998","journal-title":"Protein Eng"},{"key":"2023020210353258900_B13","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1111\/j.1399-3011.1986.tb03267.x","article-title":"Protein structural homology: a metric approach","volume":"28","author":"Usha","year":"1986","journal-title":"Int. J. Pept. Protein Res."},{"key":"2023020210353258900_B14","doi-asserted-by":"crossref","first-page":"4625","DOI":"10.1073\/pnas.91.11.4625","article-title":"Rapid and accurate estimates of statistical significance for sequence data base searches","volume":"91","author":"Waterman","year":"1994","journal-title":"Proc. Natl Acad. Sci. USA"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/13\/1536\/49050245\/bioinformatics_24_13_1536.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/13\/1536\/49050245\/bioinformatics_24_13_1536.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T12:12:35Z","timestamp":1675339955000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/24\/13\/1536\/238908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,16]]},"references-count":14,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2008,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btn234","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2008,7,1]]},"published":{"date-parts":[[2008,5,16]]}}}