{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:32Z","timestamp":1725550052621},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_28","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T10:08:27Z","timestamp":1129802907000},"page":"348-359","source":"Crossref","is-referenced-by-count":2,"title":["A New Combinatorial Approach to Sequence Comparison"],"prefix":"10.1007","author":[{"given":"S.","family":"Mantaci","sequence":"first","affiliation":[]},{"given":"A.","family":"Restivo","sequence":"additional","affiliation":[]},{"given":"G.","family":"Rosone","sequence":"additional","affiliation":[]},{"given":"M.","family":"Sciortino","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Benedetto, D., Caglioti, E., Loreto, V.: Zipping out relevant information. Computing in Science and Engineering, 80\u201385 (2003)","DOI":"10.1109\/MCISE.2003.1166556"},{"key":"28_CR2","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting data compression algorithm. Technical report, DIGITAL System Research Center (1994)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/PL00006389","volume":"47","author":"Y. Cao","year":"1998","unstructured":"Cao, Y., Janke, A., Waddell, P.J., Westerman, M., Takenaka, O., Murata, S., Okada, N., P\u00e4\u00e4bo, S., Hasegawa, M.: Conflict among individual mitochondrial proteins in resolving the phylogeny of eutherian orders. J. Mol. Evol.\u00a047, 307\u2013322 (1998)","journal-title":"J. Mol. Evol."},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R. Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.: Clustering by compression. IEEE Trans. Information Theory\u00a051(4), 1523\u20131545 (2005)","journal-title":"IEEE Trans. Information Theory"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.tcs.2004.11.014","volume":"332","author":"M. Crochemore","year":"2005","unstructured":"Crochemore, M., D\u00e9sarm\u00e9nien, J., Perrin, D.: A note on the Burrows-Wheeler transformation. Theoret. Comput. Sci.\u00a0332, 567\u2013572 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-24597-1_16","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"F. Ergun","year":"2003","unstructured":"Ergun, F., Muthukrishnan, S., Sahinalp, C.: Comparing sequences with segment rearrangements. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 183\u2013194. Springer, Heidelberg (2003)"},{"issue":"9","key":"28_CR7","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1093\/comjnl\/39.9.731","volume":"39","author":"P. Fenwick","year":"1996","unstructured":"Fenwick, P.: The Burrows-Wheeler transform for block sorting text compression: principles and improvements. The Computer Journal\u00a039(9), 731\u2013740 (1996)","journal-title":"The Computer Journal"},{"issue":"2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0097-3165(93)90095-P","volume":"64","author":"I.M. Gessel","year":"1993","unstructured":"Gessel, I.M., Reutenauer, C.: Counting permutations with given cycle structure and descent set. J. Combin. Theory Ser. A\u00a064(2), 189\u2013215 (1993)","journal-title":"J. Combin. Theory Ser. A"},{"key":"28_CR9","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, Cambridge (1997)"},{"key":"28_CR10","first-page":"65","volume":"25","author":"L. Ilie","year":"2003","unstructured":"Ilie, L., Constantinescu, S.: Fine and Wilf\u2019s theorem for any number of periods. TUCS (Turku Center for Computer Science)\u00a025, 65\u201374 (2003); Proc. WORDS 2003","journal-title":"TUCS (Turku Center for Computer Science)"},{"key":"28_CR11","unstructured":"Larsson, N.J., Sadakane, K.: Faster suffix sorting. Technical Report LU-CS-TR:99-214, LUNDFD6\/(NFCS-3140)\/1-43\/(1999), Department of Computer Science, Lund University, Sweden (1999)"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/bioinformatics\/17.2.149","volume":"17","author":"M. Li","year":"2001","unstructured":"Li, M., Badger, J.H., Chen, X., Kwong, S., Kearney, P., Zhang, H.: An information based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics\u00a017, 149\u2013154 (2001)","journal-title":"Bioinformatics"},{"issue":"5","key":"28_CR13","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","volume":"12","author":"M. Li","year":"2004","unstructured":"Li, M., Chen, X., Li, X., Ma, B., Vit\u00e1nyi, P.: The similarity metric. IEEE Trans. Inform. Th.\u00a012(5), 3250\u20133264 (2004)","journal-title":"IEEE Trans. Inform. Th."},{"key":"28_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"issue":"5","key":"28_CR15","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 Journal on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11496656_16","volume-title":"Combinatorial Pattern Matching","author":"S. Mantaci","year":"2005","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 178\u2013189. Springer, Heidelberg (2005)"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0020-0190(02)00512-4","volume":"86","author":"S. Mantaci","year":"2003","unstructured":"Mantaci, S., Restivo, A., Sciortino, M.: Burrows-Wheeler transform and Sturmian words. Informat. Proc. Lett.\u00a086, 241\u2013246 (2003)","journal-title":"Informat. Proc. Lett."},{"key":"28_CR18","unstructured":"Mantaci, S., Restivo, A., Sciortino, M.: An extension of the Burrows-Wheeler Transform to k words. Technical Report 267, University of Palermo, Dipartimento di Matematica ed Appl. (December 2004)"},{"key":"28_CR19","first-page":"469","volume-title":"2005 Data Compression Conference (DCC 2005)","author":"S. Mantaci","year":"2005","unstructured":"Mantaci, S., Restivo, A., Sciortino, M.: An Extension of the Burrows Wheeler Transform to k Words (Extended Abstract). In: 2005 Data Compression Conference (DCC 2005), Snowbird, UT, USA, 29-31 March 2005, p. 469. IEEE Computer Society, Los Alamitos (2005)"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-48340-3_4","volume-title":"Mathematical Foundations of Computer Science 1999","author":"G. Manzini","year":"1999","unstructured":"Manzini, G.: The Burrows-Wheeler transform: Theory and practice. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 34\u201347. Springer, Heidelberg (1999)"},{"issue":"2","key":"28_CR21","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"28_CR22","first-page":"237","volume-title":"Algebraic Combinatorics on Words, ch. 8","author":"F. Mignosi","year":"2002","unstructured":"Mignosi, F., Restivo, A.: Periodicity. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words, ch. 8, pp. 237\u2013274. Cambridge University Press, Cambridge (2002)"},{"issue":"16","key":"28_CR23","doi-asserted-by":"publisher","first-page":"2122","DOI":"10.1093\/bioinformatics\/btg295","volume":"19","author":"H.H. Otu","year":"2003","unstructured":"Otu, H.H., Sayood, K.: A new sequence distance measure for phylogenetic tree construction. Bioinformatics\u00a019(16), 2122\u20132130 (2003)","journal-title":"Bioinformatics"},{"issue":"1","key":"28_CR24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0019-3577(03)90076-0","volume":"14","author":"R. Tijdeman","year":"2003","unstructured":"Tijdeman, R., Zamboni, L.: Fine and Wilf words for any periods. Indag. Math.\u00a014(1), 135\u2013147 (2003)","journal-title":"Indag. Math."},{"issue":"4","key":"28_CR25","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1093\/bioinformatics\/btg005","volume":"19","author":"S. Vinga","year":"2003","unstructured":"Vinga, S., Almeida, J.: Alignment-free sequence comparison \u2013 a review. Bioinformatics\u00a019(4), 513\u2013523 (2003)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:13:19Z","timestamp":1619493199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11560586_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}