2 citations · 4 across the 8 of their papers we have counts for
3 papers · 1 filter
An Algorithm for Computing Longest Common Cyclic Subsequence
Shihabur Rahman Chowdhury, Masud Hasan, Sumaiya Iqbal +1
The {\em longest common subsequence (LCS)} problem is a classic and well-studied problem in computer science. LCS is a central problem in stringology and finds broad applications i…
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in Time
Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan +1
Sorting a Permutation by Transpositions (SPbT) is an important problem in Bioinformtics. In this paper, we improve the running time of the best known approximation algorithm for SP…
Cutting a Convex Polyhedron Out of a Sphere
Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam
Given a convex polyhedron of vertices inside a sphere , we give an -time algorithm that cuts out of by using guillotine cuts and has cutting cost $O((\lo…