Dr. M. Sohel Rahman (ডঃ মোহাম্মদ সোহেল রহমান) Professor Contact: Department of Computer Science and Engineering (CSE) Bangladesh University of Engineering and Technology (BUET) Telephone:Office: 88029665650/6107 Cell: 8801552389480 Residence: 88029665650/7606 Email: msrahman AT cse DOT buet DOT ac DOT bd, sohel.kcl AT gmail DOT com Homepage: http://msrahman.buet.ac.bd/ Research Area:Algorithms and Theory Bioinformatics and Computational Biology Systems and Networking Bioinformatics and Computational Biology
Research Interest: Algorithms
Strings
Bioinformatics
Musicology
Graph Theory
Netwroks
Academic Background: Ph.D.
King's College, University of London
M.Sc. in Computer Science and Engineering, 2004
Bangladesh University of Engineering and Technology
B.Sc. in Computer Science and Engineering, 2004
Bangladesh University of Engineering and Technology
Selected Publications: Journal Papers:
78. Mohammad Saifur Rahman, Swakkhar Shatabda, Sanjay Saha, M. Kaykobad, and M. Sohel Rahman, DPPPseAAC: A DNAbinding protein prediction model using Chou's general PseAAC. Journal of Theoretical Biology, Elsevier, 452(7), :2234, 2018 [paper link]. 
77. Mohammad Saifur Rahman, Md. Yusuf Sarwar Uddin, Tahmid Hasan, M. Sohel Rahman, and M. Kaykobad, Using Adaptive Heartbeat Rate on LongLived TCP Connections. IEEE/ACM TRANSACTIONS ON NETWORKING, IEEE, 26(1), :203216, 2018 [paper link]. 
76. Mohammad Saifur Rahman, Md. Khaledur Rahman, M. Kaykobad, and M. Sohel Rahman, isGPT: An optimized model to identify subGolgi protein types using SVM and Random Forest based feature selection. Artificial Intelligence in Medicine, Elsevier, 84:90100, 2018 [paper link]. 
75. Sumit Tarafder, Md. Toukir Ahmed, Sumaiya Iqbal, Md Tamjidul Hoque, and M. Sohel Rahman, RBSURFpred: Modeling Protein Accessible Surface Area in Real and Binary Space using
Regularized and Optimized Regression. Journal of Theoretical Biology, Elsevier, :To Appear, 2018 [paper link]. 
74. Md. Mahbubul Hasan, A. S. Islam, M. Sohel Rahman, and Ayon Sen, Palindromic Subsequence Automata and Longest Common Palindromic Subsequence. Mathematics in Computer Science, Springer, 11(2), :219–232, 2017 [paper link]. 
73. S. M. Ferdous, and M. Sohel Rahman, Solving the Minimum Common String Partition Problem with the Help of Ants. Mathematics in Computer Science, Springer, 11(2), :233–249, 2017 [paper link]. 
72. Md Mahfuzer Rahman, Ratul Sharker, Sajib Biswas, and M. Sohel Rahman, HaVec: An Efficient de Bruijn Graph Construction Algorithm for Genome Assembly. International Journal of Genomics, Hindawi, 2017:6120980, 2017 [paper link]. 
71. Md. Zahangir Alam, S. M. Niaz Arifin, Hasan Mohammad AlAmin, Mohammad Shafiul Alam, and M. Sohel Rahman, A spatial agentbased model of Anopheles vagus for malaria epidemiology: examining the impact of vector control interventions. BMC Malaria Journal, BMC, 16:432, 2017 [paper link]. 
70. Md. Khaledur Rahman, and M. Sohel Rahman, CRISPRpred: A flexible and efficient tool for sgRNAs ontarget activity prediction in CRISPR/Cas9 systems. PLOS One, PLOS, 12(8), :e0181943, 2017 [paper link]. 
69. Farshid Rayhan, Sajid Ahmed, Swakkhar Shatabda, Dewan Farid, Zaynab Mousavian, Abdollah Dehzangi, and M. Sohel Rahman, iDTIESBoost: Identification of Drug Target Interaction Using Evolutionary and Structural Features with Boosting. Scientific Reports, Nature publishing Group, 7:17731, 2017 [paper link]. 
68. S. M. Farhad, M. A. Nayeem, Md. Khaledur Rahman, and M. Sohel Rahman, Mapping stream programs onto multicore platforms by local search and genetic algorithm. Computer Languages, Systems and Structures, Elsevier, 46:182205, 2016 [paper link]. 
67. Johra Muhammad Moosa, Rameen Shakur, M. Kaykobad, and M. Sohel Rahman, Gene selection for cancer classification with the help of bees. BMC Medical Genomics, BioMed Central, 9(S2), 2016 
66. M. A. R. Azim, Costas S. Iliopoulos, M. Sohel Rahman, and M. Samiruzzaman, A Simple, Fast, FilterBased Algorithm for Approximate Circular Pattern Matching. IEEE Transactions on Nanobioscience, IEEE, 15(2), :93100, 2016 
65. 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, Institut für Informatik, JustusLiebigUniversität Giessen,Germany, 21(3), :131147, 2016 [paper link]. 
64. Ali Alatabbi, Jackie Daykin, Juha Kärkkäinen, M. Sohel Rahman, and William Smyth, Vorder: new combinatorial properties and a simple comparison algorithm. Discrete Applied Mathematics, Elsevier, 215:41 46, 2016 [paper link]. 
63. F. T. Zohora, and M. Sohel Rahman, "An efficient algorithm to detect common ancestor genes for nonoverlapping inversion and applications.". Theoretical Computer Science, 2016 
62. Ali Alatabbi, M. Sohel Rahman, and W.F. Smyth, Computing Covers Using Prefix Tables. Discrete Applied Mathematics, Elsevier, 212:29, 2016 
61. Ali Alatabbi, Alessio Langiu, and M. Sohel Rahman, Algorithms for Longest Common Abelian Factors. International Journal of Foundations of Computer Science, World Scientific, 27(5), :529544, 2016 [paper link]. 
60. Mohammad Saifur Rahman, Ali Alatabbi, Tanver Athar, Maxime Crochemore, and M. Sohel Rahman, Absent words and the (dis)similarity analysis of DNA sequences: An Experimental Study. BMC Research Notes, BioMed Central, 9(186), :18, 2016 [paper link]. 
59. Sumaiya Iqbal, M. Kaykobad, and M. Sohel Rahman, Solving the multiobjective Vehicle Routing Problem with Soft Time Windows with the help of bees. Swarm and Evolutionary Computation, Elsevier, 24(), :5064, 2015 
58. Md. Mahbubul Hasan, A. S. Islam, Mohammad Saifur Rahman, and M. Sohel Rahman, Order preserving pattern matching revisited. Pattern Recognition Letters, 55:1521, 2015 [paper link]. 
57. Ali Alatabbi, M. Sohel Rahman, and W.F. Smyth, Inferring an indeterminate string from a prefix graph. Journal of Discrete Algorithms, Elsevier, 32(), :613, 2015 
56. S.M.N. Arifin, R.R Arifin, D.A. Pitts, M. Sohel Rahman, Sara Nowreen, G.R. Madey, and F.H. Collins, Landscape Epidemiology Modeling Using an AgentBased Model and a Geographic Information System. Land, MDPI AG, Switzerland, 4(2), :378412, 2015 
55. Md. Khaledur Rahman, and M. Sohel Rahman, Prefix and suffix transreversals on binary and ternary strings. Journal of Discrete Algorithms, Elsevier, 33:160170, 2015 
54. Masud Hasan, Atif Hasan Rahman, Md. Khaledur Rahman, M. Sohel Rahman, Mahfuza Sharmin, and Rukhsana Yeasmin, Pancake flipping and sorting permutations. Journal of Discrete Algorithms, Elsevier, 33:139149, 2015 
53. S.M. Ferdous, and M. Sohel Rahman, An Integer Programming Formulation of the Minimum Common String Partition Problem. PLOS One, PLOS, 10(7), :e0130266, 2015 
52. Kishwar Shafin, Kazi Lutful Kabir, Iffatur Ridwan, Tasmiah Tamzid Anannya, Rashid Saadman Karim, Mohammad Mozammel Hoque, and M. Sohel Rahman, Impact of Heuristics in Clustering Large Biological Networks. Computational Biology and Chemistry, Elsevier, 59:2836, 2015 
51. Ahammed Ullah, Nasif Ahmed, Subrata Dey Pappu, Swakkhar Shatabda, A. Z. M. Dayem Ullah, and M. Sohel Rahman, Efficient conformational space exploration in ab initio protein folding simulation. Royal Society Open Science, Royal Society, 2:150238, 2015 
50. Rezaul Karim, Mohd. Momin Al Aziz, Swakkhar Shatabda, M. Sohel Rahman, Md. Abul Kashem Mia, and Farhana Zaman, CoMOGrad and PHOG: From Computer Vision to Fast and Accurate Protein Tertiary Structure Retrieval. Scientific Reports, Nature Publishing Group, 5(), :13275, 2015 
49. F. T. Zohora, and M. Sohel Rahman, Application of Consensus String Matching in the Diagnosis of Allelic Heterogeneity Involving Transposition Mutation. International Journal of Data Mining and Bioinformatics, Inderscience, 2015 
48. Effat Farhana, and M. Sohel Rahman, Constrained sequence analysis algorithms in computational biology. Information Sciences, Elsevier, 295:247257, 2015 
47. Ali Alatabbi, J. W. Daykin, M. Sohel Rahman, and W.F. Smyth, Simple Linear Comparison of Strings in VOrder. Fundamenta Informaticae, To Appear2015 
46. M. A. Nayeem, Md. Khaledur Rahman, and M. Sohel Rahman, Transit network design by genetic algorithm with elitism. Transportation Research Part C, Elsevier, 46:3045, 2014 
45. S.B. Ahsan, S.P Aziz, and M. Sohel Rahman, Longest Common Subsequence Problem for RunLengthEncoded Strings. Journal of Computers, Academy Publisher, 9(8), :17691775, 2014 
44. M. Tasnim, Shahriar Rouf, and M. Sohel Rahman, A CLONALGbased Approach for the Set Covering Problem. Journal of Computers, Academy Publisher, 9(8), :17871795, 2014 
43. 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), :17431754, 2014 
42. Dipan Shaw, A. S. Islam, M. Sohel Rahman, and Masud Hasan, Protein folding in HP model on hexagonal lattices with diagonals. BMC Bioinformatics, BMC, 15(S2), :S7, 2014 
41. 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 
40. M. Sohel Rahman, M. Kaykobad, and J. S. Firoz, New Sufficient Conditions for Hamiltonian Paths. The Scientific World Journal, 2014:ID: 743431, 2014 
39. Pritom Ahmed, Costas Iliopoulos, A. S. Islam, and M. Sohel Rahman, The swap matching problem revisited. Theoretical Computer Science, Elsevier, 557(6), :3449, 2014 
38. 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:1220, 2013 
37. M.T.I Aumi, M.T. Moosa, and M. Sohel Rahman, Pattern Matching in Indeterminate and ArcAnnotated Sequences. Recent Patents on DNA and Gene Sequences, Bentham Science, 7(2), :96104, 2013 
36. 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 
35. Pritom Ahmed, A. S. Islam, and M. Sohel Rahman, A graphtheoretic model to solve the approximate string matching problem allowing for translocations. Journal of Discrete Algorithms, Elsevier, 23:143156, 2013 
34. Deen Mohammad Abdullah, Wali Md Abdullah, and M. Sohel Rahman, Improving the Performance of a Genome Sorting Algorithm with Inverted BlockInterchange. Journal of Computers, 8(5), :11191126, 2013 
33. Muhammad Rashed Alam, and M. Sohel Rahman, A divide and conquer approach and a workoptimal parallel algorithm for the LIS problem. Information Processing Letters, 113(13), :470476, 2013 
32. Amit Kumar Dutta, Masud Hasan, and M. Sohel Rahman, Prefix transpositions on binary and ternary strings. Information Processing Letters, 113(8), :265270, 2013 
31. 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:6773, 2012 
30. Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, and M. Sohel Rahman, Computing a Longest Common Palindromic Subsequence. Fundamenta Informaticae, :1–12, 2012 
29. T. M. Moosa, and M. Sohel Rahman, Subquadratic Time and Linear Space Data Structures for Permutation Matching in Binary Strings. Journal of Discrete Algorithms, 10:59, 2012 
28. Sumaiya Nazeen, M. Sohel Rahman, and Rezwana Reaz Rimpi, Indeterminate string inference algorithms. Journal of Discrete Algorithms, 10:2334, 2012 
27. T. M. Moosa, and M. Sohel Rahman, Improved Algorithms for the PointSet Embeddability problem for Plane 3Trees. Discrete Mathematics, Algorithms and Applications (DMAA), 4(1), 2012 
26. M. Crochemore , C. Iliopoulos, M. Kubica, and M. Sohel Rahman, German Tischler and Tomasz Wallen. Improved Algorithms for the Range Next Value Problem and Applications. Theor. Comput. Sci., 434:2334, 2012 
25. J. W. Chan, C. S. Iliopoulos, S. Michalakopoulos, and M. Sohel Rahman, Exact and Approximate Rhythm Matching Algorithms. International Journal on Digital Libraries, 2012 
24. E. Farhana, and M. Sohel Rahman, DoublyConstrained LCS and HybridConstrained LCS Problems Revisited. Information Processing Letters, 112(13), :562565, 2012 
23. J.S. Firoz, Masud Hasan, A. Z. Khan, and M. Sohel Rahman, The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(nlog n)$ Time. Journal of Computational Biology, Mary Ann Liebert, Inc. publishers, USA, 18(8), :10071011, 2011 
22. Masud Hasan, S. M. S. Hossain, M. M. Rahman, and M. Sohel Rahman, Solving Minimum Hitting Set Problem and Generalized Exact Cover Problem with Light Based Devices. Int. Journ. of Unconventional Computing, 7(12), :125140, 2011 
21. 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), :4855, 2011 
20. C. S. Iliopoulos, M. Sohel Rahman, M. Voracek, and L. Vagner, Finite Automata Based Algorithms on Subsequences and Supersequences of Degenerate Strings. Journal of Discrete Algorithms, 8(2), :117130, 2010 
19. Masud Hasan, S. M. S. Hossain, M. M. Rahman, and M. Sohel Rahman, Solving the Generalized Subset Sum Problem with a Light Based Device. Natural Computing, 10(1), :541550, 2010 
18. T. M. Moosa, and M. Sohel Rahman, Indexing permutations for binary strings. Information Processing Letters, 110(1819), :795798, 2010 
17. C. S. Iliopoulos, M. Sohel Rahman, and W. Rytter, Algorithms for two versions of LCS problem for indeterminate strings. Journal of Combinatorial Mathematics and Combinatorial Computing, 71:155172, 2009 
16. C. S. Iliopoulos, and M. Sohel Rahman, Indexing factors with gaps. Algorithmica, 55(1), :6070, 2009 
15. C. S. Iliopoulos, and M. Sohel Rahman, A New Efficient Algorithm for Computing the Longest Common Subsequence. Theory of Computing Systems, 45(2), :355371, 2009 
14. A. Z. M. Shahriar, Md. Mostofa Akbar, M. Sohel Rahman, and M. A. H. Newton, A Multiprocessor based Heuristic for Multidimensional MultipleChoice Knapsack Problem. the Journal of Supercomputing, 43(3), :257280, 2008 
13. C. S. Iliopoulos, and M. Sohel Rahman, New efficient algorithms for the LCS and constrained LCS problems. Inf. Process. Lett., 106(1), :1318, 2008 
12. C. S. Iliopoulos, and M. Sohel Rahman, Faster index for property matching. Inf. Process. Lett., 105(6), :218223, 2008 
11. C. S. Iliopoulos, L. Mouchard, and M. Sohel Rahman, A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching. Mathematics in Computer Science (MCS), 1(4), :557569, 2008 
10. M. Christodoulakis, C. S. Iliopoulos, M. Sohel Rahman, and W. F. Smyth, Identifying rhythms in musical texts. Int. J. Found. Comput. Sci., 19(1), :3751, 2008 
9. C. S. Iliopoulos, and M. Sohel Rahman, Algorithms for computing variants of the longest common subsequence problem. Theor. Comput. Sci., 395(23), :255267, 2008 
8. M. Sohel Rahman, and M. Kaykobad, Complexities of some interesting problems on spanning trees. Information Processing Letters, Elsevier Science, 94(2), :9397, 2005 
7. M. Sohel Rahman, and M. Kaykobad, On Hamiltonian cycles and Hamiltonian paths. Information Processing Letters, Elsevier Science, 94(1), :3741, 2005 
6. Md. Mostofa Akbar, Eric G. Manning, M. Sohel Rahman, and M. Kaykobad, Optimal Server Selection for Content Routing. Computers and Their Applications, :259264, 2005 
5. Md. Mostofa Akbar, M. Sohel Rahman, M. Kaykobad, G Manning, and GC Shoja, Solving the Multidimensional Multiplechoice Knapsack Problem by constructing convex hulls. International Journal of Computers and Operations Research, 2004 
4. M. Sohel Rahman, and M. Kaykobad, Independence Number and Degree Bounded Spanning Tree. Appl. Math. ENotes, 4:122124, 2004 
3. M. A. R. Azim, Costas S. Iliopoulos, M. Sohel Rahman, and M. Samiruzzaman, SimpLiFiCPM: A Simple and Lightweight FilterBased Algorithm for Circular Pattern Matching. International Journal of Genomics, Hindawi, Volume 2015 (2015),:10 pages, 
2. A. S. Islam, and M. Sohel Rahman, On the protein folding problem in 2Dtriangular lattices. Algorithms for Molecular Biology, BMC, 8(30), 
1. Masud Hasan, T. M. Moosa, and M. Sohel Rahman, Cache Oblivious Algorithms for the RMQ and the RMSQ Problems. Mathematics in Computer Science (MCS), 3(4), :433442, 
Conference Papers:
70. M. A. R. Azim, Mohimenul Mahi, and M. Sohel Rahman, A simple, fast, filterbased algorithm for circular sequence comparison. In Proceedings of WALCOM, Springer, pages 12, 2018 
69. E M Wasifur Rahman Chowdhury, Mohammad Saifur Rahman, A. B. M. Alim Al Islam, and M. Sohel Rahman, Salty Secret: Let us secretly salt the secret. In Proceedings of 2017 International Conference on Networking, Systems and Security (NSysS), IEEE, Dhaka, pages 115123, 2017 [paper link]. 
68. Mohammad Saifur Rahman, Md. Yusuf Sarwar Uddin, M. Sohel Rahman, and M. Kaykobad, Using Adaptive Heartbeat rate on Longlived TCP Connections. In Proceedings of 2016 International Conference on Networking Systems and Security (NSysS 2016), IEEE, Dhaka, pages 1624, 2016 [paper link]. 
67. Dipan Shaw, A. S. Islam, Shuvasish Karmaker, and M. Sohel Rahman, Approximation Algorithms for Three Dimensional Protein Folding. In Proceedings of WALCOM, Springer, Nepal, pages 274285, 2016 
66. 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 172184, 2016 
65. Md. Khaledur Rahman, M. A. Nayeem, and M. Sohel Rahman, Transit Network Design by Hybrid Guided Genetic Algorithm With Elitism. In Proceedings of 13th Conference on Advanced Systems in Public Transport, Rotterdam, Netherlands, 2015 
64. M. A. R. Azim, Costas S. Iliopoulos, M. Sohel Rahman, and M. Samiruzzaman, A FilterBased Approach for Approximate Circular Pattern Matching. In Proceedings of ISBRA, Springer, Norfolk, VA, USA, pages 2435, 2015 
63. 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 111116, 2014 [paper link]. 
62. M. A. R. Azim, Costas S. Iliopoulos, M. Sohel Rahman, and M. Samiruzzaman, A fast and lightweight filterbased algorithm for circular pattern matching. In Proceedings of ACM BCB, ACM, Newport Beach, California, USA, pages 621622, 2014 
61. F. T. Zohora, and M. Sohel Rahman, Application of Consensus String Matching in the Diagnosis of Allelic Heterogeneity. In Proceedings of International Symposium on Bioinformatics Research and Applications (ISBRA 2014), Springer, Zhangjiajie, China, 2014 
60. Mohammad Raihanul Islam, and M. Sohel Rahman, An Improved Intelligent Water Drop Algorithm for a RealLife Waste Collection Problem. In Proceedings of International Conference on Swarm Intelligence (LNCS 7929), Springer, China, pages 472479, 2013 
59. 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 306313, 2013 
58. S. K. K. Santu, S. Rahman, Saikat Chakraborty , and M. Sohel Rahman, PIssGA: An ultra fast metaheuristic approach to solve protein inference problem. In Proceedings of 16th International Conference on Computer and Information Technology (ICCIT), 2013 
57. S. Mehnaz, and M. Sohel Rahman, Pairwise Compatibility Graphs Revisited. In Proceedings of ICIEV, Dhaka, Bangladesh, 2013 
56. S.M. Ferdous, Anindya Das, M. Sohel Rahman, and Md. Mustafizur Rahman, An Ant Colony Optimization approach to solve the Minimum String Cover Problem. In Proceedings of 1st IEEE/OSA/IAPR International Conference on Informatics, Electronics and Vision, Dhaka, Bangladesh, pages 741746, 2012 
55. Sumaiya Iqbal, and M. Sohel Rahman, VEHICLE ROUTING PROBLEMS WITH SOFT TIME WINDOWS. In Proceedings of ICECE, 2012 
54. Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, and M. Sohel Rahman, Computing a Longest Common Palindromic Subsequence. In Proceedings of IWOCA, 2012 
53. 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 160172, 2012 
52. 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 5156, 2012 
51. Mahfuza Sharmin, M. Afrin, and M. Sohel Rahman, Local Search Techniques for Placing Unique Restriction Sites in Synthetic Genomes. In Proceedings of 4th International Conference on Bioinformatics and Computational Biology (BiCOB), pages 1318, 2012 
50. J. S. Firoz, M. Sohel Rahman, and T. K. Saha, Bee Algorithms for Solving DNA Fragment Assembly Problem with Noisy and Noiseless data. In Proceedings of GECCO, 2012 
49. T. M. Moosa, and M. Sohel Rahman, mproved Algorithms for the PointSet Embeddability Problem for Plane 3Trees. In Proceedings of 17th Annual International Conference, COCOON, 2011 
48. M. T. I. Aumi, T. M. Moosa, and M. Sohel Rahman, Fast Algorithms for Finding Patterns in Indeterminate and ArcAnnotated Sequences. In Proceedings of 14th International Conference on Computer and Information Technology (ICCIT), pages 71  76, 2011 
47. M.R Islam, M. Sohel Rahman, Masud Hasan, and M.M. Hasan, IMIPS: An improved pipelined processor architecture with reduced branch penalty and single memory for instruction and data. In Proceedings of International International Conference on Computer Engineering and Applications (, Bali Island, Indonesia, 2010 
46. J. S. Firoz, Masud Hasan, A. Z. Khan, and M. Sohel Rahman, The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time (Conference. In Proceedings of WALCOM, 2010 
45. M. R. Hasan, M. Sohel Rahman, Masud Hasan, M. M. Hasan, and M. A. Ali, An Improved Pipelined Processor Architecture Eliminating Branch and Jump Penalty. In Proceedings of Second International Conference on Computer Engineering and Applications, pages 621625, 2010 
44. Md. Shahrear Iqbal, M. F. Bari, and M. Sohel Rahman, Solving the multidimensional multichoice knapsack problem with the help of ants. In Proceedings of ANTS, pages 312323, 2010 
43. E. Farhana, J. Ferdous, T. M. Moosa, and M. Sohel Rahman, Algorithms for the Generalized Constrained Longest Common Subsequence Problems. In Proceedings of String Processing and Information Retrieval  17th International Symposium, SPIRE, pages 243249, 2010 
42. 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 Miniconference on Applied Theoretical Computer Science, MATCOS, pages 366369, 2010 
41. Mahfuza Sharmin, R. Yeasmin, Masud Hasan, A. Rahman, and M. Sohel Rahman, Pancake Flipping with Two Spatulas. In Proceedings of ISCO 2010 Proceedings: Electronic Notes in Discrete Mathematics, pages 231238, 2010 
40. S. M. S. Hossain, M. M. Rahman, and M. Sohel Rahman, Solving a Generalized Version of the Exact Cover Problem with a LightBased Device. In Proceedings of Optical Supercomputing  Third International Workshop, 2010 
39. M. Crochemore, Masud Hasan, T. M. Moosa, and M. Sohel Rahman, Two dimensional Range Minimum/Maximum Query revisited. In Proceedings of 13th International Conference on Computer and Information Technology (ICCIT), pages 27  32, 2010 
38. Masud Hasan, S. M. S. Hossain, M. M. Rahman, and M. Sohel Rahman, Solving Minimum Hitting Set Problem with a LightBased Device. In Proceedings of International Conference on Electrical and Computer Engineering (ICECE), pages 423  426, 2010 
37. M. M. Rasheed, Masud Hasan, and M. Sohel Rahman, Maximum Neighbour Voronoi Games. In Proceedings of WALCOM, pages 93104, 2009 
36. Masud Hasan, S. Hossain, M. M. Rahman, and M. Sohel Rahman, An Optical Solution for the Subset Sum Problem. In Proceedings of the Fourth International Workshop on Natural Computing (IWNC), pages 165173, 2009 
35. R. Hasan, and M. Sohel Rahman, Computing a solution for the Subset Sum Problem with a Light Based Device. In Proceedings of he Second International Workshop on Optical Super Computing (OSC), 2009 
34. Md. Muhibur Rasheed, Masud Hasan, and M. Sohel Rahman, Maximum neighbor Voronoi games. In Proceedings of Annual Workshop on Algorithms and Computation (WALCOM 2009), LNCS, Kolkata, India, 2008 
33. M. Crochemore, C. S. Iliopoulos, M. Kubica, M. Sohel Rahman, and T. Walen, Improved algorithms for the range next value problem and applications. In Proceedings of Dagstuhl Seminar Proceedings, pages 205216, 2008 
32. C. S. Iliopoulos, and M. Sohel Rahman, A new model to solve the swap matching problem and efficient algorithms for short patterns. In Proceedings of SOFSEM, pages 316327, 2008 
31. J. W. Chan, C. S. Iliopoulos, S. Michalakopoulos , and M. Sohel Rahman, Erratic Dancing. In Proceedings of 5th International Symposium on Computer Music Modeling and Retrieval (CMMR 2008), 2008 
30. T. Flouri, C. S. Iliopoulos, M. Sohel Rahman, L. Vagner, and M. Vor?cek, Indexing factors in dna/rna sequences. In Proceedings of Communications in Computer and Information Science, pages 436445, 2008 
29. P. Antoniou, C. S. Iliopoulos, I. Jayasekera, and M. Sohel Rahman, Implementation of a swap matching algorithm using a graph theoretic model. In Proceedings of Communications in Computer and Information Science, pages 446455, 2008 
28. M. Sohel Rahman, C. S. Iliopoulos, and L. Mouchard, Pattern matching in degenerate dna/rna sequences. In Proceedings of WALCOM, 2007 
27. C. S. Iliopoulos, M. Sohel Rahman, M. Voracek, and L. Vagner, Computing constrained longest common subsequence for degenerate strings using finite automata. In Proceedings of ACiD, 2007 
26. C. S. Iliopoulos, and M. Sohel Rahman, New efficient algorithms for LCS and constrained LCS problem. In Proceedings of ACiD, pages 116126, 2007 
25. A. L. P. Chan, C. S. Iliopoulos, S. Michalakopoulos, and M. Sohel Rahman, Implementation of algorithms to classify musical texts according to rhythms. In Proceedings of SMC, pages 134141, 2007 
24. C. S. Iliopoulos, M. Sohel Rahman, M. Voracek, and L. Vagner, The Constrained Longest Common Subsequence Problem for Degenerate Strings. In Proceedings of CIAA, 2007 
23. M. Sohel Rahman, and C. S. Iliopoulos, A new efficient algorithm for computing the longest common subsequence (Conference. In Proceedings of AAIM, 2007 
22. M. Sohel Rahman, and C. S. Iliopoulos, Indexing factors with gaps (conference. In Proceedings of SOFSEM, 2007 
21. C. S. Iliopoulos, M. Kubica, M. Sohel Rahman, and T. Walen, Algorithms for computing the longest parameterized common subsequence. In Proceedings of CPM, 2007 
20. M. Crochemore, C. S. Iliopoulos, and M. Sohel Rahman, Optimal prefix and suffix queries on texts. In Proceedings of DMTCS, 2007 
19. M. Crochemore, C. S. Iliopoulos, and M. Sohel Rahman, Finding patterns in given intervals (conference_Edited. In Proceedings of MFCS, 2007 
18. C. S. Iliopoulos, M. Sohel Rahman, and W. Rytter, Algorithms for two versions of LCS problem for indeterminate strings (Conference. In Proceedings of International Workshop on Combinatorial Algorithms (IWOCA), 2007 
17. M. Christodoulakis, C. S. Iliopoulos, M. Sohel Rahman, and W. F. Smyth, Song classifications for dancing. In Proceedings of Stringology, 2006 
16. M. Sohel Rahman, and C. S. Iliopoulos, Algorithms for computing variants of the longest common subsequence problem (Conference. In Proceedings of ISAAC, 2006 
15. Md. Mostofa Akbar, M. Sohel Rahman, E. Manning, and G. Shoja, Distrbuted Utility Model for Distributed Multimedia Server Systems. In Proceedings of Proceedings of Design, Analysis, and Simulation of Distributed Systems (DASD), Spring Simulation Multiconference, San Diego, California, USA,, pages 148155, 2005 
14. Md. Mostofa Akbar, E. G. Manning, G. C. Shoja, and M. Sohel Rahman, Optimal Server Selection for Content Routing (Conference. In Proceedings of 20th International Conference on Computers and Their Applications (CATA 2005), pages 259264, 2005 
13. Md. Mostofa Akbar, M. Sohel Rahman, E. G. Manning , and G. C. Shoja, Distributed Utility Model for Distributed Multimedia Server Systems. In Proceedings of Proceedings of Design, Analysis, and Simulation of Distributed Systems (DASD), pages 148155, 2005 
12. R. S. Roy, and M. Sohel Rahman, On Communicating with Agents on the Network. In Proceedings of ICDCIT, 2005 
11. M. Sohel Rahman, M. Kaykobad, and Mohammad Saifur Rahman, A New Sufficient Condition for the Existence of Hamiltonian Paths. In Proceedings of 0th International Conference on Computers and Their Applications (CATA), 2005 
10. M. Sohel Rahman, and M. Kaykobad, Set Version: A New Notion and Results (Conference. In Proceedings of Proceedings of the Information Society, 2004, 7th MultiConference, Subconference: Theoretical Computer Science, 2004 
9. M. Sohel Rahman, and Md. Abul Kashem Mia, An Efficient Algorithm for Finding an Independency Tree. In Proceedings of 7th International Conference on Computer and Information Technology (ICCIT), 2004 
8. M. Sohel Rahman, and Md. Abul Kashem Mia, Degree Restricted Spanning Trees of Graphs. In Proceedings of 19th ACM Symposium of Applied Computing (SAC), pages 225228, 2004 
7. M. Sohel Rahman, and M. Kaykobad, Set Version: A New Notion and Results. In Proceedings of Information Society, 2004, 7th MultiConference, Subconference: Theoretical Computer Science, Slovenija, 2004 
6. M. Sohel Rahman, M. Kaykobad, and Md. Mostofa Akbar, Independence Number and Hamiltonicity of Graphs (Conference. In Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), pages 150152, 2003 
5. M. Sohel Rahman, and M. Kaykobad, On Hamiltonian Cycles and Hamiltonian Paths (Conference. In Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), pages 185187, 2003 
4. M. Sohel Rahman, M. Kaykobad, and Md. Mostofa Akbar, Independence Number and Hamiltonicity of Graphs. In Proceedings of Computer and Information Technology (ICCIT), pages 150152, 2003 
3. M. Kaykobad, and M. Sohel Rahman, On Spanning Trees with restricted Number of Leaves. In Proceedings of International Conference on Computer and Information Technology, pages 5354, 2002 
2. M. Kaykobad, Asiful Haque , Mohammad Saifur Rahman, and M. Sohel Rahman, On Average Length of Cycle in a Complete Graph. In Proceedings of International Conference on Computer and Information Technology, pages 4749, 2002 
1. A. H. Tamal, M. S. Rahman, M. Sohel Rahman, and M. Kaykobad, On Average Length of Cycles in Complete Graphs. In Proceedings of 5th International Conference on Computer and Information Technology (ICCIT), pages 4749, 2002 
