{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:45:12Z","timestamp":1740185112483,"version":"3.37.3"},"reference-count":11,"publisher":"Oxford University Press (OUP)","issue":"18","license":[{"start":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T00:00:00Z","timestamp":1549324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["KK.01.1.1.01.0009\u2014DATACROSS"],"award-info":[{"award-number":["KK.01.1.1.01.0009\u2014DATACROSS"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Slovenian Research Agency","doi-asserted-by":"publisher","award":["J7-7303"],"award-info":[{"award-number":["J7-7303"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004488","name":"Croatian Science Foundation","doi-asserted-by":"publisher","award":["IP-2014-09-2285","IP-2016-06-1046","IP-2018-01-7317"],"award-info":[{"award-number":["IP-2014-09-2285","IP-2016-06-1046","IP-2018-01-7317"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Summary<\/jats:title>\n                  <jats:p>Searching for local sequence patterns is one of the basic tasks in bioinformatics. Sequence patterns might have structural, functional or some other relevance, and numerous methods have been developed to detect and analyze them. These methods often depend on the wealth of information already collected. The explosion in the number of newly available sequences calls for novel methods to explore local sequence similarity. We have developed a new method for iterative motif scanning that will look for ungapped sequence patterns similar to a submitted query. Using careful parameter estimation and an adaptation of a fast string-matching algorithm, the method performs significantly better in this context than the existing software.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>The IGLOSS web server is available at http:\/\/compbioserv.math.hr\/igloss\/.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Supplementary information<\/jats:title>\n                  <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btz086","type":"journal-article","created":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T20:29:58Z","timestamp":1549312198000},"page":"3491-3492","source":"Crossref","is-referenced-by-count":0,"title":["IGLOSS: iterative gapless local similarity search"],"prefix":"10.1093","volume":"35","author":[{"given":"Braslav","family":"Rabar","sequence":"first","affiliation":[{"name":"Mathematics Department, Faculty of Natural Sciences and Mathematics , Zagreb, Croatia"}]},{"given":"Maja","family":"Zagor\u0161\u010dak","sequence":"additional","affiliation":[{"name":"Department of Biotechnology and Systems Biology, National Institute of Biology , Ljubljana, Slovenia"}]},{"given":"Strahil","family":"Ristov","sequence":"additional","affiliation":[{"name":"Division of Electronics, Ru\u0111er Bo\u0161kovi\u0107 Institute , Zagreb, Croatia"}]},{"given":"Martin","family":"Rosenzweig","sequence":"additional","affiliation":[{"name":"Mathematics Department, Faculty of Natural Sciences and Mathematics , Zagreb, Croatia"}]},{"given":"Pavle","family":"Goldstein","sequence":"additional","affiliation":[{"name":"Mathematics Department, Faculty of Natural Sciences and Mathematics , Zagreb, Croatia"}]}],"member":"286","published-online":{"date-parts":[[2019,2,5]]},"reference":[{"key":"2023013108055993400_btz086-B1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","article-title":"Basic local alignment search tool","volume":"215","author":"Altschul","year":"1990","journal-title":"J. Mol. Biol"},{"key":"2023013108055993400_btz086-B2","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":"2023013108055993400_btz086-B3","doi-asserted-by":"crossref","first-page":"D138","DOI":"10.1093\/nar\/gkh121","article-title":"The pfam protein families database","volume":"32","author":"Bateman","year":"2004","journal-title":"Nucleic Acids Res"},{"key":"2023013108055993400_btz086-B4","doi-asserted-by":"crossref","first-page":"W30","DOI":"10.1093\/nar\/gkv397","article-title":"HMMER: web server 2015 update","volume":"43","author":"Finn","year":"2015","journal-title":"Nucleic Acids Res"},{"key":"2023013108055993400_btz086-B5","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1093\/bioinformatics\/btr064","article-title":"FIMO: scanning for occurrences of a given motif","volume":"27","author":"Grant","year":"2011","journal-title":"Bioinformatics"},{"key":"2023013108055993400_btz086-B6","doi-asserted-by":"crossref","first-page":"4355","DOI":"10.1073\/pnas.84.13.4355","article-title":"Profile analysis: detection of distantly related proteins","volume":"84","author":"Gribskov","year":"1987","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2023013108055993400_btz086-B7","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1093\/nar\/gkt1056","article-title":"GoMapMan: integration, consolidation and visualization of plant gene annotations within the MapMan ontology","volume":"42","author":"Ram\u0161ak","year":"2014","journal-title":"Nucleic Acids Res"},{"key":"2023013108055993400_btz086-B8","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1089\/cmb.2016.0020","article-title":"A fast and simple pattern matching with hamming distance on large alphabets","volume":"23","author":"Ristov","year":"2016","journal-title":"J. Comput. Biol"},{"key":"2023013108055993400_btz086-B9","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","article-title":"Error bounds for convolutional codes and an asymptotically optimum decoding algorithm","volume":"13","author":"Viterbi","year":"1967","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2023013108055993400_btz086-B10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s12859-016-0919-7","article-title":"An effective approach for annotation of protein families with low sequence similarity and conserved motifs: identifying GDSL hydrolases across the plant kingdom","volume":"17","author":"Vujaklija","year":"2016","journal-title":"BMC Bioinformatics"},{"key":"2023013108055993400_btz086-B11","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0001-8708(76)90202-4","article-title":"Some biological sequence metrics","volume":"20","author":"Waterman","year":"1976","journal-title":"Adv. Math"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/35\/18\/3491\/48975664\/bioinformatics_35_18_3491.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/35\/18\/3491\/48975664\/bioinformatics_35_18_3491.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T13:46:04Z","timestamp":1675172764000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/35\/18\/3491\/5306940"}},"subtitle":[],"editor":[{"given":"John","family":"Hancock","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,2,5]]},"references-count":11,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2019,9,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btz086","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"type":"print","value":"1367-4803"},{"type":"electronic","value":"1367-4811"}],"subject":[],"published-other":{"date-parts":[[2019,9,15]]},"published":{"date-parts":[[2019,2,5]]}}}