Skip to main content
SpringerLink
Log in

Parallel Solution to LIS Using Divide-and-Conquer Approach

  • Conference paper
  • First Online:
Data Science and Analytics (REDSET 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1229))

  • 682 Accesses

Abstract

This paper presents parallel solution to the LIS problem. The presented approach works by dividing the problem into smaller sub problems and then combining their solutions. The individual sub problems are handled in parallel by multiple processors. The solution produces optimal result in O(n log n) time using n/2 processors. The time taken by a single processor to implement this approach is O(n/2 (log2 n)2).

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 EPUB and 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

References

  1. Tsai, Y.T.: The constrained longest common subsequence problem. Inf. Process. Lett. 88(4), 173–176 (2003)

    Article  MathSciNet  Google Scholar 

  2. Delcher, A.L., Kasif, S., Fleischmann, R.D., Peterson, J., White, O., Salzberg, S.L.: Alignment of whole genomes. Nucleic Acids Res. 27(11), 2369–2376 (1999)

    Article  Google Scholar 

  3. Lascoux, A., Leclerc, B., Thibon, J.-Y.: The plactic monoid. In: Algebraic Combinatoric on Words, p. 10 (2002)

    Google Scholar 

  4. Schensted, C.: Longest increasing and decreasing subsequences. Can. J. Math. 13(2), 179–191 (1961)

    Article  MathSciNet  Google Scholar 

  5. Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Math. 11(1), 29–35 (1975)

    Article  MathSciNet  Google Scholar 

  6. Alam, M.R., Rahman, M.S.: A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem. Inf. Process. Lett. 113(13), 470–476 (2013)

    Article  MathSciNet  Google Scholar 

  7. Bespamyatnikh, S., Segal, M.: Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett. 76(1–2), 7–11 (2000)

    Article  MathSciNet  Google Scholar 

  8. van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett. 6(3), 80–82 (1977)

    Article  Google Scholar 

  9. Crochemore, M., Porat, E.: Fast computation of a longest increasing subsequence and application. Inf. Comput. 208(9), 1054–1059 (2010)

    Article  MathSciNet  Google Scholar 

  10. Saks, M., Seshadhri, C.: Estimating the longest increasing sequence in polylogarithmic time. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 458–467. IEEE, October 2010

    Google Scholar 

  11. Elmasry, A.: The longest almost-increasing subsequence. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 338–347. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14031-0_37

    Chapter  MATH  Google Scholar 

  12. Albert, M.H., Golynski, A., Hamel, A.M., López-Ortiz, A., Rao, S.S., Safari, M.A.: Longest increasing subsequences in sliding windows. Theoret. Comput. Sci. 321(2–3), 405–414 (2004)

    Article  MathSciNet  Google Scholar 

  13. Chen, E., Yang, L., Yuan, H.: Longest increasing subsequences in windows based on canonical antichain partition. Theoret. Comput. Sci. 378(3), 223–236 (2007)

    Article  MathSciNet  Google Scholar 

  14. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  15. Lavanya, B., Murugan, A.: Discovery of longest increasing subsequences and its variants using DNA operations. Int. J. Eng. Technol. 5(2), 1169–1177 (2013)

    Google Scholar 

  16. Rani, S., Rajpoot, D.S.: Improvised divide and conquer approach for the LIS problem. J. Discrete Algorithms 48, 17–26 (2018)

    Article  MathSciNet  Google Scholar 

  17. Adi, S.S., et al.: Repetition-free longest common subsequence. Electron. Notes Discrete Math. 30, 243–248 (2008)

    Article  MathSciNet  Google Scholar 

  18. Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms. Galgotia Publication Pvt. Ltd., New Delhi (2004)

    MATH  Google Scholar 

  19. Mouratov, M. https://stackoverflow.com/questions/12458641/applications-of-longest-increasing-subsquence. Accessed 10 Oct 2018

  20. Journal of a Programmer. http://bryanpendleton.blogspot.in/2010/05/patience-diff.html. Accessed 20 Sept 2018

  21. Albert, M.H., Atkinson, M.D., Nussbaum, D., Sack, J.R., Santoro, N.: On the longest increasing subsequence of a circular list. Inf. Process. Lett. 101(2), 55–59 (2007)

    Article  MathSciNet  Google Scholar 

  22. Deorowicz, S.: An algorithm for solving the longest increasing circular subsequence problem. Inf. Process. Lett. 109(12), 630–634 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Jaypee Institute of Information Technology, Noida, India

    Seema Rani

  2. Dronacharya Government College, Gurugram, India

    Seema Rani

  3. Computer Science and Engineering Department, Jaypee Institute of Information Technology, Noida, India

    Dharamveer Singh Rajpoot

Authors
  1. Seema Rani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dharamveer Singh Rajpoot
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seema Rani .

Editor information

Editors and Affiliations

  1. GD Goenka University, Gurugram, India

    Usha Batra

  2. GD Goenka University, Sohna, Haryana, India

    Nihar Ranjan Roy

  3. University of Arkansas, Fayetteville, AR, USA

    Brajendra Panda

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rani, S., Rajpoot, D.S. (2020). Parallel Solution to LIS Using Divide-and-Conquer Approach. In: Batra, U., Roy, N., Panda, B. (eds) Data Science and Analytics. REDSET 2019. Communications in Computer and Information Science, vol 1229. Springer, Singapore. https://doi.org/10.1007/978-981-15-5827-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-5827-6_7

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-5826-9

  • Online ISBN: 978-981-15-5827-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation