The complexity and approximability of finding maximum feasible subsystems of linear relations
Theoretical Computer Science
Randomized algorithms
Randomized approximation algorithms in combinatorial optimization
Approximation algorithms for NP-hard problems
Efficient approximation algorithms for the Hamming center problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomial-Time Algorithms for Computing Characteristic Strings
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Banishing Bias from Consensus Sequences
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Finding similar regions in many strings
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient approximation algorithms for the Hamming center problem
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
Exact Solutions for CLOSEST STRING and Related Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Approximation Algorithms for Hamming Clustering Problems
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
On the Complexity of Deriving Position Specific Score Matrices from Examples
CPM '02 Proceedings of the 13th 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
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Note: the approximate period problem for DNA alphabet
Theoretical Computer Science
Distinguishing string selection problems
Information and Computation
The consensus string problem for a metric is NP-complete
Journal of Discrete Algorithms
On the complexity of finding common approximate substrings
Theoretical Computer Science
Integer programming models for computational biology problems
Journal of Computer Science and Technology - Special issue on bioinformatics
Hard problems in similarity searching
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
On the complexity of deriving position specific score matrices from positive and negative sequences
Discrete Applied Mathematics
Multiple genome rearrangement by swaps and by element duplications
Theoretical Computer Science
On the Structure of Small Motif Recognition Instances
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
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
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
Hard problems in similarity searching
Discrete Applied Mathematics
Complexities of the centre and median string problems
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
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
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
More Efficient Algorithms for Closest String and Substring Problems
SIAM Journal on Computing
A GRASP algorithm for the Closest String Problem using a probability-based heuristic
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
RNA multiple structural alignment with longest common subsequences
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Randomized algorithms for motif detection
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
An improved heuristic for the far from most strings problem
Journal of Heuristics
On approximating string selection problems with outliers
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Identification of distinguishing motifs
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Finding consensus and optimal alignment of circular strings
Theoretical Computer Science
| Hi-index | 0.00 |