{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:08:01Z","timestamp":1773274081772,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T00:00:00Z","timestamp":1193702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s00224-007-9078-6","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T15:11:13Z","timestamp":1193670673000},"page":"411-429","source":"Crossref","is-referenced-by-count":26,"title":["A New Combinatorial Approach to Sequence Comparison"],"prefix":"10.1007","volume":"42","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","published-online":{"date-parts":[[2007,10,30]]},"reference":[{"key":"9078_CR1","doi-asserted-by":"crossref","unstructured":"Benedetto, D., Caglioti, E., Loreto, V.: Zipping out relevant information, Comput. Sci. Eng. 80\u201385 (2003)","DOI":"10.1109\/MCISE.2003.1166556"},{"issue":"4","key":"9078_CR2","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1109\/18.681318","volume":"44","author":"C.H. Bennett","year":"1998","unstructured":"Bennett, C.H., G\u00e1cs, P., Li, M., Vit\u00e1nyi, P., Zurek, W.: Information distance. IEEE Trans. Inf. Theory 44(4), 1407\u20131423 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9078_CR3","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting data compression algorithm. Technical report, DIGITAL System Research Center (1994)"},{"key":"9078_CR4","doi-asserted-by":"crossref","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. 47, 307\u2013322 (1998)","journal-title":"J. Mol. Evol."},{"issue":"4","key":"9078_CR5","doi-asserted-by":"crossref","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. Inf. Theory 51(4), 1523\u20131545 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9078_CR6","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 332, 567\u2013572 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9078_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-540-24597-1_16","volume-title":"Proc. of the FSTTCS\u201903","author":"F. Ergun","year":"2003","unstructured":"Ergun, F., Muthukrishnan, S., Sahinalp, C.: Comparing sequences with segment rearrangements. In: Proc. of the FSTTCS\u201903, Bombay, India. Lecture Notes in Computer Science, pp.\u00a0183\u2013194. Springer, Berlin (2003)"},{"issue":"9","key":"9078_CR8","doi-asserted-by":"crossref","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. Comput.\u00a0J. 39(9), 731\u2013740 (1996)","journal-title":"Comput.\u00a0J."},{"issue":"2","key":"9078_CR9","doi-asserted-by":"crossref","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.\u00a0Comb. Theory Ser. A 64(2), 189\u2013215 (1993)","journal-title":"J.\u00a0Comb. Theory Ser. A"},{"key":"9078_CR10","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Proc. ICALP, pp.\u00a0943\u2013955, 2003","DOI":"10.1007\/3-540-45061-0_73"},{"key":"9078_CR11","doi-asserted-by":"crossref","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 17, 149\u2013154 (2001)","journal-title":"Bioinformatics"},{"issue":"5","key":"9078_CR12","doi-asserted-by":"crossref","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. Inf. Theory 12(5), 3250\u20133264 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9078_CR13","volume-title":"Combinatorics on Words. Encyclopedia of Mathematics","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics, vol.\u00a017. Addison\u2013Wesley, Reading (1983). Reprinted in the Cambridge Mathematical Library, Cambridge University Press (1997)"},{"key":"9078_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)"},{"key":"9078_CR15","doi-asserted-by":"crossref","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. Inf. Proc. Lett. 86, 241\u2013246 (2003)","journal-title":"Inf. Proc. Lett."},{"key":"9078_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/11496656_16","volume-title":"Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19\u201322, 2005, Proceedings","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.) Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19\u201322, 2005, Proceedings. Lecture Notes in Computer Science, vol.\u00a03537, pp.\u00a0178\u2013189. Springer, Berlin (2005)"},{"key":"9078_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/11560586_28","volume-title":"Proceedings of ICTCS 2005, Theoretical Computer Science, 9th Italian Conference, ICTCS 2005","author":"S. Mantaci","year":"2005","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: A new combinatorial approach to sequence comparison. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) Proceedings of ICTCS 2005, Theoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12\u201314, 2005. Lecture Notes in Computer Science, vol.\u00a03701, pp. 348\u2013359. Springer, Berlin (2005)"},{"key":"9078_CR18","doi-asserted-by":"crossref","unstructured":"Mantaci, S., Rosone, G., Restivo, A., Sciortino, M.: An extension of the burrows wheeler transform. Theor. Comput. Sci. (to appear)","DOI":"10.1016\/j.tcs.2007.07.014"},{"key":"9078_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-48340-3_4","volume-title":"Proc. of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS \u201999)","author":"G. Manzini","year":"1999","unstructured":"Manzini, G.: The Burrows-Wheeler transform: theory and practice. In: Proc. of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS \u201999). Lecture Notes in Computer Science, vol.\u00a01672, pp.\u00a034\u201347. Springer, Berlin (1999)"},{"issue":"16","key":"9078_CR20","doi-asserted-by":"crossref","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 19(16), 2122\u20132130 (2003)","journal-title":"Bioinformatics"},{"key":"9078_CR21","doi-asserted-by":"crossref","unstructured":"Pevzner, P.A.: Statistical distance between texts and filtration methods in sequence comparison. Comput. Appl. Biosci. (8), 121\u2013127 (1992)","DOI":"10.1093\/bioinformatics\/8.2.121"},{"key":"9078_CR22","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: a\u00a0new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4"},{"issue":"4","key":"9078_CR23","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1093\/bioinformatics\/btg005","volume":"19","author":"S. Vinga","year":"2003","unstructured":"Vinga, S., Almeida, J.: Alignment-free sequence comparison\u2014a\u00a0review. Bioinformatics 19(4), 513\u2013523 (2003)","journal-title":"Bioinformatics"},{"key":"9078_CR24","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"H.S. Wilf","year":"1965","unstructured":"Wilf, H.S., Fine, N.J.: Uniqueness theorem for periodic functions. Proc. Am. Math. Soc. 16, 109\u2013114 (1965)","journal-title":"Proc. Am. Math. Soc."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9078-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9078-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9078-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:35Z","timestamp":1558698695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9078-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,30]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["9078"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9078-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,30]]}}}