An Approach for Improving Complexity of Longest Common Subsequence Problems using Queue and Divide-and-Conquer Method

Simple item page
dc.contributor.authorBhowmick, Ratul
dc.contributor.authorBhuiyan, Md Ibrahim Sadek
dc.contributor.authorHossain, Md. Sabir
dc.contributor.authorHossen, Muhammad Kamal
dc.contributor.authorTanim, Ahsan Sadee
dc.date.accessioned2026-07-06T21:10:57Z
dc.date.available2026-07-06T21:10:57Z
dc.date.issued3-May-2019
dc.description.abstractThe general algorithms which are followed to solve
dc.description.abstractthe Longest Common Subsequence (LCS) problems have both
dc.description.abstracttime complexity and space complexity of O (m * n ). To reduce
dc.description.abstractthis complexity, two ways are proposed in this work. One is the
dc.description.abstractuse of Divide and Conquer approach, and another one is
dc.description.abstractchanging the data structure from two-dimensional array to
dc.description.abstractqueue. By using these approaches, an algorithm has been
dc.description.abstractdeveloped and implemented for the long length string in this
dc.description.abstractpaper. The time complexity after using these approaches
dc.description.abstractbecomes a function of logarithm which has been
dc.description.abstractshown with proper explanation and the space complexity after
dc.description.abstractusing queue data structure becomes linear O (n ).
dc.identifier.otherhttp://103.99.128.19:8080/jspui/handle/123456789/334
dc.identifier.urihttp://103.99.128.19:8080/xmlui/handle/123456789/334
dc.publisherEWU
dc.sourceCUET Digital Repository
dc.subjectLongest Common Subsequence
dc.subjectQueue
dc.subjectDivide and conquer
dc.subjectDynamic Programming
dc.subjectRecursion
dc.titleAn Approach for Improving Complexity of Longest Common Subsequence Problems using Queue and Divide-and-Conquer Method
dc.title.alternative1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT 2019)
dc.title.alternativeICASERT 2019

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
An Approach for Improving Complexity of Longest.pdf
Size:
1.1 MB
Format:
Adobe Portable Document Format
Download

Collections

proceedings in CSE