{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:09:29Z","timestamp":1743070169495,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819722402"},{"type":"electronic","value":"9789819722389"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-2238-9_6","type":"book-chapter","created":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T12:01:48Z","timestamp":1714478508000},"page":"72-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Edit Distance Prediction for\u00a0All Pairs of\u00a0Sequences in\u00a0Very Large NGS Datasets"],"prefix":"10.1007","author":[{"given":"A. K. M. Tauhidul","family":"Islam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakti","family":"Pramanik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,1]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Pramanik, S., Islam, A.T., Sural, S.: Predicted edit distance based clustering of gene sequences. In: 2018 IEEE International Conference on Data Mining (ICDM), pp. 1206\u20131211. IEEE (2018)","DOI":"10.1109\/ICDM.2018.00160"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM (JACM) 21(1), 168\u2013173 (1974)","journal-title":"J. ACM (JACM)"},{"key":"6_CR3","unstructured":"Abboud, A., Backurs, A.: Towards hardness of approximation for polynomial time problems. In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"6","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1137\/090767182","volume":"41","author":"A Andoni","year":"2012","unstructured":"Andoni, A., Onak, K.: Approximating edit distance in near-linear time. SIAM J. Comput. 41(6), 1635\u20131648 (2012)","journal-title":"SIAM J. Comput."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Andoni, A., Krauthgamer, R., Onak, K.: Polylogarithmic approximation for edit distance and the asymmetric query complexity. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 377\u2013386. IEEE (2010)","DOI":"10.1109\/FOCS.2010.43"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Backurs, A., Indyk, P.: Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 51\u201358. ACM (2015)","DOI":"10.1145\/2746539.2746612"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Chakraborty, D., Das, D., Goldenberg, E., Koucky, M., Saks, M.: Approximating edit distance within constant factor in truly sub-quadratic time. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 979\u2013990. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00096"},{"issue":"19","key":"6_CR8","doi-asserted-by":"publisher","first-page":"2460","DOI":"10.1093\/bioinformatics\/btq461","volume":"26","author":"RC Edgar","year":"2010","unstructured":"Edgar, R.C.: Search and clustering orders of magnitude faster than blast. Bioinformatics 26(19), 2460\u20132461 (2010)","journal-title":"Bioinformatics"},{"key":"6_CR9","unstructured":"ERX2155923: Inter-comparison of marine plankton metagenome analysis methods (2017)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Islam, A.T., Pramanik, S., Mirjalili, V., Sural, S.: RESTRAC: reference sequence based space transformation for clustering. In: 2017 IEEE International Conference on Data Mining Workshops (ICDMW), pp. 462\u2013469. IEEE (2017)","DOI":"10.1109\/ICDMW.2017.66"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/S0097539794264810","volume":"27","author":"GM Landau","year":"1998","unstructured":"Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM J. Comput. 27(2), 557\u2013582 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"WJ Masek","year":"2013","unstructured":"Masek, W.J., Paterson, M.S.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci. 20(1), 18\u201331 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.procs.2014.05.001","volume":"29","author":"T-D Nguyen","year":"2014","unstructured":"Nguyen, T.-D., Schmidt, B., Kwoh, C.-K.: SparseHC: a memory-efficient online hierarchical clustering algorithm. Procedia Comput. Sci. 29, 8\u201319 (2014)","journal-title":"Procedia Comput. Sci."},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"S11","DOI":"10.1186\/1752-0509-7-S4-S11","volume":"7","author":"Z Rasheed","year":"2013","unstructured":"Rasheed, Z., Rangwala, H., Barbar\u00e1, D.: 16S rRNA metagenome clustering and diversity estimation using locality sensitive hashing. BMC Syst. Biol. 7(4), S11 (2013)","journal-title":"BMC Syst. Biol."},{"key":"6_CR15","doi-asserted-by":"publisher","DOI":"10.7717\/peerj.2584","volume":"4","author":"T Rognes","year":"2016","unstructured":"Rognes, T., Flouri, T., Nichols, B., Quince, C., Mah\u00e9, F.: VSEARCH: a versatile open source tool for metagenomics. PeerJ 4, e2584 (2016)","journal-title":"PeerJ"},{"key":"6_CR16","unstructured":"SRX1537393: 16S rRNA sequencing of Sao Paulo zoo compost (2016)"},{"issue":"14","key":"6_CR17","doi-asserted-by":"publisher","first-page":"i127","DOI":"10.1093\/bioinformatics\/btz354","volume":"35","author":"G Mar\u00e7ais","year":"2019","unstructured":"Mar\u00e7ais, G., DeBlasio, D., Pandey, P., Kingsford, C.: Locality-sensitive hashing for the edit distance. Bioinformatics 35(14), i127\u2013i135 (2019)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2238-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T12:03:43Z","timestamp":1714478623000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2238-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819722402","9789819722389"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2238-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}