Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Distinguishing string selection problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Linear-Time Algorithm for the 1-Mismatch Problem
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Finding similar regions in many strings
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Distinguishing string selection problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the closest string and substring problems
Journal of the ACM (JACM)
A PTAS for Distinguishing (Sub)string Selection
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Approximation Algorithms for Hamming Clustering Problems
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A Polynominal Time Approximation Scheme for the Closest Substring Problem
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Distinguishing string selection problems
Information and Computation
The consensus string problem for a metric is NP-complete
Journal of Discrete Algorithms
Optimal Solutions for the Closest-String Problem via Integer Programming
INFORMS Journal on Computing
Some results on approximating the minimax solution in approval voting
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
A parallel multistart algorithm for the closest string problem
Computers and Operations Research
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Consensus Optimizing Both Distance Sum and Radius
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Efficient algorithms for model-based motif discovery from multiple sequences
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Discovering almost any hidden motif from multiple sequences
ACM Transactions on Algorithms (TALG)
Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences
SIAM Journal on Discrete Mathematics
Exact algorithm and heuristic for the Closest String Problem
Computers and Operations Research
Approximations and partial solutions for the consensus sequence problem
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
CPCQ: Contrast pattern based clustering quality index for categorical data
Pattern Recognition
On approximating string selection problems with outliers
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Enumerating neighbour and closest strings
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
An efficient two-phase ant colony optimization algorithm for the closest string problem
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
On approximating string selection problems with outliers
Theoretical Computer Science
| Hi-index | 0.00 |