>> Information For:   |   Prospective Students   |   Current Students   |   Alumni   |   Industry & Government   |   Faculty Members
Username : Password : Forgot password?
 Research Detail:


  Algorithms and Theory >Stringology:
  Recent Publications:

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

Department of Computer Science and Engineering, ECE building, Palashi, Dhaka, Bangladesh. The Department is part of the Faculty of Electrical and Electronic Engineering at the Bangladesh University of Engineering & Technology. No part or content of this website may be copied or reproduced without permission of the department authority. Contact info@cse.buet.ac.bd with questions or comments on this page.  [Development Credits]