{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T12:58:45Z","timestamp":1752670725634,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030914141"},{"type":"electronic","value":"9783030914158"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-91415-8_50","type":"book-chapter","created":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T18:04:03Z","timestamp":1637172243000},"page":"596-607","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Greedy Incremental Sequence Clustering Algorithm"],"prefix":"10.1007","author":[{"given":"Zhen","family":"Ju","sequence":"first","affiliation":[]},{"given":"Huiling","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jingtao","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Jingjing","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xuelei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jianping","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Weiguo","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yanjie","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,18]]},"reference":[{"issue":"1","key":"50_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-018-2565-8","volume":"20","author":"N Ahmed","year":"2019","unstructured":"Ahmed, N., L\u00e9vy, J., Ren, S., Mushtaq, H., Bertels, K., Al-Ars, Z.: Gasal2: a GPU accelerated sequence alignment library for high-throughput NGS data. BMC Bioinf. 20(1), 1\u201320 (2019)","journal-title":"BMC Bioinf."},{"issue":"21","key":"50_CR2","doi-asserted-by":"publisher","first-page":"4255","DOI":"10.1093\/bioinformatics\/btz234","volume":"35","author":"M Alser","year":"2019","unstructured":"Alser, M., Hassan, H., Kumar, A., Mutlu, O., Alkan, C.: Shouji: a fast and efficient pre-alignment filter for sequence alignment. Bioinformatics 35(21), 4255\u20134263 (2019)","journal-title":"Bioinformatics"},{"issue":"5","key":"50_CR3","doi-asserted-by":"publisher","first-page":"479","DOI":"10.2174\/1574893612666171122150933","volume":"13","author":"Y Chan","year":"2018","unstructured":"Chan, Y., Xu, K., Lan, H., Schmidt, B., Peng, S., Liu, W.: Myphi: efficient levenshtein distance computation on xeon phi based architectures. Current Bioinf. 13(5), 479\u2013486 (2018)","journal-title":"Current Bioinf."},{"issue":"19","key":"50_CR4","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"},{"issue":"23","key":"50_CR5","doi-asserted-by":"publisher","first-page":"3150","DOI":"10.1093\/bioinformatics\/bts565","volume":"28","author":"L Fu","year":"2012","unstructured":"Fu, L., Niu, B., Zhu, Z., Wu, S., Li, W.: Cd-hit: accelerated for clustering the next-generation sequencing data. Bioinformatics 28(23), 3150\u20133152 (2012)","journal-title":"Bioinformatics"},{"issue":"5","key":"50_CR6","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1093\/bioinformatics\/14.5.423","volume":"14","author":"L Holm","year":"1998","unstructured":"Holm, L., Sander, C.: Removing near-neighbour redundancy from large protein sequence collections. Bioinf. (Oxford, England) 14(5), 423\u2013429 (1998)","journal-title":"Bioinf. (Oxford, England)"},{"issue":"14","key":"50_CR7","doi-asserted-by":"publisher","first-page":"e83","DOI":"10.1093\/nar\/gky315","volume":"46","author":"BT James","year":"2018","unstructured":"James, B.T., Luczak, B.B., Girgis, H.Z.: Meshclust: an intelligent tool for clustering DNA sequences. Nucleic acids Res. 46(14), e83\u2013e83 (2018)","journal-title":"Nucleic acids Res."},{"issue":"1","key":"50_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1093\/bib\/bbz170","volume":"22","author":"MR Karim","year":"2021","unstructured":"Karim, M.R., et al.: Deep learning-based clustering approaches for bioinformatics. Briefings Bioinf. 22(1), 393\u2013415 (2021)","journal-title":"Briefings Bioinf."},{"issue":"13","key":"50_CR9","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1093\/bioinformatics\/btl158","volume":"22","author":"W Li","year":"2006","unstructured":"Li, W., Godzik, A.: Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences. Bioinformatics 22(13), 1658\u20131659 (2006)","journal-title":"Bioinformatics"},{"issue":"22","key":"50_CR10","doi-asserted-by":"publisher","first-page":"3166","DOI":"10.1093\/bioinformatics\/btu507","volume":"30","author":"J Loving","year":"2014","unstructured":"Loving, J., Hernandez, Y., Benson, G.: Bitpal: a bit-parallel, general integer-scoring sequence alignment algorithm. Bioinformatics 30(22), 3166\u20133173 (2014)","journal-title":"Bioinformatics"},{"key":"50_CR11","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"},{"issue":"1","key":"50_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-018-04964-5","volume":"9","author":"M Steinegger","year":"2018","unstructured":"Steinegger, M., S\u00f6ding, J.: Clustering huge protein sequence sets in linear time. Nat. Commun. 9(1), 1\u20138 (2018)","journal-title":"Nat. Commun."},{"issue":"1","key":"50_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-13-174","volume":"13","author":"D Wei","year":"2012","unstructured":"Wei, D., Jiang, Q., Wei, Y., Wang, S.: A novel hierarchical clustering algorithm for gene sequences. BMC Bioinf. 13(1), 1\u201315 (2012)","journal-title":"BMC Bioinf."},{"issue":"10","key":"50_CR14","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1093\/bioinformatics\/btu856","volume":"31","author":"H Xin","year":"2015","unstructured":"Xin, H., et al.: Shifted hamming distance: a fast and accurate simd-friendly filter to accelerate alignment verification in read mapping. Bioinformatics 31(10), 1553\u20131560 (2015)","journal-title":"Bioinformatics"},{"issue":"1","key":"50_CR15","first-page":"1","volume":"21","author":"Q Zou","year":"2020","unstructured":"Zou, Q., Lin, G., Jiang, X., Liu, X., Zeng, X.: Sequence clustering in bioinformatics: an empirical study. Briefings Bioinf. 21(1), 1\u201310 (2020)","journal-title":"Briefings Bioinf."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91415-8_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T18:11:45Z","timestamp":1637172705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91415-8_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030914141","9783030914158"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91415-8_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISBRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Bioinformatics Research and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isbra2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/alan.cs.gsu.edu\/isbra21\/?q=node\/1","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":"135","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":"51","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":"0","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":"38% - 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.97","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":"2.95","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)"}}]}}