Abstract
The data explosion problem continues to escalate requiring novel and ingenious solutions. Pattern inference focusing on repetitive structures in data is a vigorous field of endeavor aimed at shrinking volumes of data by means of concise descriptions. The Burrows–Wheeler transformation computes a permutation of a string of letters over an alphabet, and is well-suited to compression-related applications due to its invertability and data clustering properties. For space efficiency the input to the transform can be preprocessed into Lyndon factors. Rather than this classic deterministic approach for letter based strings, we consider scenarios with uncertainty regarding the data: a position in an indeterminate or degenerate string is a set of letters. We first define indeterminate Lyndon words and establish their associated unique string factorization; then we introduce the novel degenerate Burrows–Wheeler transformation which may apply the indeterminate Lyndon factorization. A core computation in Burrows–Wheeler type transforms is the linear sorting of all conjugates of the input string—we achieve this in the degenerate case with lex-extension ordering. Like the original forms, indeterminate Lyndon factorization and the degenerate transform and its inverse can all be computed in linear time and space with respect to total input size of degenerate strings. Regular molecular biological strings yield a wealth of applications of big data—an important motivation for generalizing to degenerate strings is their extensive use in expressing polymorphism in DNA sequences.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows–Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. Springer, NewYork (2008)
Antoniou, P., Daykin, J.W., Iliopoulos, C.S., Kourie, D., Mouchard, L., Pissis, S.P.: Mapping uniquely occuring short sequences derived from high throughput technologies to a reference genome. In: Proceedings of the 9th IEEE International Conference on Information Technology and Applications in Biomedicine (ITAB 2009). (2009). doi:10.1109/ITAB.2009.5394394
Apostolico, A., Crochemore, M.: Fast parallel Lyndon factorization with applications. Math. Syst. Theory 28(2), 89–108 (1995)
Bauer, M.J., Cox, A.J., Rosone, G., Sciortino, M.: Lightweight LCP construction for next-generation sequencing datasets. CoRR. arXiv:1305.0160 (2013)
Breslauer, D., Grossi, R., Mignosi, F.: Simple real-time constant-space string matching. In: Giancarlo, R., Manzini, G. (eds.) CPM, volume 6661 of Lecture Notes in Computer Science, pp. 173–183 (2011)
Burrows, M., Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)
Chemillier, M.: Periodic musical sequences and Lyndon words. Soft Comput. 8(9), 611–616 (2004)
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)
Crochemore, M., Désarménien, J., Perrin, D.: A note on the Burrows–Wheeler transformation. Theor. Comput. Sci. 332(1–3), 567–572 (2005)
Crochemore, M., Grossi, R., ärkkäinen, J.K., Landau, G.M.: A constant-space comparison-based algorithm for computing the Burrows–Wheeler transform. In: Proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 74–82 (2013)
Crochemore, M., Perrin, D.: Two-way string matching. J. ACM 38(3), 651–675 (1991)
Daykin, D.E., Daykin, J.W.: Lyndon-like and V-order factorizations of strings. J. Discrete Algorithms 1, 357–365 (2003)
Daykin, D.E., Daykin, J.W.: Properties and construction of unique maximal factorization families for strings. Int. J. Found. Comput. Sci. 19(4), 1073–1084 (2008)
Daykin, J.W., Smyth, W.F.: A bijective variant of the Burrows–Wheeler transform using V-order. Theor. Comput. Sci. 531, 77–89 (2014)
Duval, J.-P.: Factorizing words over an ordered alphabet. J. Algorithms 4(4), 363–381 (1983)
Fredricksen, H., Maiorana, J.: Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Math. 23(3), 207–210 (1978)
Gil, J.Y., Scott, D.A.: A bijective string sorting transform. CoRR. arXiv:1201.3077 (2012)
Holub, J., Smyth, W.F.: Algorithms on indeterminate strings. In: Proceedings of the 14th Australasian Workshop on Combinatorial Algorithms (AWOCA), pp. 36–45 (2003)
Iliopoulos, C., Mouchard, L., Rahman, M.: A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching. Math. Comput. Sci. 2(4), 557–569 (2008)
Iliopoulos, C., Rahman, M., Voráček, M., Vagner, L.: Finite automata based algorithms on subsequences and supersequences of degenerate strings. J. Discrete Algorithms 8(2), 117–130 (2010)
Kärkkäinen, J., Kempa, D., Puglisi, S.J.: Slashing the time for BWT inversion. In: Proceedings of the Data Compression Conference (DCC), pp. 99–108 (2012)
Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 200–210 (2003)
Kufleitner, M.: On bijective variants of the Burrows–Wheeler transform. In: Proceedings of the Stringology, pp. 65–79 (2009)
Langmead, B., Trapnell, C., Pop, M., Salzberg, S.L.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol. 10(3), R25 (2009)
Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows–Wheeler transform. Bioinformatics 25(14), 1754–1760 (2009)
Li, R., Yu, C., Li, Y., Lam, T.W., Yiu, S.M., Kristiansen, K., Wang, J.: Soap2: an improved ultrafast tool for short read alignment. Bioinformatics 25(15), 1966–1967 (2009)
Lothaire, M.: Combinatorics on words. 2nd edn. Reading, MA (1983); Cambridge University Press, Cambridge (1997). Addison-Wesley (1983)
Lothaire, M.: Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications). Cambridge University Press, New York, NY (2005)
Lyndon, R.C.: On Burnside’s problem. Trans. Am. Math. Soc. 77, 202–215 (1954)
Lyndon, R.C.: On Burnside’s problem II. Trans. Am. Math. Soc. 78(2), 329–332 (1955)
Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows– Wheeler transform and applications to sequence comparison and data compression. In: Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 178–189 (2005)
Neuburger, S., Sokol, D.: Succinct 2D dictionary matching. Algorithmica 65(3), 662–684 (2013)
Perret, L.: A chosen ciphertext attack on a public key cryptosystem based on Lyndon words. IACR Cryptol ePrint Arch 2005, 14 (2005)
Reutenauer, C.: Free Lie Algebras. London Mathematical Society Monographs New Series. Oxford University Press, Oxford (1993)
Salson, M., Lecroq, T., Léonard, M., Mouchard, L.: A four-stage algorithm for updating a Burrows–Wheeler transform. Theor. Comput. Sci. 410(43), 4350–4359 (2009)
Smyth, B.: Computing Patterns in Strings. ACM Press Bks, Addison-Wesley, Pearson (2003)
Tsai, Y.: The constrained longest common subsequence problem. Inf. Process. Lett. 88(4), 173–176 (2003)
Wu, S., Manber, U.: Fast text searching: allowing errors. Commun. ACM 35(10), 83–91 (1992)
Author information
Authors and Affiliations
Corresponding author
Additional information
Full version of an extended abstract which appeared in the Proceedings of the 2nd International Conference on Algorithms for Big Data.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Daykin, J.W., Watson, B. Indeterminate String Factorizations and Degenerate Text Transformations. Math.Comput.Sci. 11, 209–218 (2017). https://doi.org/10.1007/s11786-016-0285-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-016-0285-x
Keywords
- Degenerate biological string
- Degenerate Burrows-Wheeler transform
- Indeterminate Lyndon word
- Indeterminate suffix array
- Inverse transform
- Lex-extension order
- Linear