{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:22:44Z","timestamp":1743132164925,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030657741"},{"type":"electronic","value":"9783030657758"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-65775-8_2","type":"book-chapter","created":{"date-parts":[[2020,12,19]],"date-time":"2020-12-19T15:02:57Z","timestamp":1608390177000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Redundancy Treatment of NGS Contigs in Microbial Genome Finishing with Hashing-Based Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1621-4460","authenticated-orcid":false,"given":"Marcus","family":"Braga","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3452-9271","authenticated-orcid":false,"given":"Kenny","family":"Pinheiro","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8134-5964","authenticated-orcid":false,"given":"Fabr\u00edcio","family":"Ara\u00fajo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6823-5995","authenticated-orcid":false,"given":"F\u00e1bio","family":"Miranda","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4082-1132","authenticated-orcid":false,"given":"Artur","family":"Silva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8032-1474","authenticated-orcid":false,"given":"Rommel","family":"Ramos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,20]]},"reference":[{"issue":"4","key":"2_CR1","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/s12088-016-0606-4","volume":"56","author":"S Ambardar","year":"2016","unstructured":"Ambardar, S., Gupta, R., Trakroo, D., Lal, R., Vakhlu, J.: High throughput sequencing: an overview of sequencing chemistry. Indian J. Microbiol. 56(4), 394\u2013404 (2016)","journal-title":"Indian J. Microbiol."},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1038\/nrg3367","volume":"14","author":"N Nagarajan","year":"2013","unstructured":"Nagarajan, N., Pop, M.: Sequence assembly demystified. Nat. Rev. Genet. 14(3), 157\u2013167 (2013)","journal-title":"Nat. Rev. Genet."},{"issue":"12","key":"2_CR3","doi-asserted-by":"publisher","first-page":"e1003345","DOI":"10.1371\/journal.pcbi.1003345","volume":"9","author":"S El-Metwally","year":"2013","unstructured":"El-Metwally, S., Hamza, T., Zakaria, M., Helmy, M.: Next-generation sequence assembly: four stages of data processing and computational challenges. PLoS Comput. Biol. 9(12), e1003345 (2013)","journal-title":"PLoS Comput. Biol."},{"issue":"10","key":"2_CR4","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1038\/nrg3068","volume":"12","author":"JA Martin","year":"2011","unstructured":"Martin, J.A., Wang, Z.: Next-generation transcriptome assembly. Nat. Rev. Genet. 12(10), 671\u2013682 (2011)","journal-title":"Nat. Rev. Genet."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Goswami, M., et al.: Distance sensitive bloom filters without false negatives. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201917, USA, 2017, pp. 257\u2013269. Society for Industrial and Applied Mathematics (2017)","DOI":"10.1137\/1.9781611974782.17"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"1396","DOI":"10.3389\/fgene.2019.01396","volume":"10","author":"L Tang","year":"2020","unstructured":"Tang, L., Li, M., Fang-Xiang, W., Pan, Y., Wang, J.: MAC: Merging assemblies by using adjacency algebraic model and classification. Front. Genet. 10, 1396 (2020)","journal-title":"Front. Genet."},{"key":"2_CR7","unstructured":"de Sousa Paz, H.E.: reSHAPE : montagem hibrida de genomas com foco em organismos bacterianos combinando ferramentas de novo. Dissertacao (2018)"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1038\/nrg3117","volume":"13","author":"TJ Treangen","year":"2011","unstructured":"Treangen, T.J., Salzberg, S.L.: Repetitive DNA and next-generation sequencing: computational challenges and solutions. Nat. Rev. Genet. 13(1), 36\u201346 (2011)","journal-title":"Nat. Rev. Genet."},{"issue":"5","key":"2_CR9","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1038\/nrg798","volume":"3","author":"MA Batzer","year":"2002","unstructured":"Batzer, M.A., Deininger, P.L.: Alu repeats and human genomic diversity. Nat. Rev. Genet. 3(5), 370\u2013379 (2002)","journal-title":"Nat. Rev. Genet."},{"issue":"12","key":"2_CR10","doi-asserted-by":"publisher","first-page":"e113862","DOI":"10.1371\/journal.pone.0113862","volume":"9","author":"M Zavodna","year":"2014","unstructured":"Zavodna, M., Bagshaw, A., Brauning, R., Gemmell, N.J.: The accuracy, feasibility and challenges of sequencing short tandem repeats using next-generation sequencing platforms. PLoS ONE 9(12), e113862 (2014)","journal-title":"PLoS ONE"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"R55","DOI":"10.1186\/gb-2008-9-3-r55","volume":"9","author":"AM Phillippy","year":"2008","unstructured":"Phillippy, A.M., Schatz, M.C., Pop, M.: Genome assembly forensics: finding the elusive mis-assembly. Genome Biol. 9(3), R55 (2008)","journal-title":"Genome Biol."},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1186\/1471-2105-12-95","volume":"12","author":"J Wetzel","year":"2011","unstructured":"Wetzel, J., Kingsford, C., Pop, M.: Assessing the benefits of using mate-pairs to resolve repeats in de novo short-read prokaryotic assemblies. BMC Bioinform. 12(1), 95 (2011)","journal-title":"BMC Bioinform."},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1186\/2047-217X-2-10","volume":"2","author":"KR Bradnam","year":"2013","unstructured":"Bradnam, K.R., et al.: Assemblathon 2: evaluating de novo methods of genome assembly in three vertebrate species. GigaScience 2(1), 2047\u2013217X (2013)","journal-title":"GigaScience"},{"issue":"7","key":"2_CR14","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1089\/cmb.2009.0005","volume":"16","author":"N Nagarajan","year":"2009","unstructured":"Nagarajan, N., Pop, M.: Parametric complexity of sequence assembly: theory and applications to next generation sequencing. J. Comput. Biol. 16(7), 897\u2013908 (2009)","journal-title":"J. Comput. Biol."},{"issue":"20","key":"2_CR15","doi-asserted-by":"publisher","first-page":"996","DOI":"10.6026\/97320630008996","volume":"8","author":"RTJ Ramos","year":"2012","unstructured":"Ramos, R.T.J., Carneiro, A.R., Azevedo, V., Schneider, M.P., Barh, D., Silva, A.: Simplifier: a web tool to eliminate redundant NGS contigs. Bioinformation 8(20), 996\u2013999 (2012)","journal-title":"Bioinformation"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0885-064X(88)90008-8","volume":"4","author":"Z Galil","year":"1988","unstructured":"Galil, Z., Giancarlo, R.: Data structures and algorithms for approximate string matching. J. Complex. 4(1), 33\u201372 (1988)","journal-title":"J. Complex."},{"key":"2_CR17","unstructured":"Pandiselvam, P., Marimuthu, T., Lawrance, R.: A comparative study on string matching algorithm of biological sequences (2014)"},{"key":"2_CR18","first-page":"144","volume":"4","author":"K Al-Khamaiseh","year":"2014","unstructured":"Al-Khamaiseh, K., ALShagarin, S.: A survey of string matching algorithms. Int. J. Eng. Res. Appl. 4, 144\u2013156 (2014)","journal-title":"Int. J. Eng. Res. Appl."},{"key":"2_CR19","unstructured":"Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: a survey (2014)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Chauhan, S.S., Batra, S.: Finding similar items using lsh and bloom filter. In: 2014 IEEE International Conference on Advanced Communications, Control and Computing Technologies, pp. 1662\u20131666 (2014)","DOI":"10.1109\/ICACCCT.2014.7019390"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.14778\/2350229.2350275","volume":"5","author":"MA Bender","year":"2012","unstructured":"Bender, M.A., et al.: Don\u2019t thrash: how to cache your hash on flash. Proc. VLDB Endow. 5, 1627\u20131637 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1109\/MSP.2007.914237","volume":"25","author":"M Slaney","year":"2008","unstructured":"Slaney, M., Casey, M.: Locality-sensitive hashing for finding nearest neighbors [lecture notes]. Signal Process. Mag. IEEE 25, 128\u2013131 (2008)","journal-title":"Signal Process. Mag. IEEE"},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/s10618-008-0096-z","volume":"17","author":"S Baluja","year":"2008","unstructured":"Baluja, S., Covell, M.: Learning to hash: forgiving hash functions and applications. Data Min. Knowl. Disc. 17(3), 402\u2013430 (2008)","journal-title":"Data Min. Knowl. Disc."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 604\u2013613 (2000)","DOI":"10.1145\/276698.276876"},{"key":"2_CR25","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Proceedings of the Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), pp. 21\u201329 (1997)"},{"key":"2_CR26","first-page":"23","volume":"142","author":"R Jain","year":"2016","unstructured":"Jain, R., Rawat, M., Jain, S.: Data optimization techniques using bloom filter in big data. Int. J. Comput. Appl. 142, 23\u201327 (2016)","journal-title":"Int. J. Comput. Appl."},{"issue":"7","key":"2_CR27","doi-asserted-by":"publisher","first-page":"e1002195","DOI":"10.1371\/journal.pbio.1002195","volume":"13","author":"ZD Stephens","year":"2015","unstructured":"Stephens, Z.D., et al.: Big data: astronomical or genomical? PLoS Biol. 13(7), e1002195 (2015)","journal-title":"PLoS Biol."},{"issue":"1","key":"2_CR28","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"issue":"1","key":"2_CR29","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/TNNLS.2016.2615085","volume":"29","author":"K Ding","year":"2018","unstructured":"Ding, K., Huo, C., Fan, B., Xiang, S., Pan, C.: In defense of locality-sensitive hashing. IEEE Trans. Neural Netw. Learn. Syst. 29(1), 87\u2013103 (2018)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"7","key":"2_CR30","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"2_CR31","first-page":"11","volume":"1","author":"A Broder","year":"2003","unstructured":"Broder, A., Mitzenmacher, M.: Survey: Network applications of bloom filters: a survey. Internet Math. 1, 11 (2003)","journal-title":"Internet Math."},{"issue":"4","key":"2_CR32","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/s00453-015-0007-9","volume":"73","author":"M Naor","year":"2015","unstructured":"Naor, M., Yogev, E.: Tight bounds for sliding bloom filters. Algorithmica 73(4), 652\u2013672 (2015)","journal-title":"Algorithmica"},{"issue":"14","key":"2_CR33","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1093\/bioinformatics\/btt273","volume":"29","author":"T Magoc","year":"2013","unstructured":"Magoc, T., et al.: GAGE-B: an evaluation of genome assemblers for bacterial organisms. Bioinformatics 29(14), 1718\u20131725 (2013)","journal-title":"Bioinformatics"},{"issue":"1","key":"2_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2174\/1875036201307010001","volume":"7","author":"E Aronesty","year":"2013","unstructured":"Aronesty, E.: Comparison of sequencing utility programs. Open Bioinform. J. 7(1), 1\u20138 (2013)","journal-title":"Open Bioinform. J."},{"issue":"5","key":"2_CR35","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1089\/cmb.2012.0021","volume":"19","author":"A Bankevich","year":"2012","unstructured":"Bankevich, A., et al.: SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing. J. Comput. Biol. 19(5), 455\u2013477 (2012)","journal-title":"J. Comput. Biol."},{"issue":"14","key":"2_CR36","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1093\/bioinformatics\/bts280","volume":"28","author":"H Li","year":"2012","unstructured":"Li, H.: Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly. Bioinformatics (Oxford, England) 28(14), 1838\u20131844 (2012)","journal-title":"Bioinformatics (Oxford, England)"},{"issue":"1","key":"2_CR37","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1093\/bioinformatics\/btt310","volume":"30","author":"R Chikhi","year":"2013","unstructured":"Chikhi, R., Medvedev, P.: Informed and automated k-mer size selection for genome assembly. Bioinformatics 30(1), 31\u201337 (2013)","journal-title":"Bioinformatics"},{"issue":"8","key":"2_CR38","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1093\/bioinformatics\/btt086","volume":"29","author":"A Gurevich","year":"2013","unstructured":"Gurevich, A., Saveliev, V., Vyahhi, N., Tesler, G.: QUAST: quality assessment tool for genome assemblies. Bioinformatics 29(8), 1072\u20131075 (2013)","journal-title":"Bioinformatics"},{"key":"2_CR39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924801","volume-title":"Mining of Massive Datasets","author":"J Leskovec","year":"2014","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets. Cambridge University Press, Cambridge (2014)"},{"issue":"16","key":"2_CR40","doi-asserted-by":"publisher","first-page":"7762","DOI":"10.1093\/nar\/gkv784","volume":"43","author":"Y Chen","year":"2015","unstructured":"Chen, Y., Ye, W., Zhang, Y., Yuesheng, X.: High speed BLASTN: an accelerated MegaBLAST search tool. Nucleic Acids Res. 43(16), 7762\u20137768 (2015)","journal-title":"Nucleic Acids Res."},{"issue":"13","key":"2_CR41","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"}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65775-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T15:41:17Z","timestamp":1724082077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-65775-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030657741","9783030657758"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65775-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BSB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Bioinformatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wob2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bsb.sbc.org.br\/2020\/","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":"45","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":"20","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":"44% - 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":"2.5","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":"Due to COVID-19 pandemic the conference was held virtually","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)"}}]}}