{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T18:33:57Z","timestamp":1696876437638},"reference-count":17,"publisher":"Oxford University Press (OUP)","issue":"24","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005,12,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: We have developed STAN (suffix-tree analyser), a tool to search for nucleotidic and peptidic patterns within whole chromosomes. Pattern syntax uses a string variable grammar-like formalism which allows the description of complex patterns including ambiguities, insertions\/deletions, gaps, repeats and palindromes. STAN is based on a reduction to multipart matching on a suffix-tree data structure and can handle large DNA sequences, whether assembled or not.<\/jats:p>\n               <jats:p>Availability: STAN is accessible online at<\/jats:p>\n               <jats:p>Contact: stan@irisa.fr<\/jats:p>","DOI":"10.1093\/bioinformatics\/bti710","type":"journal-article","created":{"date-parts":[[2005,10,14]],"date-time":"2005-10-14T00:24:37Z","timestamp":1129249477000},"page":"4408-4410","source":"Crossref","is-referenced-by-count":21,"title":["Suffix-tree analyser (STAN): looking for nucleotidic and peptidic patterns in chromosomes"],"prefix":"10.1093","volume":"21","author":[{"given":"Jacques","family":"Nicolas","sequence":"first","affiliation":[{"name":"IRISA-INRIA, Campus de Beaulieu \u00a0 35402 Rennes cedex, France"}]},{"given":"Patrick","family":"Durand","sequence":"additional","affiliation":[{"name":"IRISA-INRIA, Campus de Beaulieu \u00a0 35402 Rennes cedex, France"}]},{"given":"Gr\u00e9gory","family":"Ranchy","sequence":"additional","affiliation":[{"name":"IRISA-INRIA, Campus de Beaulieu \u00a0 35402 Rennes cedex, France"}]},{"given":"S\u00e9bastien","family":"Tempel","sequence":"additional","affiliation":[{"name":"IRISA-INRIA, Campus de Beaulieu \u00a0 35402 Rennes cedex, France"}]},{"given":"Anne-Sophie","family":"Valin","sequence":"additional","affiliation":[{"name":"IRISA-INRIA, Campus de Beaulieu \u00a0 35402 Rennes cedex, France"}]}],"member":"286","published-online":{"date-parts":[[2005,10,13]]},"reference":[{"key":"2023061007325628500_b1","doi-asserted-by":"crossref","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","article-title":"Gapped BLAST and PSI-BLAST: a new generation of protein database search programs","volume":"25","author":"Altschul","year":"1997","journal-title":"Nucleic Acids Res."},{"key":"2023061007325628500_b2","doi-asserted-by":"crossref","first-page":"9405","DOI":"10.1073\/pnas.89.20.9405","article-title":"Grammatical model of the regulation of gene expression","volume":"89","author":"Collado-Vides","year":"1992","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023061007325628500_b3","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1006\/geno.1994.1541","article-title":"Gene structure prediction by linguistic methods","volume":"23","author":"Dong","year":"1994","journal-title":"Genomics"},{"key":"2023061007325628500_b4","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/S0168-9525(97)01347-4","article-title":"Searching for patterns in genomic data","volume":"13","author":"Dsouza","year":"1997","journal-title":"Trends Genet."},{"key":"2023061007325628500_b5","first-page":"107","article-title":"ScanProsite: a reference implementation of a PROSITE scanning tool","volume":"1","author":"Gatiker","year":"2002","journal-title":"Appl. Bioinformatics"},{"key":"2023061007325628500_b6","first-page":"172","article-title":"PALM\u2014a pattern language for molecular biology","volume-title":"1st International Conference on Intelligent Systems for Molecular Biology","author":"Helgesen","year":"1993"},{"key":"2023061007325628500_b7","doi-asserted-by":"crossref","first-page":"8714","DOI":"10.1073\/pnas.151269298","article-title":"Rolling-circle transposons in eukaryotes","volume":"98","author":"Kapitonov","year":"2001","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023061007325628500_b8","first-page":"230","article-title":"Matching a set of strings with variable length don\u2032t cares","volume":"937","author":"Kucherov","year":"1995","journal-title":"LNCS"},{"key":"2023061007325628500_b9","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":"2023061007325628500_b10","doi-asserted-by":"crossref","first-page":"R12","DOI":"10.1186\/gb-2004-5-2-r12","article-title":"Versatile and open software for comparing large genomes","volume":"5","author":"Kurtz","year":"2004","journal-title":"Genome Biol."},{"key":"2023061007325628500_b11","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1093\/bioinformatics\/17.3.226","article-title":"Basic gene grammars and DNA-ChartParser for language processing of Escherichia coli promoter DNA sequences","volume":"17","author":"Leung","year":"2001","journal-title":"Bioinformatics"},{"key":"2023061007325628500_b12","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"2023061007325628500_b13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(80)90003-X","article-title":"Definite clause grammars for language analysis\u2014a survey of the formalism and a comparison with augmented transition networks","volume":"13","author":"Pereira","year":"1980","journal-title":"Artif. Intell."},{"key":"2023061007325628500_b14","first-page":"189","article-title":"Investigating the linguistics of DNA with definite clause grammars","volume-title":"Logic Programming: Proceedings of the North American Conference on Logic Programming","author":"Searls","year":"1989"},{"key":"2023061007325628500_b15","first-page":"47","article-title":"The computational linguistics of biological sequences","volume-title":"Artificial Intelligence and Molecular Biology","author":"Searls","year":"1993"},{"key":"2023061007325628500_b16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0743-1066(95)00034-H","article-title":"String variable grammar : a logic grammar formalism for the biological language of DNA","volume":"14","author":"Searls","year":"1995","journal-title":"J. Logic Prog."},{"key":"2023061007325628500_b17","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1038\/nature01255","article-title":"The language of genes","volume":"420","author":"Searls","year":"2002","journal-title":"Nature"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/24\/4408\/50566217\/bioinformatics_21_24_4408.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/24\/4408\/50566217\/bioinformatics_21_24_4408.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T07:33:19Z","timestamp":1686382399000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/21\/24\/4408\/179826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,13]]},"references-count":17,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2005,12,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bti710","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2005,12,15]]},"published":{"date-parts":[[2005,10,13]]}}}