Non-approximability of Weighted Multiple Sequence Alignment
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Non-approximability of weighted multiple sequence alignment
Theoretical Computer Science - Computing and combinatorics
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Efficient Constrained Multiple Sequence Alignment with Performance Guarantee
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Non-approximability of weighted multiple sequence alignment for arbitrary metrics
Information Processing Letters
On the uniform edge-partition of a tree
Discrete Applied Mathematics
Multiple Sequence Alignment as a Facility-Location Problem
INFORMS Journal on Computing
Constrained sequence alignment: A general model and the hardness results
Discrete Applied Mathematics
Some Approximations for Shortest Common Nonsubsequences and Supersequences
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Improved Approximation Results on the Shortest Common Supersequence Problem
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Non-approximability of weighted multiple sequence alignment for arbitrary metrics
Information Processing Letters
On the bottleneck tree alignment problems
Information Sciences: an International Journal
Approximating border length for DNA microarray synthesis
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A cost-aggregating integer linear program for motif finding
Journal of Discrete Algorithms
A compact mathematical programming formulation for DNA motif finding
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Time and space efficient algorithms for constrained sequence alignment
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Scoring matrices that induce metrics on sequences
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Hardness and approximation of the asynchronous border minimization problem
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 5.23 |