{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:31:12Z","timestamp":1743093072024,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200859"},{"type":"electronic","value":"9783319200866"}],"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-319-20086-6_19","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"247-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment"],"prefix":"10.1007","author":[{"given":"Carl","family":"Barton","sequence":"first","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"Ritu","family":"Kundu","sequence":"additional","affiliation":[]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[]},{"given":"Ahmad","family":"Retha","sequence":"additional","affiliation":[]},{"given":"Fatima","family":"Vayani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(96)00083-X","volume":"59","author":"RA Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R.A., Perleberg, C.H.: Fast and practical approximate string matching. Information Processing Letters 59(1), 21\u201327 (1996)","journal-title":"Information Processing Letters"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/1748-7188-9-9","volume":"9","author":"C Barton","year":"2014","unstructured":"Barton, C., Iliopoulos, C.S., Pissis, S.P.: Fast algorithms for approximate circular string matching. Algorithms for Molecular Biology 9(1), 9 (2014)","journal-title":"Algorithms for Molecular Biology"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-319-15579-1_6","volume-title":"Language and Automata Theory and Applications","author":"C Barton","year":"2015","unstructured":"Barton, C., Iliopoulos, C.S., Pissis, S.P.: Average-case optimal approximate circular string matching. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 85\u201396. Springer, Heidelberg (2015)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-12476-1_6","volume-title":"Algorithms and Applications","author":"M Crochemore","year":"2010","unstructured":"Crochemore, M., Iliopoulos, C.S., Pissis, S.P.: A parallel algorithm for fixed-length approximate string-matching with k-mismatches. In: Elomaa, T., Mannila, H., Orponen, P. (eds.) Ukkonen Festschrift 2010. LNCS, vol. 6060, pp. 92\u2013101. Springer, Heidelberg (2010)"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ipl.2005.11.019","volume":"98","author":"S Dori","year":"2006","unstructured":"Dori, S., Landau, G.M.: Construction of Aho Corasick automaton in linear time for integer alphabets. Information Processing Letters 98(2), 66\u201372 (2006)","journal-title":"Information Processing Letters"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1186\/1471-2105-5-113","volume":"5","author":"RC Edgar","year":"2004","unstructured":"Edgar, R.C.: MUSCLE: a multiple sequence alignment method with reduced time and space complexity. BMC Bioinformatics 5(1), 113 (2004)","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"19_CR7","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 Bioinformatics 10(1), 1\u201313 (2009)","journal-title":"BMC Bioinformatics"},{"issue":"8","key":"19_CR8","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. Molecular Biology and Evolution 26(8), 1879\u20131888 (2009)","journal-title":"Molecular Biology and Evolution"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.jtbi.2005.10.010","volume":"240","author":"G Fritzsch","year":"2006","unstructured":"Fritzsch, G., Schlegel, M., Stadler, P.F.: Alignments of mitochondrial genome arrangements: Applications to metazoan phylogeny. Journal of Theoretical Biology 240(4), 511\u2013520 (2006)","journal-title":"Journal of Theoretical Biology"},{"issue":"3","key":"19_CR10","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 Research 17(3), 293\u2013298 (2007)","journal-title":"Genome Research"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/978-3-319-07959-2_27","volume-title":"Experimental Algorithms","author":"T Hirvola","year":"2014","unstructured":"Hirvola, T., Tarhio, J.: Approximate online matching of circular strings. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 315\u2013325. Springer, Heidelberg (2014)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-44688-5_2","volume-title":"Algorithm Engineering","author":"CS Iliopoulos","year":"2001","unstructured":"Iliopoulos, C.S., Mouchard, L., Pinzon, Y.J.: The max-shift algorithm for approximate string matching. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol. 2141, pp. 13\u201325. Springer, Heidelberg (2001)"},{"issue":"14","key":"19_CR13","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1093\/nar\/gkf436","volume":"30","author":"K Katoh","year":"2002","unstructured":"Katoh, K., Misawa, K., Kuma, K.I., Miyata, T.: MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Research 30(14), 3059\u20133066 (2002)","journal-title":"Nucleic Acids Research"},{"doi-asserted-by":"crossref","unstructured":"Larkin, M., Blackshields, G., Brown, N., Chenna, R., McGettigan, P., McWilliam, H., Valentin, F., Wallace, I., Wilm, A., Lopez, R., Thompson, J., Gibson, T., Higgins, D.: Clustal W and Clustal X version 2.0 23(21), 2947\u20132948 (2007)","key":"19_CR14","DOI":"10.1093\/bioinformatics\/btm404"},{"unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Tech. Rep. 8 (1966)","key":"19_CR15"},{"issue":"2","key":"19_CR16","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. Information Processing Letters 35(2), 73\u201378 (1990)","journal-title":"Information Processing Letters"},{"unstructured":"Mosig, A., Hofacker, I.L., Stadler, P.F.: Comparative analysis of cyclic sequences: viroids and other small circular RNAs. In: Huson, D.H., Kohlbacher, O., Lupas, A.N., Nieselt, K., Zell, A. (eds.) German Conference on Bioinformatics. LNI, vol. 83, pp. 93\u2013102. GI (2006)","key":"19_CR17"},{"issue":"3","key":"19_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"G Myers","year":"1999","unstructured":"Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of ACM 46(3), 395\u2013415 (1999)","journal-title":"Journal of ACM"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jmbi.2000.4042","volume":"302","author":"C Notredame","year":"2000","unstructured":"Notredame, C., Higgins, D.G., Heringa, J.: T-Coffee: a novel method for fast and accurate multiple sequence alignment. Journal of Molecular Biology 302(1), 205\u2013217 (2000)","journal-title":"Journal of Molecular Biology"},{"issue":"6","key":"19_CR20","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 in Genetics 16(6), 276\u2013277 (2000)","journal-title":"Trends in Genetics"},{"issue":"1\u20132","key":"19_CR21","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D Robinson","year":"1981","unstructured":"Robinson, D., Foulds, L.: Comparison of phylogenetic trees. Mathematical Biosciences 53(1\u20132), 131\u2013147 (1981)","journal-title":"Mathematical Biosciences"},{"key":"19_CR22","first-page":"1409","volume":"28","author":"RR Sokal","year":"1958","unstructured":"Sokal, R.R., Michener, C.D.: A statistical method for evaluating systematic relationships. University of Kansas Scientific Bulletin 28, 1409\u20131438 (1958)","journal-title":"University of Kansas Scientific Bulletin"},{"issue":"9","key":"19_CR23","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1093\/bioinformatics\/btu033","volume":"30","author":"A Stamatakis","year":"2014","unstructured":"Stamatakis, A.: Raxml version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics 30(9), 1312\u20131313 (2014)","journal-title":"Bioinformatics"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/3-540-12689-9_129","volume-title":"Foundations of Computation Theory","author":"E Ukkonen","year":"1983","unstructured":"Ukkonen, E.: On approximate string matching. In: Karpinski, M. (ed.) Foundations of Computation Theory. Lecture Notes in Computer Science, vol. 158, pp. 487\u2013495. Springer, Berlin Heidelberg (1983)"},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"issue":"4","key":"19_CR26","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1089\/cmb.1994.1.337","volume":"1","author":"L Wang","year":"1994","unstructured":"Wang, L., Jiang, T.: On the complexity of multiple sequence alignment. Journal of Computational Biology 1(4), 337\u2013348 (1994)","journal-title":"Journal of Computational Biology"},{"issue":"9","key":"19_CR27","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"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:18:30Z","timestamp":1674227910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_19","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":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}