» Research Fields:
» Research Groups:
» Related Faculties:
| 1. | A. H. M. Kamal, Mohammad Mahfuzul Islam, A New Histogram-Shifting-Imitated Embedding Scheme, Journal of Computer Engineering, 1(2), 82-86, 2018. |
|---|---|
| 2. | Md. Mahbubul Hasan, A. S. Islam, M. Sohel Rahman, Ayon Sen, Palindromic Subsequence Automata and Longest Common Palindromic Subsequence, Mathematics in Computer Science, 11(2), 219–232, 2017. [paper link] |
| 3. | S. M. Ferdous, M. Sohel Rahman, Solving the Minimum Common String Partition Problem with the Help of Ants, Mathematics in Computer Science, 11(2), 233–249, 2017. [paper link] |
| 4. | Ali Alatabbi, A. S. Islam, M. Sohel Rahman, Jamie Simpson, William Smyth, Enhanced covers of regular and indeterminate strings using prefix tables, J. Automata, Languages and Combinatorics, 21(3), 131-147, 2016. [paper link] |
| 5. | Ali Alatabbi, Jackie Daykin, Juha Kärkkäinen, M. Sohel Rahman, William Smyth, V-order: new combinatorial properties and a simple comparison algorithm, Discrete Applied Mathematics, 215, 41- 46, 2016. [paper link] |
| 6. | F. T. Zohora, M. Sohel Rahman, "An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications.", Theoretical Computer Science, , , 2016. |
| 7. | Ali Alatabbi, M. Sohel Rahman, W.F. Smyth, Computing Covers Using Prefix Tables, Discrete Applied Mathematics, 212, 2-9, 2016. |
| 8. | Ali Alatabbi, Alessio Langiu, M. Sohel Rahman, Algorithms for Longest Common Abelian Factors, International Journal of Foundations of Computer Science, 27(5), 529-544, 2016. [paper link] |
| 9. | Ali Alatabbi, M. Sohel Rahman, W.F. Smyth, Inferring an indeterminate string from a prefix graph, Journal of Discrete Algorithms, 32(-), 6-13, 2015. |
| 10. | Md. Khaledur Rahman, M. Sohel Rahman, Prefix and suffix transreversals on binary and ternary strings, Journal of Discrete Algorithms, 33, 160-170, 2015. |
| 11. | Effat Farhana, M. Sohel Rahman, Constrained sequence analysis algorithms in computational biology, Information Sciences, 295, 247-257, 2015. |
| 12. | Ali Alatabbi, J. W. Daykin, M. Sohel Rahman, W.F. Smyth, Simple Linear Comparison of Strings in V-Order, Fundamenta Informaticae, To Appear, , 2015. |
| 13. | Md. Mahbubul Hasan, A. S. Islam, Mohammad Saifur Rahman, M. Sohel Rahman, Order preserving pattern matching revisited, Pattern Recognition Letters, 55, 15-21, 2015. [paper link] |
| 14. | A.H.M.M Rahman, M. Sohel Rahman, Effective Sparse Dynamic Programming Algorithms for Merged and Block Merged LCS Problems, Journal of Computers, 9(8), 1743-1754, 2014. |
| 15. | M. Crochemore, A. Langiu, M. Sohel Rahman, Indexing a sequence for mapping reads with a single mismatch, Phil. Trans. R. Soc. A, 372, 20130167, 2014. |
| 16. | Pritom Ahmed, Costas Iliopoulos, A. S. Islam, M. Sohel Rahman, The swap matching problem revisited, Theoretical Computer Science, 557(6), 34-49, 2014. |
| 17. | M.T.I Aumi, M.T. Moosa, M. Sohel Rahman, Pattern Matching in Indeterminate and Arc-Annotated Sequences, Recent Patents on DNA and Gene Sequences, 7(2), 96-104, 2013. |
| 18. | T.M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz Rimpi, Inferring Strings from Cover Arrays, Discrete Mathematics, Algorithms and Applications (DMAA), 5(2), , 2013. |
| 19. | Pritom Ahmed, A. S. Islam, M. Sohel Rahman, A graph-theoretic model to solve the approximate string matching problem allowing for translocations, Journal of Discrete Algorithms, 23, 143-156, 2013. |
| 20. | Johra Muhammad Moosa, M. Sohel Rahman, F. T. Zohora, Computing a Longest Common Subsequence that is Almost Increasing on Sequences Having No Repeated Elements, Journal of Discrete Algorithms, Volume 20, 12-20, 2013. |
| 21. | Amit Kumar Dutta, Masud Hasan, M. Sohel Rahman, Prefix transpositions on binary and ternary strings, Information Processing Letters, 113(8), 265-270, 2013. |
| 22. | Muhammad Rashed Alam, M. Sohel Rahman, The substring inclusion constraint longest common subsequence problem can be solved in quadratic time, Journal of Discrete Algorithms, 17, 67-73, 2012. |
| 23. | Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz Rimpi, Indeterminate string inference algorithms, Journal of Discrete Algorithms, 10, 23-34, 2012. |
| 24. | J. W. Chan, C. S. Iliopoulos, S. Michalakopoulos, M. Sohel Rahman, Exact and Approximate Rhythm Matching Algorithms, International Journal on Digital Libraries, , , 2012. |
| 25. | S. B. Ahsan, T. M. Moosa, M. Sohel Rahman, Shampa Shahriyar, Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded, INFOCOMP Journal of Computer Science, 10(3), 48-55, 2011. |
| 26. | A. S. Islam, M. Sohel Rahman, On the protein folding problem in 2D-triangular lattices, Algorithms for Molecular Biology, 8(30), , 0000. |
| 27. | Frantisek Franek, A. S. Islam, M. Sohel Rahman, William Smyth, Algorithms to compute the Lyndon array, Prague Stringology Conference, , 172-184, 2016. |
| 28. | Md. Mahbubul Hasan, A. S. Islam, Mohammad Saifur Rahman, M. Sohel Rahman, Order Preserving Prefix Tables, International Symposium on String Processing and Information Retrieval (SPIRE), , 111-116, 2014. [paper link] |
| 29. | S.M. Ferdous, M. Sohel Rahman, Solving the Minimum Common String Partition Problem with the Help of Ants, International Conference on Swarm Intelligence (LNCS 7929), , 306-313, 2013. |
| 30. | Sumaiya Nazeen, Tanaeem M Moosa, M. Sohel Rahman, Rezwana Reaz Rimpi, Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet, WALCOM, , 160-172, 2012. |
| 31. | E. Farhana, M. Sohel Rahman, Efficient Algorithm for Restricted LCS Problem, 4th International Conference on Bioinformatics and Computational Biology (BiCOB), , 51-56, 2012. |
| 32. | S. B. Ahsan, T. M. Moosa, M. Sohel Rahman, Shampa Shahriyar, Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded (Conference, Mini-conference on Applied Theoretical Computer Science, MATCOS, , 366-369, 2010. |
| 33. | S.B. Ahsan, S.P. Aziz, M. Sohel Rahman, Longest Common Subsequence Problem for Run-Length-Encoded Strings, Journal of Computers, 9(8), 1769-1775, 2014. |
