{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T04:40:06Z","timestamp":1751258406591,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319751719"},{"type":"electronic","value":"9783319751726"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-75172-6_16","type":"book-chapter","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:23:02Z","timestamp":1517311382000},"page":"183-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison"],"prefix":"10.1007","author":[{"given":"Md. Aashikur Rahman","family":"Azim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohimenul","family":"Kabir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/s13015-016-0076-6","volume":"11","author":"R Grossi","year":"2016","unstructured":"Grossi, R., Iliopoulos, C.S., Mercas, R., Pisanti, N., Pissis, S.P., Retha, A., Vayani, F.: Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11(1), 12 (2016)","journal-title":"Algorithms Mol. Biol."},{"issue":"5","key":"16_CR2","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1073\/pnas.50.2.236","volume":"50","author":"R Dulbecco","year":"1963","unstructured":"Dulbecco, R., Vogt, M.: Evidence for a ring structure of polyoma virus DNA. Proc. Natl. Acad. Sci. 50(2), 236\u2013243 (1963)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"16_CR4","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1073\/pnas.50.4.730","volume":"50","author":"R Weil","year":"1963","unstructured":"Weil, R., Vinograd, J.: The cyclic helix and cyclic coil forms of polyoma viral DNA. Proc. Natl. Acad. Sci. 50(4), 730\u2013738 (1963)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1002\/jcb.20519","volume":"96","author":"M Thanbichler","year":"2005","unstructured":"Thanbichler, M., Wang, S., Shapiro, L.: The bacterial nucleoid: A highly organized and dynamic structure. J. Cell Biochem. 96(3), 506\u2013521 (2005)","journal-title":"J. Cell Biochem."},{"key":"16_CR6","volume-title":"Plasmids: Current Research and Future Trends","author":"G Lipps","year":"2008","unstructured":"Lipps, G.: Plasmids: Current Research and Future Trends. Caister Academic Press, Norfolk (2008)"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1038\/nrg1504","volume":"6","author":"T Allers","year":"2005","unstructured":"Allers, T., Mevarech, M.: Archaeal genetics - the third way. Nat. Rev. Genet. 6, 58\u201373 (2005)","journal-title":"Nat. Rev. Genet."},{"key":"16_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, New York (1997)"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1128\/AAC.01239-12","volume":"57","author":"CS Del Castillo","year":"2013","unstructured":"Del Castillo, C.S., Hikima, J., Jang, H.B., Nho, S.W., Jung, T.S., Wongtavatchai, J., Kondo, H., Hirono, I., Takeyama, H., Aoki, T.: Comparative sequence analysis of a multidrug-resistant plasmid from aeromonas hydrophila. Antimicrob. Agents Chemother. 57(1), 120\u2013129 (2013)","journal-title":"Antimicrob. Agents Chemother."},{"key":"16_CR10","unstructured":"Mosig, A., Hofacker, I., Stadler, P., Zell, A.: Comparative analysis of cyclic sequences: viroids and other small circular RNAs. German Conference on Bioinformatics. LNI, vol. 83, pp. 93\u2013102 (2006)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-10-230","volume":"10","author":"F Fernandes","year":"2009","unstructured":"Fernandes, F., Pereira, L., Freitas, A.: CSA: an efficient algorithm to improve circular DNA multiple alignment. BMC Bioinform. 10, 1\u201313 (2009)","journal-title":"BMC Bioinform."},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-13509-5_28","volume-title":"Combinatorial Pattern Matching","author":"T Lee","year":"2010","unstructured":"Lee, T., Na, J.C., Park, H., Park, K., Sim, J.S.: Finding optimal alignment and consensus of circular strings. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 310\u2013322. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13509-5_28"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Azim, M.A.R., Iliopoulos, C.S., Rahman, M.S., Samiruzzaman, M.: SimpLiFiCPM: a simple and lightweight filter-based algorithm for circular pattern matching. Int. J. Genomics 2015, 10 (2015). Article ID 259320","DOI":"10.1155\/2015\/259320"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Azim, M.A.R., Iliopoulos, C.S., Rahman, M.S., Samiruzzaman, M.: A fast and lightweight filter-based algorithm for circular pattern matching. In: ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (2014)","DOI":"10.1145\/2649387.2660804"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Approximate string-matching with q-grams and maximal matches. Theor. Comput. Sci. 92(1), 191\u2013211 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1146\/annurev.bi.40.070171.004343","volume":"40","author":"DR Helinski","year":"1971","unstructured":"Helinski, D.R., Clewell, D.: Circular DNA. Annu. Rev. Biochem. 40(1), 899\u2013942 (1971)","journal-title":"Annu. Rev. Biochem."},{"issue":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/1748-7188-4-3","volume":"4","author":"P Peterlongo","year":"2009","unstructured":"Peterlongo, P., Sacomoto, G.A.T., do Lago, A.P., Pisanti, N., Sagot, M.-F.: Lossless filter for multiple repeats with bounded edit distance. Algorithms Mol. Biol. 4(1), 3 (2009)","journal-title":"Algorithms Mol. Biol."},{"issue":"2","key":"16_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(90)90109-B","volume":"35","author":"M Maes","year":"1990","unstructured":"Maes, M.: On a cyclic string-to-string correction problem. Inf. Process. Lett. 35(2), 73\u201378 (1990)","journal-title":"Inf. Process. Lett."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Ayad, L.A., Barton, C., Pissis, S.P.: A faster and more accurate heuristic for cyclic edit distance computation. Pattern Recogn. Lett. 88(Suppl. C), 81\u201387 (2017)","DOI":"10.1016\/j.patrec.2017.01.018"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Marzal, A., Barrachina, S.: Speeding up the computation of the edit distance for cyclic strings. In: Proceedings of the 15th International Conference on Pattern Recognition, vol. 2, pp. 891\u2013894 (2000)","DOI":"10.1109\/ICPR.2000.906217"},{"issue":"12","key":"16_CR21","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1016\/0031-3203(93)90177-X","volume":"26","author":"H Bunke","year":"1993","unstructured":"Bunke, H., Bhler, U.: Applications of approximate string matching to 2D shape recognition. Pattern Recogn. 26(12), 1797\u20131812 (1993)","journal-title":"Pattern Recogn."},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-20086-6_19","volume-title":"Experimental Algorithms","author":"C Barton","year":"2015","unstructured":"Barton, C., Iliopoulos, C.S., Kundu, R., Pissis, S.P., Retha, A., Vayani, F.: Accurate and efficient methods to improve multiple circular sequence alignment. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 247\u2013258. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20086-6_19"},{"issue":"1","key":"16_CR23","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1186\/s12864-016-3477-5","volume":"18","author":"LAK Ayad","year":"2017","unstructured":"Ayad, L.A.K., Pissis, S.P.: MARS: improving multiple circular sequence alignment using refined sequences. BMC Genomics 18(1), 86 (2017)","journal-title":"BMC Genomics"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.tcs.2012.11.018","volume":"468","author":"T Lee","year":"2013","unstructured":"Lee, T., Na, J.C., Park, H., Park, K., Sim, J.S.: Finding consensus and optimal alignment of circular strings. Theor. Comput. Sci. 468, 92\u2013101 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"16_CR25","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.jda.2007.03.003","volume":"6","author":"P Peterlongo","year":"2008","unstructured":"Peterlongo, P., Pisanti, N., Boyer, F., do Lago, A.P., Sagot, M.F.: Lossless filter for multiple repetitions with hamming distance. J. Discrete Algorithms 6(3), 497\u2013509 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"16_CR26","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1089\/cmb.2006.13.296","volume":"13","author":"KR Rasmussen","year":"2006","unstructured":"Rasmussen, K.R., Stoye, J., Myers, E.W.: Efficient q-gram filters for finding all $$\\varepsilon $$-matches over a given length. J. Comput. Biol. 13(2), 296\u2013308 (2006)","journal-title":"J. Comput. Biol."},{"key":"16_CR27","unstructured":"https:\/\/github.com\/solonas13\/csc"},{"key":"16_CR28","unstructured":"http:\/\/hgdownload-test.cse.ucsc.edu\/goldenPath\/hg19\/bigZips\/"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75172-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T04:22:50Z","timestamp":1751257370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75172-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319751719","9783319751726"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75172-6_16","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":"31 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dhaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","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":"3 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cse.buet.ac.bd\/walcom2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}