Multiple alignment, communication cost, and graph matching
SIAM Journal on Applied Mathematics
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Randomized algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Distinguishing string selection problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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
A Linear-Time Algorithm for the 1-Mismatch Problem
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Approximation Algorithms for Multiple Sequence Alignment
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
On approximation algorithms for local multiple alignment
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Near optimal multiple alignment within a band in polynomial time
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the closest string and substring problems
Journal of the ACM (JACM)
Finding motifs in the twilight zone
Proceedings of the sixth annual international conference on Computational biology
Biological Sequence Data Mining
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
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
Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
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
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
A combined model and a varied Gibbs sampling algorithm used for motif discovery
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
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
Optimal Solutions for the Closest-String Problem via Integer Programming
INFORMS Journal on Computing
An Exact Data Mining Method for Finding Center Strings and All Their Instances
IEEE Transactions on Knowledge and Data Engineering
Near optimal multiple alignment within a band in polynomial time
Journal of Computer and System Sciences
An upper bound on the hardness of exact matrix based motif discovery
Journal of Discrete Algorithms
Some results on approximating the minimax solution in approval voting
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
An effective algorithm of motif finding problem
International Journal of Bioinformatics Research and Applications
MOGAMOD: Multi-objective genetic algorithm for motif discovery
Expert Systems with Applications: An International Journal
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Finding compact structural motifs
Theoretical Computer Science
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
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
Motif discovery using multi-objective genetic algorithm in biosequences
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
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
Discovering almost any hidden motif from multiple sequences
ACM Transactions on Algorithms (TALG)
More Efficient Algorithms for Closest String and Substring Problems
SIAM Journal on Computing
Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences
SIAM Journal on Discrete Mathematics
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
A linear-time algorithm for studying genetic variation
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
RNA multiple structural alignment with longest common subsequences
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the longest common rigid subsequence problem
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
An upper bound on the hardness of exact matrix based motif discovery
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
An improved heuristic for the far from most strings problem
Journal of Heuristics
Aggregating dependency graphs into voting agendas in multi-issue elections
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Finding compact structural motifs
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Identification of distinguishing motifs
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Enumerating neighbour and closest strings
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
| Hi-index | 0.00 |