{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:14Z","timestamp":1759638494518},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262015"},{"type":"electronic","value":"9783540315629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496656_16","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:17:26Z","timestamp":1285442246000},"page":"178-189","source":"Crossref","is-referenced-by-count":20,"title":["An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression"],"prefix":"10.1007","author":[{"given":"Sabrina","family":"Mantaci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rosone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting data compression algorithm. Technical report, DIGITAL System Research Center (1994)"},{"key":"16_CR2","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."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.: Clustering by compression. IEEE Trans. Information Theory (submitted, 2005)","DOI":"10.1109\/TIT.2005.844059"},{"key":"16_CR4","unstructured":"Crochemore, M., D\u00e9sarm\u00e9nien, J., Perrin, D.: A note on the Burrows-Wheeler transformation. Theoret. Comput. Sci. (to appear)"},{"key":"16_CR5","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":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0097-3165(93)90095-P","volume":"64","author":"M. Gessel","year":"1993","unstructured":"Gessel, 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"},{"issue":"5","key":"16_CR7","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":"16_CR8","series-title":"Encyclopedia of Mathematics","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics, vol.\u00a017. Addison-Wesley, Reading (1983); Reprinted in the Cambridge Mathematical Library. Cambridge University Press, Cambridge (1997)"},{"key":"16_CR9","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)"},{"key":"16_CR10","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: A new sequence distance measure based on the Burrows-Wheeler transform. Technical Report 268, University of Palermo, Dipartimento di Matematica ed Appl. (December 2004)"},{"key":"16_CR11","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":"16_CR12","first-page":"292","volume":"25","author":"S. Mantaci","year":"2003","unstructured":"Mantaci, S., Restivo, A., Sciortino, M.: Combinatorial aspects of the Burrows- Wheeler transform. TUCS (Turku Center for Computer Science) General Pubblication\u00a025, 292\u2013297 (2003); proc. WORDS 2003","journal-title":"TUCS (Turku Center for Computer Science) General Pubblication"},{"key":"16_CR13","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":"16","key":"16_CR14","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":"4","key":"16_CR15","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","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496656_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:11Z","timestamp":1619505611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496656_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262015","9783540315629"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11496656_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}