{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:07Z","timestamp":1759639027578},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_8","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T21:11:27Z","timestamp":1309209087000},"page":"65-76","source":"Crossref","is-referenced-by-count":5,"title":["String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time"],"prefix":"10.1007","author":[{"given":"David E.","family":"Daykin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacqueline W.","family":"Daykin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. F.","family":"Smyth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","first-page":"611","volume-title":"Soft Computing - A Fusion of Foundations, Methodologies and Applications","author":"M. Chemillier","year":"2004","unstructured":"Chemillier, M.: Periodic musical sequences and Lyndon words. In: Soft Computing - A Fusion of Foundations, Methodologies and Applications, vol.\u00a08-9, pp. 611\u2013616. Springer, Heidelberg (2004)"},{"key":"8_CR2","unstructured":"Crochemore, M., D\u00e9sarm\u00e9nien, J., Perrin, D.: A note on the Burrows-Wheeler transformation. In: Scientific Commons (2005), http:\/\/en.scientificcommons.org\/16732444"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/1970044","volume":"68","author":"K.T. Chen","year":"1958","unstructured":"Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus, IV \u2014 the quotient groups of the lower central series. Ann. Math.\u00a068, 81\u201395 (1958)","journal-title":"Ann. Math."},{"key":"8_CR4","series-title":"NATO Advanced Sciences Institutes Series C: Mathematical and Physical Sciences","first-page":"395","volume-title":"Graphs and order, Proceedings of a Conference in Banff (1984)","author":"D.E. Daykin","year":"1985","unstructured":"Daykin, D.E.: Ordered ranked posets, representations of integers and inequalities from extremal poset problems. In: Rival, I. (ed.) Graphs and order, Proceedings of a Conference in Banff (1984). NATO Advanced Sciences Institutes Series C: Mathematical and Physical Sciences, vol.\u00a0147, pp. 395\u2013412. Reidel, Dordrecht-Boston (1985)"},{"key":"8_CR5","unstructured":"Daykin, D.E.: Algorithms for the Lyndon unique maximal factorization. J. Combin. Math. Combin. Comput. (to appear)"},{"key":"8_CR6","unstructured":"Danh, T.-N., Daykin, D.E.: The structure of V-order for integer vectors. In: Hilton, A.J.W. (ed.) Congr. Numer., vol.\u00a0113, pp. 43\u201353 (1996)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S1570-8667(03)00039-X","volume":"1\u20133\/4","author":"D.E. Daykin","year":"2003","unstructured":"Daykin, D.E., Daykin, J.W.: Lyndon-like and V-order factorizations of strings. J. Discrete Algorithms\u00a01\u20133\/4, 357\u2013365 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1142\/S0129054108006133","volume":"19\u20134","author":"D.E. Daykin","year":"2008","unstructured":"Daykin, D.E., Daykin, J.W.: Properties and construction of unique maximal factorization families for strings. Internat. J. Found. Comput. Sci.\u00a019\u20134, 1073\u20131084 (2008)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"8_CR9","unstructured":"Daykin, D.E., Daykin, J.W., Iliopoulos, C.S., Smyth, W.F.: Generic algorithms for factoring strings (in preparation)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Daykin, D.E., Daykin, J.W., (Bill) Smyth, W.F.: Combinatorics of Unique Maximal Factorization Families (UMFFs). Fund. Inform.\u00a097\u20133, Special StringMasters Issue Janicki, R., Puglisi, S.J., Rahman, M.S. (eds.), pp. 295\u2013309 (2009)","DOI":"10.3233\/FI-2009-202"},{"key":"8_CR11","unstructured":"Daykin, D.E., Daykin, J.W., Smyth, W.F.: Sequential and Parallel Algorithms for Lyndon Factorization using V -Order (in preparation)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(94)90100-7","volume":"127","author":"J.W. Daykin","year":"1994","unstructured":"Daykin, J.W., Iliopoulos, C.S., Smyth, W.F.: Parallel RAM algorithms for factorizing words. Theoret. Comput. Sci.\u00a0127, 53\u201367 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"2812","DOI":"10.1093\/bioinformatics\/bth335","volume":"20\u201316","author":"O. Delgrange","year":"2004","unstructured":"Delgrange, O., Rivals, E.: STAR: an algorithm to Search for Tandem Approximate Repeats. Bioinformatics\u00a020\u201316, 2812\u20132820 (2004)","journal-title":"Bioinformatics"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J.P. Duval","year":"1983","unstructured":"Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms\u00a04, 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"key":"8_CR15","unstructured":"Gil, J., Scott, D.A.: A bijective string sorting transform (submitted)"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(92)90137-5","volume":"92\u20131","author":"C.S. Iliopoulos","year":"1992","unstructured":"Iliopoulos, C.S., Smyth, W.F.: Optimal algorithms for computing the canonical form of a circular string. Theoret. Comput. Sci.\u00a092\u20131, 87\u2013105 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR17","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983); 2nd edn. Cambridge University Press, Cambridge (1997)."},{"key":"8_CR18","unstructured":"Perret, L.: A chosen ciphertext attack on a public key cryptosystem based on Lyndon words. In: Proc. International Workshop on Coding and Cryptography, pp. 235\u2013244 (2005)"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1093\/oso\/9780198536796.001.0001","volume-title":"Free Lie algebras, London Math. Soc. Monographs New Ser.","author":"C. Reutenauer","year":"1993","unstructured":"Reutenauer, C.: Free Lie algebras, London Math. Soc. Monographs New Ser., vol.\u00a07, p. 288. Oxford University Press, Oxford (1993)"},{"key":"8_CR20","unstructured":"Smyth, B.: Computing patterns in strings. p. 423. Pearson, Addison-Wesley (2003)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T05:46:04Z","timestamp":1712555164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}