{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:12:34Z","timestamp":1743066754649,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030181734"},{"type":"electronic","value":"9783030181741"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18174-1_16","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:15:30Z","timestamp":1558347330000},"page":"212-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Algorithms for Finding Edit-Distance Based Motifs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5566-0207","authenticated-orcid":false,"given":"Peng","family":"Xiao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1537-7161","authenticated-orcid":false,"given":"Xingyu","family":"Cai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0137-4843","authenticated-orcid":false,"given":"Sanguthevar","family":"Rajasekaran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-45784-4_11","volume-title":"Algorithms in Bioinformatics","author":"EF Adebiyi","year":"2002","unstructured":"Adebiyi, E.F., Kaufmann, M.: Extracting common motifs under the levenshtein measure: theory and experimentation. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 140\u2013156. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45784-4_11"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Buhler, J., Tompa, M.: Finding motifs using random projections. In: Proceedings of Fifth Annual International Conference on Computational Molecular Biology (RECOMB) (2001)","DOI":"10.1145\/369133.369172"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Cai, X., Mamun, A.A., Rajasekaran, S.: Novel algorithms for finding the closest l-mers in biological data. In: 2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp. 525\u2013528. IEEE (2017)","DOI":"10.1109\/BIBM.2017.8217702"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/1.9781611975321.9","volume-title":"Proceedings of the 2018 SIAM International Conference on Data Mining","author":"Xingyu Cai","year":"2018","unstructured":"Cai, X., Zhou, S., Rajasekaran, S.: Jump: a fast deterministic algorithm to find the closest pair of subsequences. In: Proceedings of the 2018 SIAM International Conference on Data Mining, pp. 73\u201380. SIAM (2018)"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"JK Lanctot","year":"2003","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185(1), 41\u201355 (2003)","journal-title":"Inf. Comput."},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-15-34","volume":"15","author":"M Nicolae","year":"2014","unstructured":"Nicolae, M., Rajasekaran, S.: Efficient sequential and parallel algorithms for planted motif search. BMC Bioinform. 15(1), 1 (2014)","journal-title":"BMC Bioinform."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"7813","DOI":"10.1038\/srep07813","volume":"5","author":"M Nicolae","year":"2015","unstructured":"Nicolae, M., Rajasekaran, S.: qPMS9: an efficient algorithm for quorum planted motif search. Sci. Rep. 5, 7813 (2015)","journal-title":"Sci. Rep."},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1186\/s12864-016-2789-9","volume":"17","author":"S Pal","year":"2016","unstructured":"Pal, S., Xiao, P., Rajasekaran, S.: Efficient sequential and parallel algorithms for finding edit distance based motifs. BMC Genomics 17(4), 465 (2016)","journal-title":"BMC Genomics"},{"issue":"04","key":"16_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1142\/S0129054113500159","volume":"24","author":"S Pathak","year":"2013","unstructured":"Pathak, S., Rajasekaran, S., Nicolae, M.: EMS1: an elegant algorithm for edit distance based motif search. Int. J. Found. Comput. Sci. 24(04), 473\u2013486 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4\u20135","key":"16_CR11","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10877-005-0677-y","volume":"19","author":"S Rajasekaran","year":"2005","unstructured":"Rajasekaran, S., et al.: High-performance exact algorithms for motif search. J. Clin. Monit. Comput. 19(4\u20135), 319\u2013328 (2005)","journal-title":"J. Clin. Monit. Comput."},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1186\/1756-0500-4-54","volume":"4","author":"S Rajasekaran","year":"2011","unstructured":"Rajasekaran, S., Dinh, H.: A speedup technique for (l, d)-motif finding algorithms. BMC Res. Notes 4(1), 54 (2011)","journal-title":"BMC Res. Notes"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Rocke, E., Tompa, M.: An algorithm for finding novel gapped motifs in DNA sequences. In: Proceedings of the Second Annual International Conference on Computational Molecular Biology, pp. 228\u2013233. ACM (1998)","DOI":"10.1145\/279069.279119"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BFb0054337","volume-title":"LATIN\u201998: Theoretical Informatics","author":"M-F Sagot","year":"1998","unstructured":"Sagot, M.-F.: Spelling approximate repeated or common motifs using a suffix tree. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 374\u2013390. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/BFb0054337"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1038\/nbt1053","volume":"23","author":"M Tompa","year":"2005","unstructured":"Tompa, M., et al.: Assessing computational tools for the discovery of transcription factor binding sites. Nat. Biotechnol. 23(1), 137 (2005)","journal-title":"Nat. Biotechnol."},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Xiao, P., Pal, S., Rajasekaran, S.: qPMS10: a randomized algorithm for efficiently solving quorum Planted Motif Search problem. In: 2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp. 670\u2013675. IEEE (2016)","DOI":"10.1109\/BIBM.2016.7822598"},{"issue":"2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1504\/IJDMB.2017.086457","volume":"18","author":"P Xiao","year":"2017","unstructured":"Xiao, P., Pal, S., Rajasekaran, S.: Randomised sequential and parallel algorithms for efficient quorum planted motif search. Int. J. Data Min. Bioinform. 18(2), 105\u2013124 (2017)","journal-title":"Int. J. Data Min. Bioinform."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18174-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T16:12:01Z","timestamp":1558541521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18174-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181734","9783030181741"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18174-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AlCoB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms for Computational Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berkeley, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alcob2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/alcob2019.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50% - 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"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"One paper of an invited talk is included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}