Mohammad Sohel Rahman

According to our database1, Mohammad Sohel Rahman authored at least 145 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
MultiResUNet : Rethinking the U-Net architecture for multimodal biomedical image segmentation.
Neural Networks, 2020

Not Low-Resource Anymore: Aligner Ensembling, Batch Filtering, and New Datasets for Bengali-English Machine Translation.
CoRR, 2020

COVID-19Base: A knowledgebase to explore biomedical entities related to COVID-19.
CoRR, 2020

PPG2ABP: Translating Photoplethysmogram (PPG) Signals to Arterial Blood Pressure (ABP) Waveforms using Fully Convolutional Neural Networks.
CoRR, 2020

CRISPRpred(SEQ): a sequence-based method for sgRNA on target activity prediction using traditional machine learning.
BMC Bioinform., 2020

Agree-to-Disagree (A2D): A Deep Learning-Based Framework for Authorship Discrimination Task in Corpus-Specificity Free Manner.
IEEE Access, 2020

Not Low-Resource Anymore: Aligner Ensembling, Batch Filtering, and New Datasets for Bengali-English Machine Translation.
Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, 2020

2019
A heuristic aided Stochastic Beam Search algorithm for solving the transit network design problem.
Swarm Evol. Comput., 2019

Guest Editors' Foreword.
J. Graph Algorithms Appl., 2019

Neural Network Based Undersampling Techniques.
CoRR, 2019

Improving Malaria Parasite Detection from Red Blood Cell using Deep Convolutional Neural Networks.
CoRR, 2019

Prefix Block-Interchanges on Binary and Ternary Strings.
CoRR, 2019

Protein structure prediction from inaccurate and sparse NMR data using an enhanced genetic algorithm.
Comput. Biol. Chem., 2019

VFPred: A fusion of signal processing and machine learning techniques in detecting ventricular fibrillation from ECG signals.
Biomed. Signal Process. Control., 2019

Antigenic: An improved prediction model of protective antigens.
Artif. Intell. Medicine, 2019

A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Automatic Summarization of Scientific Articles from Biomedical Domain.
Proceedings of International Joint Conference on Computational Intelligence, 2019

A 'phylogeny-aware' multi-objective optimization approach for computing MSA.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

2018
Using Adaptive Heartbeat Rate on Long-Lived TCP Connections.
IEEE/ACM Trans. Netw., 2018

An ensemble learning based approach for impression fraud detection in mobile advertising.
J. Netw. Comput. Appl., 2018

Approximation Algorithms for Three Dimensional Protein Folding.
Fundam. Informaticae, 2018

Deep Face Image Retrieval: a Comparative Study with Dictionary Learning.
CoRR, 2018

Multidimensional segment trees can do range queries and updates in logarithmic time.
CoRR, 2018

isGPT: An optimized model to identify sub-Golgi protein types using SVM and Random Forest based feature selection.
Artif. Intell. Medicine, 2018

On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

A Faster V-order String Comparison Algorithm.
Proceedings of the Prague Stringology Conference 2018, 2018

2017
Palindromic Subsequence Automata and Longest Common Palindromic Subsequence.
Math. Comput. Sci., 2017

Solving the Minimum Common String Partition Problem with the Help of Ants.
Math. Comput. Sci., 2017

iDTI-ESBoost: Identification of Drug Target Interaction Using Evolutionary and Structural Features with Boosting.
CoRR, 2017

Salty Secret: Let us secretly salt the secret.
Proceedings of the International Conference on Networking, Systems and Security, 2017

Searching and Indexing Circular Patterns.
Proceedings of the Algorithms for Next-Generation Sequencing Data, Techniques, 2017

2016
An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications.
Theor. Comput. Sci., 2016

Guest Editors' Foreword.
J. Graph Algorithms Appl., 2016

Special issue on WALCOM 2015.
J. Discrete Algorithms, 2016

Enhanced Covers of Regular and Indeterminate Strings Using Prefix Tables.
J. Autom. Lang. Comb., 2016

Algorithms for Longest Common Abelian Factors.
Int. J. Found. Comput. Sci., 2016

Computing covers using prefix tables.
Discret. Appl. Math., 2016

V-Order: New combinatorial properties & a simple comparison algorithm.
Discret. Appl. Math., 2016

A novel and effective scoring scheme for structure classification and pairwise similarity measurement.
CoRR, 2016

Mapping stream programs onto multicore platforms by local search and genetic algorithm.
Comput. Lang. Syst. Struct., 2016

Algorithms to Compute the Lyndon Array.
Proceedings of the Prague Stringology Conference 2016, 2016

Using adaptive heartbeat rate on long-lived TCP connections.
Proceedings of the International Conference on Networking Systems and Security, 2016

2015
Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees.
Swarm Evol. Comput., 2015

Order preserving pattern matching revisited.
Pattern Recognit. Lett., 2015

Prefix and suffix transreversals on binary and ternary strings.
J. Discrete Algorithms, 2015

Pancake flipping and sorting permutations.
J. Discrete Algorithms, 2015

Inferring an indeterminate string from a prefix graph.
J. Discrete Algorithms, 2015

Constrained sequence analysis algorithms in computational biology.
Inf. Sci., 2015

Application of consensus string matching in the diagnosis of allelic heterogeneity involving transposition mutation.
Int. J. Data Min. Bioinform., 2015

Simple Linear Comparison of Strings in V-order.
Fundam. Informaticae, 2015

Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables.
CoRR, 2015

String Comparison in V-Order: New Lexicographic Properties & On-line Applications.
CoRR, 2015

Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array.
CoRR, 2015

Impact of heuristics in clustering large biological networks.
Comput. Biol. Chem., 2015

FGPGA: An efficient genetic approach for producing feasible graph partitions.
Proceedings of the International Conference on Networking Systems and Security, 2015

A metaheuristic approach for application partitioning in mobile system.
Proceedings of the International Conference on Networking Systems and Security, 2015

SimpLiSMS: A Simple, Lightweight and Fast Approach for Structured Motifs Searching.
Proceedings of the Bioinformatics and Biomedical Engineering, 2015

New Heuristics for Clustering Large Biological Networks.
Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

A Filter-Based Approach for Approximate Circular Pattern Matching.
Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

2014
The swap matching problem revisited.
Theor. Comput. Sci., 2014

A CLONALG-based Approach for the Set Covering Problem.
J. Comput., 2014

Effective Sparse Dynamic Programming Algorithms for Merged and Block Merged LCS Problems.
J. Comput., 2014

Longest Common Subsequence Problem for Run-Length-Encoded Strings.
J. Comput., 2014

Computing a Longest Common Palindromic Subsequence.
Fundam. Informaticae, 2014

Protein Folding in the Hexagonal Prism Lattice with Diagonals.
CoRR, 2014

CoMOGrad and PHOG: From Computer Vision to Fast and Accurate Protein Tertiary Structure Retrieval.
CoRR, 2014

An Integer Programming Formulation of the Minimum Common String Partition problem.
CoRR, 2014

A MAX-MIN Ant Colony System for Minimum Common String Partition Problem.
CoRR, 2014

Protein folding in HP model on hexagonal lattices with diagonals.
BMC Bioinform., 2014

Simple Linear Comparison of Strings in V-Order - (Extended Abstract).
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Order Preserving Prefix Tables.
Proceedings of the String Processing and Information Retrieval, 2014

Application of Consensus String Matching in the Diagnosis of Allelic Heterogeneity - (Extended Abstract).
Proceedings of the Bioinformatics Research and Applications - 10th International Symposium, 2014

GreMuTRRR: A novel genetic algorithm to solve distance geometry problem for protein structures.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

A fast and lightweight filter-based algorithm for circular pattern matching.
Proceedings of the 5th ACM Conference on Bioinformatics, 2014

2013
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements.
J. Discrete Algorithms, 2013

A graph-theoretic model to solve the approximate string matching problem allowing for translocations.
J. Discrete Algorithms, 2013

Improving the Performance of a Genome Sorting Algorithm with Inverted Block-Interchange.
J. Comput., 2013

Prefix transpositions on binary and ternary strings.
Inf. Process. Lett., 2013

A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem.
Inf. Process. Lett., 2013

Bipartite Graphs, Hamiltonicity and Z graphs.
Electron. Notes Discret. Math., 2013

Inferring Strings from Cover Arrays.
Discret. Math. Algorithms Appl., 2013

On the protein folding problem in 2D-triangular lattices.
Algorithms Mol. Biol., 2013

On Palindromic Sequence Automata and Applications.
Proceedings of the Implementation and Application of Automata, 2013

An Improved Intelligent Water Drop Algorithm for a Real-Life Waste Collection Problem.
Proceedings of the Advances in Swarm Intelligence, 4th International Conference, 2013

Degenerate String Reconstruction from Cover Arrays.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Maximal Palindromic Factorization.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Protein Folding in 2D-Triangular Lattice Revisited - (Extended Abstract).
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
Improved algorithms for the range next value problem and applications.
Theor. Comput. Sci., 2012

Exact and approximate rhythm matching algorithms.
Int. J. Digit. Libr., 2012

Indeterminate string inference algorithms.
J. Discrete Algorithms, 2012

Sub-quadratic time and linear space data structures for permutation matching in binary strings.
J. Discrete Algorithms, 2012

The substring inclusion constraint longest common subsequence problem can be solved in quadratic time.
J. Discrete Algorithms, 2012

Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited.
Inf. Process. Lett., 2012

Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees.
Discret. Math. Algorithms Appl., 2012

Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet - (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Bee algorithms for solving DNA fragment assembly problem with noisy and noiseless data.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Placement of unique restriction sites in synthetic genomes using multi-objective optimization.
Proceedings of the 2012 IEEE International Conference on Bioinformatics and Biomedicine, 2012

2011
Solving the generalized Subset Sum problem with a light based device.
Nat. Comput., 2011

The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in <i>O</i>(<i>n</i> log <i>n</i>) Time.
J. Comput. Biol., 2011

Solving Minimum Hitting Set Problem and Generalized Exact Cover Problem with Light Based Devices.
Int. J. Unconv. Comput., 2011

Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet
CoRR, 2011

2010
Cache Oblivious Algorithms for the RMQ and the RMSQ Problems.
Math. Comput. Sci., 2010

Finite automata based algorithms on subsequences and supersequences of degenerate strings.
J. Discrete Algorithms, 2010

Indexing permutations for binary strings.
Inf. Process. Lett., 2010

Finding Patterns In Given Intervals.
Fundam. Informaticae, 2010

Pancake Flipping with Two Spatulas.
Electron. Notes Discret. Math., 2010

Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems.
Proceedings of the String Processing and Information Retrieval, 2010

Solving a Generalized Version of the Exact Cover Problem with a Light-Based Device.
Proceedings of the Optical Supercomputing - Third International Workshop, 2010

Solving the Multi-dimensional Multi-choice Knapsack Problem with the Help of Ants.
Proceedings of the Swarm Intelligence - 7th International Conference, 2010

2009
A New Efficient Algorithm for Computing the Longest Common Subsequence.
Theory Comput. Syst., 2009

The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time
CoRR, 2009

Indexing Factors with Gaps.
Algorithmica, 2009

Maximum Neighbour Voronoi Games.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Finding All Covers of an Indeterminate String in O(n) Time on Average.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Computing a Solution for the Subset Sum Problem with a Light Based Device.
Proceedings of the Optical SuperComputing, Second International Workshop, 2009

An Optical Solution for the Subset Sum Problem.
Proceedings of the Natural Computing - 4th International Workshop on Natural Computing, 2009

2008
A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem.
J. Supercomput., 2008

Algorithms for computing variants of the longest common subsequence problem.
Theor. Comput. Sci., 2008

A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching.
Math. Comput. Sci., 2008

New efficient algorithms for the LCS and constrained LCS problems.
Inf. Process. Lett., 2008

Faster index for property matching.
Inf. Process. Lett., 2008

Optimal prefix and suffix queries on texts.
Inf. Process. Lett., 2008

Identifying Rhythms in Musical Texts.
Int. J. Found. Comput. Sci., 2008

Indexing Circular Patterns.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Improved Algorithms for the Range Next Value Problem and Applications.
Proceedings of the STACS 2008, 2008

A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Indexing Factors in DNA/RNA Sequences.
Proceedings of the Bioinformatics Research and Development, 2008

Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model.
Proceedings of the Bioinformatics Research and Development, 2008

2007
Fast and efficient algorithms on strings and sequences.
PhD thesis, 2007

The Constrained Longest Common Subsequence Problem for Degenerate Strings.
Proceedings of the Implementation and Application of Automata, 2007

Pattern Matching in Degenerate DNA/RNA Sequences.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007

Pattern Matching Algorithms with Don't Cares.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Finding Patterns in Given Intervals.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Algorithms for Computing the Longest Parameterized Common Subsequence.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls.
Comput. Oper. Res., 2006

Song classifications for dancing.
Proceedings of the Prague Stringology Conference, 2006

Finding Patterns with Variable Length Gaps or Don't Cares.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Complexities of some interesting problems on spanning trees.
Inf. Process. Lett., 2005

On Hamiltonian cycles and Hamiltonian paths.
Inf. Process. Lett., 2005

On Communicating with Agents on the Network.
Proceedings of the Distributed Computing and Internet Technology, 2005

A New Sufficient Condition for the Existence of Hamiltonian Paths.
Proceedings of the 20th International Conference on Computers and Their Applications, 2005

Optimal Server Selection for Content Routing.
Proceedings of the 20th International Conference on Computers and Their Applications, 2005

2004
Degree restricted spanning trees of graphs.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004


  Loading...