{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:02:19Z","timestamp":1742972539024,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319936970"},{"type":"electronic","value":"9783319936987"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93698-7_39","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:30:25Z","timestamp":1528745425000},"page":"506-523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Solutions to the k-difference Primer Problem"],"prefix":"10.1007","author":[{"given":"Leandro","family":"Feuser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nahri","family":"Moreano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"39_CR1","volume-title":"Bioinformatics - A Practical Guide to the Analysis of Genes and Proteins","author":"A Baxevanis","year":"2005","unstructured":"Baxevanis, A., Ouellette, B.: Bioinformatics - A Practical Guide to the Analysis of Genes and Proteins, 3rd edn. Wiley, Hoboken (2005)","edition":"3"},{"key":"39_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"issue":"3","key":"39_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/scj.4690260303","volume":"26","author":"M Ito","year":"1995","unstructured":"Ito, M., et al.: A polynomial-time algorithm for computing characteristic strings under a set of strings. Syst. Comput. Jpn 26(3), 30\u201338 (1995)","journal-title":"Syst. Comput. Jpn"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Landau, G., Vishkin, U.: Introducing efficient parallelism into approximate string matching and a new serial algorithm. In: Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 220\u2013230 (1986)","DOI":"10.1145\/12130.12152"},{"issue":"2","key":"39_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G Landau","year":"1989","unstructured":"Landau, G., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms 10(2), 157\u2013169 (1989)","journal-title":"J. Algorithms"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Liu, Y., et al.: Parallel algorithms for approximate string matching with $$k$$ mismatches on CUDA. In: Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, pp. 2414\u20132422 (2012)","DOI":"10.1109\/IPDPSW.2012.298"},{"key":"39_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/9780470253441","volume-title":"Bioinformatics Algorithms: Techniques and Applications","author":"I Mandoiu","year":"2008","unstructured":"Mandoiu, I., Zelikovsky, A.: Bioinformatics Algorithms: Techniques and Applications. Wiley, Hoboken (2008)"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Nakano, K.: Efficient implementations of the approximate string matching on the memory machine models. In: Proceedings of the International Conference on Networking and Computing, pp. 233\u2013239 (2012)","DOI":"10.1109\/ICNC.2012.43"},{"key":"39_CR9","unstructured":"NCBI: National Center for Biotechnology Information. https:\/\/www.ncbi.nlm.nih.gov"},{"key":"39_CR10","unstructured":"NVIDIA Corporation: CUDA Parallel Computing Platform. http:\/\/www.nvidia.com.br\/object\/cuda_home_new_br.html"},{"key":"39_CR11","unstructured":"OpenMP Architecture Review Board: OpenMP Application Programming Interface Version 4.5. http:\/\/www.openmp.org\/mp-documents\/openmp-4.5.pdf"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Rastogi, P., Guddeti, R.: GPU accelerated inexact matching for multiple patterns in DNA sequences. In: Proceedings of the International Conference on Advances in Computing, Communications and Informatics, pp. 163\u2013167 (2014)","DOI":"10.1109\/ICACCI.2014.6968404"},{"key":"39_CR13","unstructured":"Utan, Y., et al.: A GPGPU implementation of approximate string matching with regular expression operators and comparison with its FPGA implementation. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 1\u20137 (2012)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93698-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:07:16Z","timestamp":1654906036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93698-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319936970","9783319936987"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93698-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuxi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"406","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":"148","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":"60","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":"36% - 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":"3","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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Acceptance rate in the Main Track is 28%. Acceptance rate in the workshops is 43%.  A high acceptance rate in the workshops is explained by the nature of these thematic sessions, where many experts in a particular field are personally invited by workshop organisers to participate in their sessions.","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"}]}}