{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:05:44Z","timestamp":1748664344646,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662482209"},{"type":"electronic","value":"9783662482216"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48221-6_15","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T14:14:31Z","timestamp":1440684871000},"page":"203-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Circular Sequence Comparison with q-grams"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Grossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Merca\u015f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Pisanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmad","family":"Retha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatima","family":"Vayani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"key":"15_CR1","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, Heidelberg (2015)"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1093\/nar\/28.1.15","volume":"28","author":"DA Benson","year":"2000","unstructured":"Benson, D.A., Karsch-Mizrachi, I., Lipman, D.J., Ostell, J., Rapp, B.A., Wheeler, D.L.: GenBank. Nucleic Acids Res. 28(1), 15\u201318 (2000)","journal-title":"Nucleic Acids Res."},{"issue":"4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1101\/gr.1960404","volume":"14","author":"N Bray","year":"2004","unstructured":"Bray, N., Pachter, L.: MAVID: constrained ancestral alignment of multiple sequences. Genome Res. 14(4), 693\u2013699 (2004)","journal-title":"Genome Res."},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1186\/1471-2105-5-96","volume":"5","author":"R Brodie","year":"2004","unstructured":"Brodie, R., Smith, A.J., Roper, R.L., Tcherepanov, V., Upton, C.: Base-By-Base: single nucleotide-level analysis of whole viral genome alignments. BMC Bioinform. 5(1), 96 (2004)","journal-title":"BMC Bioinform."},{"issue":"12","key":"15_CR5","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., Buhler, U.: Applications of approximate string matching to 2D shape recognition. Pattern Recogn. 26(12), 1797\u20131812 (1993)","journal-title":"Pattern Recogn."},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1142\/S0129054112400175","volume":"23","author":"P Burcsi","year":"2012","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Z.: Algorithms for jumbled pattern matching in strings. Int. J. Found Comput. Sci. 23(2), 357\u2013374 (2012)","journal-title":"Int. J. Found Comput. Sci."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H.P., Rivals, E., Vingron, M.: $$q$$-gram based database searching using a suffix array (QUASAR). In: 3rd RECOMB, pp. 77\u201383 (1999)","DOI":"10.1145\/299432.299460"},{"issue":"1","key":"15_CR8","first-page":"75","volume":"13","author":"KM Chao","year":"1997","unstructured":"Chao, K.M., Zhang, J., Ostell, J., Miller, W.: A tool for aligning very similar DNA sequences. CABIOS 13(1), 75\u201380 (1997)","journal-title":"CABIOS"},{"issue":"6","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1111\/j.1365-313X.2007.03394.x","volume":"53","author":"S Cohen","year":"2008","unstructured":"Cohen, S., Houben, A., Segal, D.: Extrachromosomal circular DNA derived from tandemly repeated genomic sequences in plants. Plant J. 53(6), 1027\u20131034 (2008)","journal-title":"Plant J."},{"issue":"32","key":"15_CR10","doi-asserted-by":"publisher","first-page":"26999","DOI":"10.1074\/jbc.R112.390344","volume":"287","author":"DJ Craik","year":"2012","unstructured":"Craik, D.J., Allewell, N.M.: Thematic minireview series on circular proteins. J. Biol. Chem. 287(32), 26999\u201327000 (2012)","journal-title":"J. Biol. Chem."},{"key":"15_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, New York (2007)"},{"issue":"1","key":"15_CR12","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.I., 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":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/978-3-319-09698-8_16","volume-title":"Developments in Language Theory","author":"T Ehlers","year":"2014","unstructured":"Ehlers, T., Manea, F., Merca\u015f, R., Nowotka, D.: k-Abelian pattern matching. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 178\u2013190. Springer, Heidelberg (2014)"},{"issue":"1","key":"15_CR14","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.T.: CSA: an efficient algorithm to improve circular DNA multiple alignment. BMC Bioinform. 10(1), 1\u201313 (2009)","journal-title":"BMC Bioinform."},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-22300-6_32","volume-title":"Algorithms and Data Structures","author":"J Fischer","year":"2011","unstructured":"Fischer, J.: Inducing the LCP-array. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 374\u2013385. Springer, Heidelberg (2011)"},{"issue":"8","key":"15_CR16","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1093\/molbev\/msp098","volume":"26","author":"W Fletcher","year":"2009","unstructured":"Fletcher, W., Yang, Z.: INDELible: a flexible simulator of biological sequence evolution. Mol. Biol. Evol. 26(8), 1879\u20131888 (2009)","journal-title":"Mol. Biol. Evol."},{"issue":"3","key":"15_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1101\/gr.5941007","volume":"17","author":"A Goios","year":"2007","unstructured":"Goios, A., Pereira, L., Bogue, M., Macaulay, V., Amorim, A.: mtDNA phylogeny and evolution of laboratory mouse strains. Genome Res. 17(3), 293\u2013298 (2007)","journal-title":"Genome Res."},{"issue":"3","key":"15_CR18","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O Gotoh","year":"1982","unstructured":"Gotoh, O.: An improved algorithm for matching biological sequences. J. Mol. Biol. 162(3), 705\u2013708 (1982)","journal-title":"J. Mol. Biol."},{"issue":"1","key":"15_CR19","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.B.: Circular DNA. Annu. Rev. Biochem. 40(1), 899\u2013942 (1971)","journal-title":"Annu. Rev. Biochem."},{"key":"15_CR20","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":"2","key":"15_CR21","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. IPL 35(2), 73\u201378 (1990)","journal-title":"IPL"},{"issue":"5","key":"15_CR22","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Marzal, A., Barrachina, S.: Speeding up the computation of the edit distance for cyclic strings. In: 15th ICPR, vol. 2, pp. 891\u2013894 (2000)","DOI":"10.1109\/ICPR.2000.906217"},{"key":"15_CR24","unstructured":"Mosig, A., Hofacker, I.L., Stadler, P.F.: Comparative analysis of cyclic sequences: viroids and other small circular RNAs. In: GCB. LNI, vol. 83, pp. 93\u2013102. GI (2006)"},{"issue":"3","key":"15_CR25","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48(3), 443\u2013453 (1970)","journal-title":"J. Mol. Biol."},{"issue":"3","key":"15_CR26","first-page":"1","volume":"4","author":"P Peterlongo","year":"2009","unstructured":"Peterlongo, P., Sacomoto, G.T., do Lago, A.P., Pisanti, N., Sagot, M.F.: Lossless filter for multiple repeats with bounded edit distance. Algorithm Mol. Biol. 4(3), 1\u201320 (2009)","journal-title":"Algorithm Mol. Biol."},{"issue":"3","key":"15_CR27","first-page":"497","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. JDA 6(3), 497\u2013509 (2008)","journal-title":"JDA"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Pisanti, N., Giraud, M., Peterlongo, P.: Filters and seeds approaches for fast homology searches in large datasets. In: Elloumi, M., Zomaya, A.Y. (eds.) Algorithms in computational molecular biology, chap. 15, pp. 299\u2013320. John Wiley & sons (2010)","DOI":"10.1002\/9780470892107.ch15"},{"issue":"5","key":"15_CR29","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0968-0004(00)89003-9","volume":"20","author":"CP Ponting","year":"1995","unstructured":"Ponting, C.P., Russell, R.B.: Swaposins: circular permutations within genes encoding saposin homologues. Trends Biochem. Sci. 20(5), 179\u2013180 (1995)","journal-title":"Trends Biochem. Sci."},{"issue":"2","key":"15_CR30","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1089\/cmb.2006.13.296","volume":"13","author":"K Rasmussen","year":"2006","unstructured":"Rasmussen, K., Stoye, J., Myers, E.: Efficient $$q$$-gram filters for finding all epsilon-matches over a given length. J. Comput. Biol. 13(2), 296\u2013308 (2006)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"15_CR31","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/S0168-9525(00)02024-2","volume":"16","author":"P Rice","year":"2000","unstructured":"Rice, P., Longden, I., Bleasby, A.: EMBOSS: the european molecular biology open software suite. Trends Genet. 16(6), 276\u2013277 (2000)","journal-title":"Trends Genet."},{"issue":"1","key":"15_CR32","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":"9","key":"15_CR33","doi-asserted-by":"publisher","first-page":"e110685","DOI":"10.1371\/journal.pone.0110685","volume":"10","author":"Z Wang","year":"2014","unstructured":"Wang, Z., Wu, M.: Phylogenomic reconstruction indicates mitochondrial ancestor was an energy parasite. PLoS ONE 10(9), e110685 (2014)","journal-title":"PLoS ONE"},{"issue":"4","key":"15_CR34","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1093\/molbev\/msj091","volume":"23","author":"J Weiner","year":"2006","unstructured":"Weiner, J., Bornberg-Bauer, E.: Evolution of circular permutations in multidomain proteins. Mol. Biol. Evol. 23(4), 734\u2013743 (2006)","journal-title":"Mol. Biol. Evol."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48221-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T05:56:46Z","timestamp":1748584606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48221-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662482209","9783662482216"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48221-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}