Search the dblp DataBase

Publications of Author

1. M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth
   Finding Patterns with Variable Length Gaps or Don't Cares. [Citation Graph (0, 0)][DBLP]
   COCOON, 2006, pp:146-155 [Conf]
   
2. M. Sohel Rahman, Costas S. Iliopoulos
   Algorithms for Computing Variants of the Longest Common Subsequence Problem. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2006, pp:399-408 [Conf]
   
3. M. Sohel Rahman, Costas S. Iliopoulos
   Pattern Matching Algorithms with Don't Cares. [Citation Graph (0, 0)][DBLP]
   SOFSEM (2), 2007, pp:116-126 [Conf]
   
4. M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mouchard
   Pattern Matching in Degenerate DNA/RNA Sequences. [Citation Graph (0, 0)][DBLP]
   WALCOM, 2007, pp:109-120 [Conf]
   
5. M. Sohel Rahman, Costas S. Iliopoulos
   A New Efficient Algorithm for Computing the Longest Common Subsequence. [Citation Graph (0, 0)][DBLP]
   AAIM, 2007, pp:82-90 [Conf]
   
6. Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen
   Algorithms for Computing the Longest Parameterized Common Subsequence. [Citation Graph (0, 0)][DBLP]
   CPM, 2007, pp:265-273 [Conf]
   
7. Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman
   Finding Patterns in Given Intervals. [Citation Graph (0, 0)][DBLP]
   MFCS, 2007, pp:645-656 [Conf]
   
8. M. Sohel Rahman, Costas S. Iliopoulos
   Indexing Factors with Gaps. [Citation Graph (0, 0)][DBLP]
   SOFSEM (1), 2007, pp:465-474 [Conf]
   
9. Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner
   The Constrained Longest Common Subsequence Problem for Degenerate Strings. [Citation Graph (0, 0)][DBLP]
   CIAA, 2007, pp:309-311 [Conf]
   
10. 
    A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. [Citation Graph (, )][DBLP]
    
    
11. 
    Maximum Neighbour Voronoi Games. [Citation Graph (, )][DBLP]
    
    
12. 
    Indexing Circular Patterns. [Citation Graph (, )][DBLP]
    
    
13. 
    The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. [Citation Graph (, )][DBLP]
    
    
14. 
    Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model. [Citation Graph (, )][DBLP]
    
    
15. 
    Computing a Solution for the Subset Sum Problem with a Light Based Device. [Citation Graph (, )][DBLP]
    
    
16. 
    Indexing Factors with Gaps. [Citation Graph (, )][DBLP]
    
    
17. 
    The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time [Citation Graph (, )][DBLP]
    
    
18. 
    An $O(n^2)$ Algorithm for Computing Longest Common Cyclic Subsequence [Citation Graph (, )][DBLP]