| An Integer Linear Programming Approach for Scaffolding Based on Exemplar Breakpoint Distance. | 0 | 0.34 | 2022 |
| The Exact Multiple Pattern Matching Problem Solved By A Reference Tree Approach | 0 | 0.34 | 2021 |
| Computing A Longest Common Almost-Increasing Subsequence Of Two Sequences | 0 | 0.34 | 2021 |
| Clover: A Clustering-Oriented De Novo Assembler For Illumina Sequences | 0 | 0.34 | 2020 |
| Two-string consensus problem under non-overlapping inversion and transposition distance. | 0 | 0.34 | 2018 |
| CSAR-web: a web server of contig scaffolding using algebraic rearrangements. | 0 | 0.34 | 2018 |
| CSAR: a contig scaffolding tool using algebraic rearrangements. | 1 | 0.36 | 2018 |
| R3D-BLAST2: an improved search tool for similar RNA 3D substructures. | 0 | 0.34 | 2017 |
| Multi-CAR: a tool of contig scaffolding using multiple references. | 0 | 0.34 | 2016 |
| An efficient algorithm for one-sided block ordering problem under block-interchange distance. | 0 | 0.34 | 2016 |
| iPARTS2: an improved tool for pairwise alignment of RNA tertiary structures, version 2. | 0 | 0.34 | 2016 |
| An efficient algorithm for computing non-overlapping inversion and transposition distance. | 2 | 0.43 | 2016 |
| An Efficient Algorithm for the Contig Ordering Problem under Algebraic Rearrangement Distance | 1 | 0.36 | 2015 |
| A Systematical and Parallel Approach to Solve Problems Involving Special Properties of Bit-Vectors. | 0 | 0.34 | 2015 |
| Prefix Block-Interchanges on Binary Strings. | 0 | 0.34 | 2014 |
| CAR: contig assembly of prokaryotic draft genomes using rearrangements. | 10 | 0.48 | 2014 |
| Approximate String Matching Problem under Non-Overlapping Inversion Distance. | 0 | 0.34 | 2014 |
| An Efficient Algorithm for One-Sided Block Ordering Problem with Block-Interchange Distance. | 0 | 0.34 | 2013 |
| Assembling contigs in draft genomes using reversals and block-interchanges. | 10 | 0.41 | 2013 |
| A new filtration method and a hybrid strategy for approximate string matching. | 1 | 0.35 | 2013 |
| R3D-BLAST: a search tool for similar RNA 3D substructures. | 5 | 0.46 | 2011 |
| SoRT2: a tool for sorting genomes and reconstructing phylogenetic trees by reversals, generalized transpositions and translocations. | 6 | 0.48 | 2010 |
| Reconstructing genome trees of prokaryotes using overlapping genes. | 10 | 0.37 | 2010 |
| Sorting by reversals, generalized transpositions, and translocations using permutation groups. | 15 | 0.82 | 2010 |
| iPARTS: an improved tool of pairwise alignment of RNA tertiary structures. | 15 | 0.85 | 2010 |
| An improved algorithm for sorting by block-interchanges based on permutation groups | 3 | 0.41 | 2010 |
| FASTR3D: a fast and accurate search tool for similar RNA 3D structures. | 9 | 0.71 | 2009 |
| An improved algorithm for finding a length-constrained maximum-density subtree in a tree | 5 | 0.49 | 2008 |
| SARSA: a web tool for structural alignment of RNA using a structural alphabet. | 23 | 1.06 | 2008 |
| OGtree: a tool for creating genome trees of prokaryotes based on overlapping genes. | 3 | 0.44 | 2008 |
| RE-MuSiC: a tool for multiple sequence alignment with regular expression constraints. | 13 | 0.67 | 2007 |
| Constrained sequence alignment: A general model and the hardness results | 0 | 0.34 | 2007 |
| Efficient algorithms for regular expression constrained sequence alignment | 6 | 0.45 | 2007 |
| SPRING: a tool for the analysis of genome rearrangement using reversals and block-interchanges. | 9 | 1.01 | 2006 |
| Analysis of circular genome rearrangement by fusions, fissions and block-interchanges | 16 | 1.29 | 2006 |
| A memory-efficient algorithm for multiple sequence alignment with constraints | 13 | 0.62 | 2005 |
| The approximability of the weighted Hamiltonian path completion problem on a tree | 2 | 0.41 | 2005 |
| ROBIN: a tool for genome rearrangement of block-interchanges | 6 | 0.58 | 2005 |
| A heuristic approach for detecting RNA H-type pseudoknots. | 6 | 0.45 | 2005 |
| MuSiC: a tool for multiple sequence alignment with constraints | 17 | 0.86 | 2004 |
| Efficient minus and signed domination in graphs | 1 | 0.37 | 2003 |
| The full Steiner tree problem | 25 | 1.11 | 2003 |
| On the full and bottleneck full Steiner tree problems | 17 | 0.93 | 2003 |
| Constrained Multiple Sequence Alignment Tool Development Andits Application to Rnase Family Alignment | 5 | 0.68 | 2003 |
| Perfect edge domination and efficient edge domination in graphs | 18 | 1.16 | 2002 |
| Constrained multiple sequence alignment tool development and its application to RNase family alignment | 33 | 1.92 | 2002 |
| Weighted efficient domination problem on some perfect graphs | 21 | 1.05 | 2002 |
| The Full Steiner Tree Problem in Phylogeny | 5 | 0.43 | 2002 |
| A New Measure of Edit Distance between Labeled Trees | 17 | 1.05 | 2001 |
| An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree | 2 | 0.37 | 2000 |
