The following pages link to M. Sohel Rahman (Q300247):
Displaying 50 items.
- The swap matching problem revisited (Q300248) (← links)
- Computing covers using prefix tables (Q313747) (← links)
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm (Q323035) (← links)
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
- A graph-theoretic model to solve the approximate string matching problem allowing for translocations (Q396701) (← links)
- Indexing permutations for binary strings (Q407548) (← links)
- Sub-quadratic time and linear space data structures for permutation matching in binary strings (Q414411) (← links)
- Indeterminate string inference algorithms (Q414420) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← links)
- Doubly-constrained LCS and hybrid-constrained LCS problems revisited (Q436604) (← links)
- Pancake flipping and sorting permutations (Q491630) (← links)
- Prefix and suffix transreversals on binary and ternary strings (Q491633) (← links)
- An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications (Q507397) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- Solving the generalized subset sum problem with a light based device (Q537835) (← links)
- Cache oblivious algorithms for the RMQ and the RMSQ problems (Q626901) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching (Q942989) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- On Hamiltonian cycles and Hamiltonian paths (Q1041720) (← links)
- Complexities of some interesting problems on spanning trees (Q1041729) (← links)
- RBSURFpred: modeling protein accessible surface area in real and binary space using regularized and optimized regression (Q1635544) (← links)
- A simple, fast, filter-based algorithm for circular sequence comparison (Q1641118) (← links)
- On multiple longest common subsequence and common motifs with gaps (extended abstract) (Q1641122) (← links)
- Computing the longest common almost-increasing subsequence (Q2166775) (← links)
- QT-GILD: Quartet based gene tree imputation using deep learning improves phylogenomic analyses despite missing data (Q2170142) (← links)
- Multidimensional segment trees can do range updates in poly-logarithmic time (Q2220857) (← links)
- A linear time algorithm for the \(r\)-gathering problem on the line (extended abstract) (Q2327522) (← links)
- Applications of \(V\)-order: suffix arrays, the Burrows-Wheeler transform \& the FM-index (Q2327532) (← links)
- Inferring an indeterminate string from a prefix graph (Q2343296) (← links)
- Palindromic subsequence automata and longest common palindromic subsequence (Q2363997) (← links)
- Solving the minimum common string partition problem with the help of ants (Q2363999) (← links)
- The substring inclusion constraint longest common subsequence problem can be solved in quadratic time (Q2376791) (← links)
- Prefix transpositions on binary and ternary strings (Q2377235) (← links)
- Faster index for property matching (Q2380078) (← links)
- Indexing factors with gaps (Q2391183) (← links)
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738) (← links)
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024) (← links)
- A linear time algorithm for the \(r\)-gathering problem on the line (Q2662686) (← links)
- Simple Linear Comparison of Strings in V-order* (Q2805461) (← links)
- Algorithms for Longest Common Abelian Factors (Q2833540) (← links)
- INFERRING STRINGS FROM COVER ARRAYS (Q2846478) (← links)
- Protein Folding in 2D-Triangular Lattice Revisited (Q2870031) (← links)
- A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations (Q2876572) (← links)
- Computing a Longest Common Palindromic Subsequence (Q2876577) (← links)
- Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet (Q2889909) (← links)
- IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES (Q2905309) (← links)
