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
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
Integer programming models for computational biology problems
Journal of Computer Science and Technology - Special issue on bioinformatics
Optimal Solutions for the Closest-String Problem via Integer Programming
INFORMS Journal on Computing
Approximation algorithms for labeling hierarchical taxonomies
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A parallel multistart algorithm for the closest string problem
Computers and Operations Research
Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Consensus Optimizing Both Distance Sum and Radius
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
More efficient algorithms for closest string and substring problems
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Finding optimal alignment and consensus of circular strings
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
A three-string approach to the closest string problem
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Why large CLOSEST STRING instances are easy to solve in practice
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
On the hardness of counting and sampling center strings
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
More Efficient Algorithms for Closest String and Substring Problems
SIAM Journal on Computing
Exact algorithm and heuristic for the Closest String Problem
Computers and Operations Research
A heuristic algorithm based on Lagrangian relaxation for the closest string problem
Computers and Operations Research
The bounded search tree algorithm for the closest string problem has quadratic smoothed complexity
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Approximations and partial solutions for the consensus sequence problem
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
A three-string approach to the closest string problem
Journal of Computer and System Sciences
On the closest string via rank distance
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
On the Hardness of Counting and Sampling Center Strings
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Configurations and minority in the string consensus problem
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Finding consensus and optimal alignment of circular strings
Theoretical Computer Science
| Hi-index | 0.00 |