Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Simple Linear Comparison of Strings in V-Order

(Extended Abstract)

  • Conference paper
Algorithms and Computation (WALCOM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8344))

Included in the following conference series:

Abstract

In this paper we focus on a total (but non-lexicographic) ordering of strings called V-order. We devise a new linear-time algorithm for computing the V-comparison of two finite strings. In comparison with the previous algorithm in the literature, our algorithm is both conceptually simpler, based on recording letter positions in increasing order, and more straightforward to implement, requiring only linked lists.

Part of this research was carried out when Rahman was visiting King’s College as a Commonwealth Fellow. This research work is also partially supported by a CodeCrafters-Investortools Research Grant for CSE BUET. (http://www.codecraftersintl.com/researchgrant.html)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler trans- form: data compression, suffix arrays, and pattern matching, p. 352. Springer (2008)

    Google Scholar 

  2. Breslauer, D., Grossi, R., Mignosi, F.: Simple real-time constant-space string matching. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 173–183. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Brlek, S., Lachaud, J.-O., Provençal, X., Reutenauer, C.: Lyndon + Christoffel = digitally convex. Pattern Recognition 42(10), 2239–2246 (2009)

    Article  MATH  Google Scholar 

  4. Chemillier, M.: Periodic musical sequences and Lyndon words. Soft Computing - A Fusion of Foundations, Methodologies and Applications 8(9), 611–616 (2004) ISSN: 1432-7643 (Print), 1433-7479 (Online)

    Google Scholar 

  5. Chemillier, M., Truchet, C.: Computation of words satisfying the “rhythmic oddity property” (after Simha Arom’s works). Inf. Proc. Lett. 86, 255–261 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. 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)

    Article  MathSciNet  Google Scholar 

  7. Crochemore, M., Désarménien, J., Perrin, D.: A note on the Burrows-Wheeler transformation. Theor. Comput. Sci. 332(1-3), 567–572 (2005)

    Article  MATH  Google Scholar 

  8. Crochemore, M., Perrin, D.: Two-way string-matching. J. Assoc. Comput. Mach. 38(3), 651–675 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. 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, Canada. NATO Advanced Sciences Institutes Series C: Mathematical and Physical Sciences, vol. 147, pp. 395–412. Reidel, Dordrecht-Boston (1984, 1985)

    Google Scholar 

  10. Daykin, D.E.: Algorithms for the Lyndon unique maximal factorization. J. Combin. Math. Combin. Comput. 77, 65–74 (2011)

    MATH  MathSciNet  Google Scholar 

  11. 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. Utilas Mat. Pub. Inc., Winnipeg (1996)

    Google Scholar 

  12. Danh, T.-N., Daykin, D.E.: Ordering integer vectors for coordinate deletions. J. London Math. Soc. 55(2), 417–426 (1997)

    Article  MathSciNet  Google Scholar 

  13. Daykin, D.E., Daykin, J.W.: Lyndon-like and V-order factorizations of strings. J. Discrete Algorithms 1, 357–365 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. 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)

    Article  MATH  MathSciNet  Google Scholar 

  15. Daykin, D.E., Daykin, J.W., Iliopoulos, C.S., Smyth, W.F.: Generic algorithms for factoring strings. In: Aydinian, H., Cicalese, F., Deppe, C. (eds.) Ahlswede Festschrift. LNCS, vol. 7777, pp. 402–418. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Daykin, D.E., Daykin, J.W., (Bill) Smyth, W.F.: Combinatorics of unique maximal factorization families (UMFFs). In: Janicki, R., Puglisi, S.J., Rahman, M.S. (eds.) Fund. Inform, vol. 97-3, pp. 295–309 (2009); Special Issue on Stringology

    Google Scholar 

  17. Daykin, D.E., Daykin, J.W., Smyth, W.F.: String comparison and lyndon-like factorization using V-order in linear time. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 65–76. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. Daykin, D.E., Daykin, J.W., Smyth, W.F.: A linear partitioning algorithm for Hybrid Lyndons using V-order. Theoret. Comput. Sci. 483, 149–161 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  19. Daykin, J.W., Iliopoulos, C.S., Smyth, W.F.: Parallel RAM algorithms for factorizing words. Theoret. Comput. Sci. 127, 53–67 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  20. Daykin, J.W., Smyth, W.F.: A bijective variant of the Burrows-Wheeler transform using V-Order (submitted)

    Google Scholar 

  21. Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms 4, 363–381 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  22. F. Gray, Pulse code communication, U.S. patent no. 2,632,058 (March 17, 1953)

    Google Scholar 

  23. Iliopoulos, C.S.: Optimal cost parallel algorithms for lexicographical ordering, Purdue University, Tech. Rep. 86-602 (1986)

    Google Scholar 

  24. 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)

    Article  MATH  MathSciNet  Google Scholar 

  25. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53(6), 918–936 (2006)

    Article  MathSciNet  Google Scholar 

  26. Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 200–210. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  27. Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press (1998)

    Google Scholar 

  28. Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983); 2nd edn. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  29. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys - CSUR 39(1), 2-es (2007)

    Google Scholar 

  30. Nong, G., Zhang, S., Chan, W.H.: Linear suffix array construction by almost pure induced-sorting. In: Proc. 2009 Data Compression Conf., pp. 193–202 (2009)

    Google Scholar 

  31. Ruskey, F.: Combinatorial Generation (Unpublished book). CiteSeerX: 10.1.1.93.5967, on combinatorics (2003)

    Google Scholar 

  32. Savage, C.: A survey of combinatorial Gray codes. SIAM Rev. 39(4), 605–629 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  33. Sirén, J., Välimäki, N., Mäkinen, V.: Indexing finite language representation of population genotypes. In: Przytycka, T.M., Sagot, M.-F. (eds.) WABI 2011. LNCS, vol. 6833, pp. 270–281. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  34. Smyth, B.: Computing patterns in strings, p. 423. Pearson (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, King’s College London, UK

    Ali Alatabbi, Jackie Daykin & M. Sohel Rahman

  2. Department of Computer Science, Royal Holloway, University of London, UK

    Jackie Daykin

  3. AℓEDA Group, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, 1000, Bangladesh

    M. Sohel Rahman

  4. Algorithms Research Group, Department of Computing & Software, McMaster University, Canada

    William F. Smyth

Authors
  1. Ali Alatabbi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jackie Daykin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Sohel Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. William F. Smyth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, 721302, Kharagpur, India

    Sudebkumar Prasant Pal

  2. National Institute of Informatics, 2-1-2 Hitotsubashi, 101-8430, Chiyoda-ku, Tokyo, Japan

    Kunihiko Sadakane

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Alatabbi, A., Daykin, J., Rahman, M.S., Smyth, W.F. (2014). Simple Linear Comparison of Strings in V-Order. In: Pal, S.P., Sadakane, K. (eds) Algorithms and Computation. WALCOM 2014. Lecture Notes in Computer Science, vol 8344. Springer, Cham. https://doi.org/10.1007/978-3-319-04657-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04657-0_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04656-3

  • Online ISBN: 978-3-319-04657-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation