Abstract
In this paper we extend previous work on Unique Maximal Factorization Families (UMFFs) and a total (but non-lexicographic) ordering of strings called V-order. We describe linear-time algorithms for string comparison and Lyndon factorization based on V-order. We propose extensions of these algorithms to other forms of order.
The work of the third author was supported in part by the Natural Sciences & Engineering Research Council of Canada.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chemillier, M.: Periodic musical sequences and Lyndon words. In: Soft Computing - A Fusion of Foundations, Methodologies and Applications, vol. 8-9, pp. 611–616. Springer, Heidelberg (2004)
Crochemore, M., Désarménien, J., Perrin, D.: A note on the Burrows-Wheeler transformation. In: Scientific Commons (2005), http://en.scientificcommons.org/16732444
Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus, IV — the quotient groups of the lower central series. Ann. Math. 68, 81–95 (1958)
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. 147, pp. 395–412. Reidel, Dordrecht-Boston (1985)
Daykin, D.E.: Algorithms for the Lyndon unique maximal factorization. J. Combin. Math. Combin. Comput. (to appear)
Danh, T.-N., Daykin, D.E.: The structure of V-order for integer vectors. In: Hilton, A.J.W. (ed.) Congr. Numer., vol. 113, pp. 43–53 (1996)
Daykin, D.E., Daykin, J.W.: Lyndon-like and V-order factorizations of strings. J. Discrete Algorithms 1–3/4, 357–365 (2003)
Daykin, D.E., Daykin, J.W.: Properties and construction of unique maximal factorization families for strings. Internat. J. Found. Comput. Sci. 19–4, 1073–1084 (2008)
Daykin, D.E., Daykin, J.W., Iliopoulos, C.S., Smyth, W.F.: Generic algorithms for factoring strings (in preparation)
Daykin, D.E., Daykin, J.W., (Bill) Smyth, W.F.: Combinatorics of Unique Maximal Factorization Families (UMFFs). Fund. Inform. 97–3, Special StringMasters Issue Janicki, R., Puglisi, S.J., Rahman, M.S. (eds.), pp. 295–309 (2009)
Daykin, D.E., Daykin, J.W., Smyth, W.F.: Sequential and Parallel Algorithms for Lyndon Factorization using V -Order (in preparation)
Daykin, J.W., Iliopoulos, C.S., Smyth, W.F.: Parallel RAM algorithms for factorizing words. Theoret. Comput. Sci. 127, 53–67 (1994)
Delgrange, O., Rivals, E.: STAR: an algorithm to Search for Tandem Approximate Repeats. Bioinformatics 20–16, 2812–2820 (2004)
Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms 4, 363–381 (1983)
Gil, J., Scott, D.A.: A bijective string sorting transform (submitted)
Iliopoulos, C.S., Smyth, W.F.: Optimal algorithms for computing the canonical form of a circular string. Theoret. Comput. Sci. 92–1, 87–105 (1992)
Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983); 2nd edn. Cambridge University Press, Cambridge (1997).
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–244 (2005)
Reutenauer, C.: Free Lie algebras, London Math. Soc. Monographs New Ser., vol. 7, p. 288. Oxford University Press, Oxford (1993)
Smyth, B.: Computing patterns in strings. p. 423. Pearson, Addison-Wesley (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daykin, D.E., Daykin, J.W., Smyth, W.F. (2011). String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time. In: Giancarlo, R., Manzini, G. (eds) Combinatorial Pattern Matching. CPM 2011. Lecture Notes in Computer Science, vol 6661. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21458-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-21458-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21457-8
Online ISBN: 978-3-642-21458-5
eBook Packages: Computer ScienceComputer Science (R0)