Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Ibrahim Sadek Bhuiyan"'
Autor:
Ratul Bhowmick, Ahsan Sadee Tanim, Muhammad Kamal Hossen, Md. Sabir Hossain, Ibrahim Sadek Bhuiyan
Publikováno v:
2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT).
The general algorithms which are followed to solve the Longest Common Subsequence (LCS) problems have both time complexity and space complexity of O(m * n). To reduce this complexity, two ways are proposed in this work. One is the use of Divide and C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6e6f78cf45fb18f8bcd11b72c451ff8
https://doi.org/10.1109/icasert.2019.8934638
https://doi.org/10.1109/icasert.2019.8934638
