{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:07:37Z","timestamp":1742969257278,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030491895"},{"type":"electronic","value":"9783030491901"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-49190-1_19","type":"book-chapter","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T07:02:58Z","timestamp":1590735778000},"page":"213-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Application and Algorithm: Maximal Motif Discovery for Biological Data in a Sliding Window"],"prefix":"10.1007","author":[{"given":"Miznah H.","family":"Alshammary","sequence":"first","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"Manal","family":"Mohamed","sequence":"additional","affiliation":[]},{"given":"Fatima","family":"Vayani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/TCBB.2006.16","volume":"3","author":"AM Carvalho","year":"2006","unstructured":"Carvalho, A.M., Freitas, A.T., Oliveira, A.L., Sagot, M.: Arm efficient algorithm for the identification of structured motifs in DNA promoter sequences. IEEE\/ACM Trans. Comput.- Biol. Bioinform. 3(2), 126\u2013140 (2006)","journal-title":"IEEE\/ACM Trans. Comput.- Biol. Bioinform."},{"issue":"3","key":"19_CR2","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/0092-8674(84)90284-8","volume":"38","author":"RS Fuller","year":"1984","unstructured":"Fuller, R.S., Funnell, B.E., Kornberg, A.: The dnaA protein complex with the E. coli chrornosomal replication origin (oriC) and other DNA sites. Cell 38(3), 889\u2013900 (1984)","journal-title":"Cell"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tcs.2017.04.012","volume":"710","author":"R Grossi","year":"2018","unstructured":"Grossi, R., Mermcorri, G., Pisanti, N., Trani, R., Vinc, S.: Motif trie: efficient text index for pattern discovery with don\u2019t cares. Theor. Comput. Sci. 710, 74\u201387 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"19_CR4","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1006\/jmbi.1998.1947","volume":"281","author":"J van Helden","year":"1998","unstructured":"van Helden, J., Andre, B., Collado-Vides, J.: Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J. Mol. Biol. 281(5), 827\u2013842 (1998)","journal-title":"J. Mol. Biol."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-00479-8_16","volume-title":"String Processing and Information Retrieval","author":"CS Iliopoulos","year":"2018","unstructured":"Iliopoulos, C.S., Mohamed, M., Pissis, Solon P., Vayani, F.: Maximal motif discovery in a sliding window. In: Gagie, T., Moffat, A., Navarro, G., Cuadros-Vargas, E. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 191\u2013205. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00479-8_16"},{"issue":"10","key":"19_CR6","first-page":"a010116","volume":"5","author":"A-C Leonard","year":"2013","unstructured":"Leonard, A.-C., M\u00e9chali, M.: DNA replication origins. Cold Spring Harb. Perspect. Biol. 5(10), a010116 (2013)","journal-title":"Cold Spring Harb. Perspect. Biol."},{"issue":"2","key":"19_CR7","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1073\/pnas.76.2.580","volume":"76","author":"M Meijer","year":"1979","unstructured":"Meijer, M., et al.: Nucleotide sequence of the origin of replication of the Escherichia coli K-12 chromosome. Proc. Nat. Acad. Sci. 76(2), 580\u2013584 (1979)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"Web-Server-Issu","key":"19_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1093\/nar\/gkh465","volume":"32","author":"G Pavesi","year":"2004","unstructured":"Pavesi, G., Mercghetti, P., Mauri, G., Pesole, G.: Weeder Web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes. Nucleic Acids Res. 32(Web-Server-Issue), 199\u2013203 (2004)","journal-title":"Nucleic Acids Res."},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/11682462_69","volume-title":"LATIN 2006: Theoretical Informatics","author":"N Pisanti","year":"2006","unstructured":"Pisanti, N., Carvalho, A.M., Marsan, L., Sagot, M.-F.: RISOTTO: fast extraction of motifs with mismatches. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 757\u2013768. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11682462_69"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1186\/1471-2105-15-235","volume":"15","author":"SP Pissis","year":"2014","unstructured":"Pissis, S.P.: MoTeX-ll; structured MoTif eXtraction from large-scale datasets. BMC Bioinf. 15, 235 (2014)","journal-title":"BMC Bioinf."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Pissis, S.P., Stamatakis, A., Pavlidis, P.: MoTeX: a word-based HPC tool for MoTif eXtraction. In: Gao, J. (ed.) ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics. ACM-BCB 2013, Washington, 22\u201325 September 2013, p. 13. ACM (2013)","DOI":"10.1145\/2506583.2506587"},{"issue":"13","key":"19_CR12","doi-asserted-by":"crossref","first-page":"3586","DOI":"10.1093\/nar\/gkg618","volume":"31","author":"S Sinha","year":"2003","unstructured":"Sinha, S., Tompa, M.: YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res. 31(13), 3586\u20133588 (2003)","journal-title":"Nucleic Acids Res."},{"issue":"4","key":"19_CR13","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF02459498","volume":"46","author":"MS Waterman","year":"1984","unstructured":"Waterman, M.S.: General methods of sequence comparison. Bull. Math. Biol. 46(4), 473\u2013500 (1984)","journal-title":"Bull. Math. Biol."}],"container-title":["IFIP Advances in Information and Communication Technology","Artificial Intelligence Applications and Innovations. AIAI 2020 IFIP WG 12.5 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-49190-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T23:19:28Z","timestamp":1716938368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-49190-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030491895","9783030491901"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-49190-1_19","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Artificial Intelligence Applications and Innovations","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Neos Marmaras","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiai2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.aiai2020.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easyacademia.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"149","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}